結果
問題 | No.839 Keep Distance and Nobody Explodes |
ユーザー | Pachicobue |
提出日時 | 2019-06-19 13:45:43 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 4,215 bytes |
コンパイル時間 | 2,478 ms |
コンパイル使用メモリ | 205,676 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-07 14:32:18 |
合計ジャッジ時間 | 4,049 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 10 ms
5,376 KB |
testcase_06 | AC | 10 ms
5,376 KB |
testcase_07 | AC | 10 ms
5,376 KB |
testcase_08 | AC | 10 ms
5,376 KB |
testcase_09 | AC | 10 ms
5,376 KB |
testcase_10 | AC | 10 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 4 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 9 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 6 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 8 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 6 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 3 ms
5,376 KB |
testcase_27 | AC | 4 ms
5,376 KB |
testcase_28 | AC | 3 ms
5,376 KB |
testcase_29 | AC | 7 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> #pragma GCC diagnostic ignored "-Wsign-compare" #pragma GCC diagnostic ignored "-Wsign-conversion" #define NDEBUG #define SHOW(...) static_cast<void>(0) //!===========================================================!// //! dP dP dP !// //! 88 88 88 !// //! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !// //! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !// //! 88 88 88. ... 88. .88 88. .88 88. ... 88 !// //! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !// //!===========================================================!// template <typename T, typename A> std::istream& operator>>(std::istream& is, std::vector<T, A>& v) { for (auto& e : v) { is >> e; } return is; } template <typename T> T read() { T v; return std::cin >> v, v; } template <typename T> std::vector<T> readVec(const std::size_t l) { std::vector<T> v(l); for (auto& e : v) { std::cin >> e; } return v; } using ld = long double; using uint = unsigned int; using ll = long long; using ull = unsigned long long; constexpr unsigned int MOD = 1000000007; template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4; template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385); std::mt19937 mt{std::random_device{}()}; template <typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); } template <typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); } template <typename T> std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); } template <class... Args> auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); } template <typename T> constexpr T popCount(const T u) { #ifdef __has_builtin return u == 0 ? T(0) : (T)__builtin_popcountll(u); #else unsigned long long v = static_cast<unsigned long long>(u); return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f); #endif } template <typename T> constexpr T log2p1(const T u) { #ifdef __has_builtin return u == 0 ? T(0) : T(64 - __builtin_clzll(u)); #else unsigned long long v = static_cast<unsigned long long>(u); return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v); #endif } template <typename T> constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); } template <typename T> constexpr T msbp1(const T v) { return log2p1(v); } template <typename T> constexpr T lsbp1(const T v) { #ifdef __has_builtin return __builtin_ffsll(v); #else return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1); #endif } template <typename T> constexpr bool ispow2(const T v) { return popCount(v) == 1; } template <typename T> constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); } template <typename T> constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); } //!============================================!// //! 8888ba.88ba oo !// //! 88 '8b '8b !// //! 88 88 88 .d8888b. dP 88d888b. !// //! 88 88 88 88' '88 88 88' '88 !// //! 88 88 88 88. .88 88 88 88 !// //! dP dP dP '88888P8 dP dP dP !// //!============================================!// int main() { const int N = read<int>(), M = N / 2; auto ans = Vec(N, N, 0); int v = 1; for (int i = 0; i < M; i++) { for (int j = 0; j < M; j++) { ans[i][j] = v++, ans[i + M][j + M] = v++; } } for (int j = N - 1; j >= M; j--) { for (int i = 0; i < M; i++) { ans[i][j] = v++, ans[i + M][j - M] = v++; } } for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { std::cout << ans[i][j] << " "; } std::cout << std::endl; } return 0; }