結果

問題 No.5022 XOR Printer
ユーザー 👑 binap
提出日時 2025-07-26 15:53:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,236 bytes
コンパイル時間 3,932 ms
コンパイル使用メモリ 258,624 KB
実行使用メモリ 7,716 KB
スコア 4,965,975,011
最終ジャッジ日時 2025-07-26 15:53:22
合計ジャッジ時間 5,714 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}


int main(){
	int N, T;
	cin >> N >> T;
	const int K = 20;
	const int M = 6;
	vector<vector<int>> A(N, vector<int>(N));
	cin >> A;
	vector<pair<int, int>> basis;
	
	int y = 0, x = 0, s = 0;
	string O;
	auto R = [&](){x++; O += 'R';};
	auto L = [&](){x--; O += 'L';};
	auto D = [&](){y++; O += 'D';};
	auto U = [&](){y--; O += 'U';};
	auto C = [&](){s ^= A[y][x]; O += 'C';};
	auto W = [&](){A[y][x] ^= s; O += 'W';};
	
	vector<pair<int, int>> P;
	rep(z, N / 2){
		rep(x, N) P.emplace_back(2 * z, x);
		rep(x, N) P.emplace_back(2 * z + 1, (N - 1) - x);
	}
	
	auto Move = [&](int y_to, int x_to){
		while(y_to > y) D();
		while(x_to > x) R();
		while(y_to < y) U();
		while(x_to < x) L();
	};
	
	rep(p, M){
		for(auto [y1, x1] : P){
			bool ng = false;
			for(int q = 0; q < p; q++){
				auto [y2, x2] = basis[q];
				if(y1 == y2 and x1 == x2) ng = true;
			}
			if(ng) continue;
			
			bool success = false;
			{
				int val = A[y1][x1] ^ s;
				for(int q = 0; q < p; q++){
					auto [y2, x2] = basis[q];
					if((val >> (K - 1 - q)) & 1) val ^= A[y2][x2];
				}
				if((val >> (K - 1 - p)) & 1){
					success = true;
				}
			}
			
			if(success){
				cerr << y1 << ' ' << x1 << "\n";
				int val = A[y1][x1] ^ s;
				cerr << val << "\n";
				for(int q = 0; q < p; q++){
					auto [y2, x2] = basis[q];
					if((val >> (K - 1 - q)) & 1){
						val ^= A[y2][x2];
						Move(y2, x2);
						C();
					}
					cerr << val << "\n";
				}
				Move(y1, x1);
				W();
				basis.emplace_back(y1, x1);
				break;
			}
		}
	}
	
	rep(p, M){
		for(int q = 0; q < p; q++){
			if((s >> (K - 1 - q)) & 1){
				auto [y1, x1] = basis[q];
				Move(y1, x1);
				C();
			}
		}
		{
			if(((s >> (K - 1 - p)) & 1) == 0){
				auto [y1, x1] = basis[p];
				Move(y1, x1);
				C();
			}
		}
		for(auto [y1, x1] : P){
			bool ng = false;
			for(int q = 0; q < M; q++){
				auto [y2, x2] = basis[q];
				if(y1 == y2 and x1 == x2) ng = true;
			}
			if(ng) continue;
			
			if(((A[y1][x1] >> (K - 1 - p)) & 1) == 0){
				Move(y1, x1);
				W();
			}
		}
	}
	
	rep(i, min(int(O.size()), T)){
		auto c = O[i];
		cout << c << "\n";
	}
	
	return 0;
}
0