結果

問題 No.2984 [Cherry Anniversary 4] 満開の願いを込めた 27 の桜
ユーザー akiaa11
提出日時 2024-12-28 18:37:49
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 151 ms / 4,000 ms
コード長 4,601 bytes
コンパイル時間 4,565 ms
コンパイル使用メモリ 272,168 KB
最終ジャッジ日時 2025-02-26 17:06:06
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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 test;cin>>test;
	rep(_, test){
		const int n = 3;
		vector a(3, vector(3, veci(3))), b(3, vector(3, veci(3)));
		rep(i, 3) rep(j, 3) rep(k, 3) cin>>a[i][j][k];
		rep(i, 3) rep(j, 3) rep(k, 3) cin>>b[i][j][k];
		vector<vecpii> d = {{{-1, -1}}, {{0, 1}}, {{0, 2}}, {{1, 2}}, {{0, 1}, {1, 2}}, {{0, 1}, {0, 2}}};
		int ans = inf;
		rep(i, d.size()){
			if(i){rep(j, d[i].size()) rep(l, n) rep(r, n) swap(a[d[i][j].fi][l][r], a[d[i][j].se][l][r]);}
			rep(p, d.size()){
				if(p){rep(j, d[p].size()) rep(l, n) rep(r, n) swap(a[l][d[p][j].fi][r], a[l][d[p][j].se][r]);}
				rep(q, d.size()){
					if(q){rep(j, d[q].size()) rep(l, n) rep(r, n) swap(a[l][r][d[q][j].fi], a[l][r][d[q][j].se]);}
					int u = 1;
					rep(l, n) rep(r, n){
						int c = 0, c2 = 0, c3 = 0;
						rep(d, n){
							c += a[l][r][d];
							c2 += a[l][d][r];
							c3 += a[d][l][r];
						}
						u &= c == b[2][l][r] && c2 == b[1][l][r] && c3 == b[0][l][r];
					}
					if(u) chmin(ans, int(d[i].size() + d[p].size() + d[q].size()) - ((i == 0) + (p == 0) + (q == 0)));
					if(q){rrep(j, d[q].size()) rep(l, n) rep(r, n) swap(a[l][r][d[q][j].fi], a[l][r][d[q][j].se]);}
				}
				if(p){rrep(j, d[p].size()) rep(l, n) rep(r, n) swap(a[l][d[p][j].fi][r], a[l][d[p][j].se][r]);}
			}
			if(i){rrep(j, d[i].size()) rep(l, n) rep(r, n) swap(a[d[i][j].fi][l][r], a[d[i][j].se][l][r]);}
		}
		if(ans == inf) ans = -1;
		cout<<ans<<endl;
	}
}
0