結果
問題 |
No.3131 Twin Slide Puzzles
|
ユーザー |
![]() |
提出日時 | 2025-05-01 00:35:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,085 bytes |
コンパイル時間 | 4,106 ms |
コンパイル使用メモリ | 199,276 KB |
実行使用メモリ | 43,520 KB |
最終ジャッジ日時 | 2025-05-01 00:35:42 |
合計ジャッジ時間 | 19,826 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 WA * 16 RE * 1 |
ソースコード
#include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> // using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector<mint> &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector<vector<mint>> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } ll inversion(ll N, vector<ll> &vec) { fenwick_tree<ll> bit(N); ll ret = 0; for (ll i = 0; i < N; i++) { ret += bit.sum(vec[i], N); bit.add(vec[i], 1); } return ret; } int main() { ll N; cin >> N; vector A(N, vector<ll>(N)); for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { cin >> A[i][j]; } } // 先頭 16 個または 25 個から 9 個を選んで乱択する if (N <= 3) { vector<ll> vec(N * N); for (ll i = 0; i < N * N; i++) { vec[i] = i; } map<ll, vector<ll>> mp; do { if (inversion(N * N, vec) % 2 == 0) { ll score = 0; for (ll i = 0; i < N * N; i++) { score += A[i / N][i % N] * vec[i]; } if (mp.find(score) == mp.end()) { mp[score] = vec; } else { cout << "Yes" << endl; for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { cout << vec[i * N + j] << (j == N - 1 ? "" : " "); } cout << endl; } for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { cout << mp[score][i * N + j] << (j == N - 1 ? "" : " "); } cout << endl; } return 0; } } } while (next_permutation(all(vec))); cout << "No" << endl; } else { srand(time(NULL)); // 先頭 16 個から 9 個を選んで乱択する vector<ll> rd(0); vector<ll> chosen(16, -1); for (ll i = 0; i < 9; i++) { while (true) { ll r = rand() % 16; if (chosen[r] == -1) { rd.push_back(r); chosen[r] = i; break; } } } sort(all(rd)); for (ll i = 0; i < 9; i++) { chosen[rd[i]] = i; } debug(rd); vector<ll> vec(N * N); for (ll i = 0; i < N * N; i++) { vec[i] = i; } map<ll, vector<ll>> mp; do { vector<ll> vec_cpy(16, 0); for (ll i = 0; i < 16; i++) { if (chosen[i] != -1) { vec_cpy[i] = rd[chosen[i]]; } else { vec_cpy[i] = i; } } if (inversion(16, vec_cpy) % 2 == 0) { ll score = 0; for (ll i = 0; i < 16; i++) { score += A[i / N][i % N] * vec_cpy[i]; } if (mp.find(score) != mp.end()) { cout << "Yes" << endl; for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { if (i * N + j < 16) { cout << mp[score][i * N + j] << (j == N - 1 ? "" : " "); } else { cout << i * N + j << (j == N - 1 ? "" : " "); } } cout << endl; } for (ll i = 0; i < N; i++) { for (ll j = 0; j < N; j++) { if (i * N + j < 16) { cout << vec_cpy[i * N + j] << (j == N - 1 ? "" : " "); } else { cout << i * N + j << (j == N - 1 ? "" : " "); } } cout << endl; } return 0; } else { mp[score] = vec_cpy; } } } while (next_permutation(all(rd))); assert(1 == 0); } }