結果

問題 No.2986 Permutation Puzzle
ユーザー akiaa11
提出日時 2025-02-03 18:24:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 217 ms / 2,000 ms
コード長 5,016 bytes
コンパイル時間 7,263 ms
コンパイル使用メモリ 291,352 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2025-02-03 18:24:40
合計ジャッジ時間 11,739 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k;cin>>n>>k;
	vector a(n, veci(n)), b(n, veci(n));
	rep(i, n) rep(j, n) cin>>a[i][j], a[i][j]--;
	rep(i, n) rep(j, n) cin>>b[i][j], b[i][j]--;
	veci r;
	auto f = [&](vector<veci>& a, int d){
			if(d >= n){
				rep(i, n) rep(j, i, n) swap(a[j][i], a[i][j]);
			}
			auto na = a;
			rep(j, n) na[a[d % n][j]] = a[j];
			swap(a, na);
			if(d >= n){
				rep(i, n) rep(j, i, n) swap(a[j][i], a[i][j]);
			}
	};
	auto rec = [&](auto f2, vector<veci> t, int c) -> int{
		if(c == k) return t == b;
		rep(i, n){
			auto d = t;
			f(d, i);
			if(f2(f2, d, c + 1)){
				r.push_back(i);
				return 1;
			}
		}
		rep(i, n){
			auto d = t;
			f(d, i + n);
			if(f2(f2, d, c + 1)){
				r.push_back(i + n);
				return 1;
			}
		}
		return 0;
	};
	rec(rec, a, 0);
	vector<pair<char, int>> ans;
	vector p(k, veci(n));
	{
		auto ta = a;
		rrep(i, r.size()){
			int d = r[i];
			if(d < n) p[i] = a[d % n];
			else rep(j, n) p[i][j] = a[j][d % n];
			f(a, d);
		}
		assert(a == b);
		swap(a, ta);
	}
	swap(a, b);
	rep(q, r.size()){
		int d = r[q];
		auto f3 = [&](){
			if(d < n){
				rep(i, n) if(p[q] == a[i]){
					d = i;
					break;
				}
			}else{
				rep(j, n){
					int u = 1;
					rep(i, n) u &= p[q][i] == a[i][j];
					if(u){
						d = j + n;
						break;
					}
				}
			}
		};
		f3();
		veci used(n);
		char res = 'R';
		if(d >= n){
			res = 'C';
			rep(i, n) rep(j, i, n) swap(a[j][i], a[i][j]);
		}
		int l = 1;
		rep(i, n) if(!used[i]){
			int v = i, cnt = 1;
			used[v] = 1;
			while(1){
				v = a[d % n][v];
				if(used[v]) break;
				used[v] = 1, cnt++;
			}
			l = l * cnt / gcd(cnt, l);
		}
		if(d >= n){
			rep(i, n) rep(j, i, n) swap(a[j][i], a[i][j]);
		}
		rep(i, l - 1){
			f(a, d);
			ans.emplace_back(res, d % n + 1);
			f3();
		}
	}
	assert(a == b);
	cout<<ans.size()<<endl;
	for(auto v : ans) cout<<v<<endl;
}
0