結果
| 問題 | No.2984 [Cherry Anniversary 4] 満開の願いを込めた 27 の桜 |
| ユーザー |
 noya2
|
| 提出日時 | 2024-12-09 02:10:10 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 129 ms / 4,000 ms |
| コード長 | 6,421 bytes |
| コンパイル時間 | 3,677 ms |
| コンパイル使用メモリ | 262,460 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-12-09 02:10:18 |
| 合計ジャッジ時間 | 7,184 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"using namespace std;#include<bits/stdc++.h>#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"namespace noya2 {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p){os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p){is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v){int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v){for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &...u){cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u){cout << t;if (sizeof...(u)) cout << sep;out(u...);}template<typename T>void out(const vector<vector<T>> &vv){int s = (int)vv.size();for (int i = 0; i < s; i++) out(vv[i]);}struct IoSetup {IoSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetup_noya2;} // namespace noya2#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"namespace noya2{const int iinf = 1'000'000'007;const long long linf = 2'000'000'000'000'000'000LL;const long long mod998 = 998244353;const long long mod107 = 1000000007;const long double pi = 3.14159265358979323;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";void yes(){ cout << "Yes\n"; }void no(){ cout << "No\n"; }void YES(){ cout << "YES\n"; }void NO(){ cout << "NO\n"; }void yn(bool t){ t ? yes() : no(); }void YN(bool t){ t ? YES() : NO(); }} // namespace noya2#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"namespace noya2{unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){if (a == 0 || b == 0) return a + b;int n = __builtin_ctzll(a); a >>= n;int m = __builtin_ctzll(b); b >>= m;while (a != b) {int mm = __builtin_ctzll(a - b);bool f = a > b;unsigned long long c = f ? a : b;b = f ? b : a;a = (c - b) >> mm;}return a << std::min(n, m);}template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }long long sqrt_fast(long long n) {if (n <= 0) return 0;long long x = sqrt(n);while ((x + 1) * (x + 1) <= n) x++;while (x * x > n) x--;return x;}template<typename T> T floor_div(const T n, const T d) {assert(d != 0);return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);}template<typename T> T ceil_div(const T n, const T d) {assert(d != 0);return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);}template<typename T> void uniq(std::vector<T> &v){std::sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }} // namespace noya2#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)#define all(v) (v).begin(),(v).end()using ll = long long;using ld = long double;using uint = unsigned int;using ull = unsigned long long;using pii = pair<int,int>;using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;namespace noya2{/* ~ (. _________ . /) */}using namespace noya2;#line 2 "c.cpp"void solve(){using dat = array<array<array<int,3>,3>,3>;dat a;rep(i,3) rep(j,3) rep(k,3) in(a[i][j][k]);dat b;rep(i,3) rep(j,3) rep(k,3) in(b[i][j][k]);int ans = iinf;using ar = array<int,3>;auto procx = [&](const dat &v, ar p){dat ret;rep(x,3) rep(y,3) rep(z,3){ret[p[x]][y][z] = v[x][y][z];}return ret;};auto procy = [&](const dat &v, ar p){dat ret;rep(x,3) rep(y,3) rep(z,3){ret[x][p[y]][z] = v[x][y][z];}return ret;};auto procz = [&](const dat &v, ar p){dat ret;rep(x,3) rep(y,3) rep(z,3){ret[x][y][p[z]] = v[x][y][z];}return ret;};map<ar,int> mp;mp[{0,1,2}] = 0;mp[{0,2,1}] = 1;mp[{1,0,2}] = 1;mp[{1,2,0}] = 2;mp[{2,0,1}] = 2;mp[{2,1,0}] = 1;ar px = {0,1,2};do {ar py = {0,1,2};do {ar pz = {0,1,2};do {dat v = procx(procy(procz(a, pz), py), px);bool ok = true;rep(j,3) rep(k,3){int sum = v[0][j][k] + v[1][j][k] + v[2][j][k];if (sum != b[0][j][k]){ok = false;}}rep(i,3) rep(k,3){int sum = v[i][0][k] + v[i][1][k] + v[i][2][k];if (sum != b[1][i][k]){ok = false;}}rep(i,3) rep(j,3){int sum = v[i][j][0] + v[i][j][1] + v[i][j][2];if (sum != b[2][i][j]){ok = false;}}if (ok){chmin(ans,mp[px]+mp[py]+mp[pz]);}}while(next_permutation(all(pz)));}while(next_permutation(all(py)));}while(next_permutation(all(px)));if (ans == iinf) ans = -1;out(ans);}int main(){int t = 1; in(t);while (t--) { solve(); }}