結果
問題 | No.2212 One XOR Matrix |
ユーザー |
![]() |
提出日時 | 2023-02-10 22:36:15 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 7,009 bytes |
コンパイル時間 | 1,937 ms |
コンパイル使用メモリ | 203,072 KB |
最終ジャッジ日時 | 2025-02-10 13:04:14 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 8 |
ソースコード
// clang-format off#ifdef _LOCAL#include <pch.hpp>#else#include <bits/stdc++.h>#define cerr if (false) cerr#define debug_bar#define debug(...)#define debug2(vv)#define debug3(vvv)#endifusing namespace std;using ll = long long;using ld = long double;using str = string;#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)#define REP(i,n) FOR(i,0,n)#define RREP(i,n) RFOR(i,0,n)#define ALL(c) (c).begin(), (c).end()#define SORT(c) sort(ALL(c))#define RSORT(c) sort((c).rbegin(), (c).rend())#define MIN(c) *min_element(ALL(c))#define MAX(c) *max_element(ALL(c))#define COUNT(c,v) count(ALL(c),(v))#define SZ(c) ((ll)(c).size())#define len(c) ((ll)(c).size())#define BIT(b,i) (((b)>>(i)) & 1)#define PCNT(b) ((ll)__builtin_popcountll(b))#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); (c).shrink_to_fit(); } while (0)#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)template<class... T> void input(T&... a) { (cin >> ... >> a); }void print() { cout << '\n'; }template<class T> void print(const T& a) { cout << a << '\n'; }template<class P1, class P2> void print(const pair<P1, P2>& a) { cout << a.first << " " << a.second << '\n'; }template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; }cout << '\n'; }template<class T> void print(const vector<T>& a) { cout_line(a, 0, a.size()); }template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) {S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }template<class T> string to_binary(T x, int B = 0) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; }reverse(s.begin(), s.end()); return s; }template<class F> ll binary_search(const F& is_ok, ll ok, ll ng) { while (abs(ok - ng) > 1) { ll m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; }return ok; }template<class F> double binary_search_real(const F& is_ok, double ok, double ng, int iter = 90) { for (int i = 0; i < iter; i++) { double m = (ok +ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }template<class T> using PQ_max = priority_queue<T>;template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;template<class T> T pick(stack<T>& s) { assert(not s.empty()); T x = s.top(); s.pop(); return x; }template<class T> T pick(queue<T>& q) { assert(not q.empty()); T x = q.front(); q.pop(); return x; }template<class T> T pick_front(deque<T>& dq) { assert(not dq.empty()); T x = dq.front(); dq.pop_front(); return x; }template<class T> T pick_back(deque<T>& dq) { assert(not dq.empty()); T x = dq.back(); dq.pop_back(); return x; }template<class T> T pick(PQ_min<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }template<class T> T pick(PQ_max<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }template<class T> T pick(vector<T>& v) { assert(not v.empty()); T x = v.back(); v.pop_back(); return x; }ll min(int a, ll b) { return min((ll)a, b); }ll min(ll a, int b) { return min(a, (ll)b); }ll max(int a, ll b) { return max((ll)a, b); }ll max(ll a, int b) { return max(a, (ll)b); }ll mod(ll x, ll m) { assert(m > 0); return (x % m + m) % m; }ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }ll digitlen(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }ll msb(ll b) { return (b <= 0 ? -1 : (63 - __builtin_clzll(b))); }ll lsb(ll b) { return (b <= 0 ? -1 : __builtin_ctzll(b)); }int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }using P = pair<ll,ll>;using VP = vector<P>;using VVP = vector<VP>;using VC = vector<char>;using VS = vector<string>;using VVS = vector<VS>;using VI = vector<int>;using VVI = vector<VI>;using VVVI = vector<VVI>;using VLL = vector<ll>;using VVLL = vector<VLL>;using VVVLL = vector<VVLL>;using VB = vector<bool>;using VVB = vector<VB>;using VVVB = vector<VVB>;using VD = vector<double>;using VVD = vector<VD>;using VVVD = vector<VVD>;using VLD = vector<ld>;using VVLD = vector<VLD>;using VVVLD = vector<VVLD>;const ld EPS = 1e-10;const ld PI = acosl(-1.0);constexpr int inf = (1 << 30) - 1; // 1073741824 - 1constexpr ll INF = (1LL << 62) - 1; // 4611686018427387904 - 1// --------------------------------------------------------// clang-format onint main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);ll N;input(N);if (N == 1) { END(-1); }VVI A = {{7, 14, 0, 8},{4, 12, 2, 11},{15, 9, 6, 1},{13, 10, 5, 3},};VVI B = {{0, 1, 2, 3},{4, 5, 6, 7},{8, 9, 10, 11},{12, 13, 14, 15},};int M = (1 << N);VVI ans(M, VI(M));int sum = 0;REP (h, M / 4) {REP (w, M / 4) {auto& X = (h == w ? A : B);int sh = 4 * h;int sw = 4 * w;debug(h, w, sh, sw, sum);REP (i, 4) {REP (j, 4) {ans[sh + i][sw + j] = X[i][j] + sum;}}sum += 16;}}REP (i, M) { print(ans[i]); }REP (i, M) {int x = 0;REP (j, M) { x ^= ans[i][j]; }assert(x == 1);}REP (j, M) {int x = 0;REP (i, M) { x ^= ans[i][j]; }assert(x == 1);}return 0;}