結果

問題 No.2212 One XOR Matrix
ユーザー fastmathfastmath
提出日時 2023-02-10 21:59:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 3,834 bytes
コンパイル時間 1,311 ms
コンパイル使用メモリ 142,620 KB
最終ジャッジ日時 2025-02-10 12:42:45
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#ifdef LOCAL
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define debug2(x, y) std::cerr << #x << ", " << #y << ": " << x << ", " << y << '\n';
#define debug3(x, y, z) std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << '\n';
#else
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#endif
#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
input >> data.x >> data.y;
return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
for (T& x : data)
input >> x;
return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
output << "(" << data.x << "," << data.y << ")";
return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
for (const T& x : data)
output << x << " ";
return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
ll gcd(ll a, ll b) {
while (b) {
tie(a, b) = mp(b, a % b);
}
return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
V <V <vi> > t(2, V <vi> (4, vi(4)));
int a[1 << 10][1<<10];
void solve0(int x, int y, int p, int s, int m) {
if (p == 2) {
FOR (i, 1 << p) {
FOR (j, 1 << p) {
a[x+i][y+j]=t[0][i][j]+s;
}
}
return;
}
int h = 1 << (p - 1);
solve0(x,y,p-1,s,m/4);
solve0(x,y+h,p-1,s+m/2,m/4);
solve0(x+h,y,p-1,s+m,m/4);
solve0(x+h,y+h,p-1,s+m+m/2,m/4);
}
void solve1(int x, int y, int p, int s, int m) {
if (p == 2) {
FOR (i, 1 << p) {
FOR (j, 1 << p) {
a[x+i][y+j]=t[1][i][j]+s;
}
}
return;
}
int h = 1 << (p - 1);
solve1(x,y,p-1,s,m/4);
solve0(x,y+h,p-1,s+m/2,m/4);
solve0(x+h,y,p-1,s+m,m/4);
solve1(x+h,y+h,p-1,s+m+m/2,m/4);
}
signed main() {
#ifdef LOCAL
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int pt = 0;
FOR (i, 4) {
FOR(j,4) {
t[0][i][j] = pt++;
}
}
t[1] = {{7, 14, 0, 8},
{4, 12, 2, 11},
{15, 9, 6, 1},
{13, 10, 5, 3}};
int n;
cin >> n;
if (n == 1) {
cout << -1 << endl;
exit(0);
}
int m = 1 << (2 * n - 1);
solve1(0,0,n,0,m);
FOR(i,1<<n){
FOR(j,1<<n) {
cout << a[i][j] << ' ';
}
cout<<endl;
}
int x= 0;
FOR (i, 1<<n) {
x ^= a[i][5];
}
debug(x);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0