結果
| 問題 | No.283 スライドパズルと魔方陣 |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-21 18:23:27 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,804 bytes |
| コンパイル時間 | 1,821 ms |
| コンパイル使用メモリ | 134,020 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-10-15 04:53:47 |
| 合計ジャッジ時間 | 7,140 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | RE | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | RE | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | RE | - |
| testcase_26 | WA | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | RE | - |
| testcase_34 | WA | - |
| testcase_35 | RE | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | RE | - |
ソースコード
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
ll mod_pow(ll x, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
while (b) {
ll r = a % b; a = b; b = r;
}
return a;
}
vector<vector<int>> ad[3] = { {{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}} };
vector<vector<int>> make_s(int n) {
if (n % 2) {
vector<vector<int>> res(n, vector<int>(n));
vector<vector<bool>> used(n, vector<bool>(n, false));
int x = 0, y = n / 2;
rep1(i, n * n) {
res[x][y] = i; used[x][y] = true;
if (i < n * n) {
int nx = x - 1, ny = y + 1;
if (nx < 0)nx += n;
if (ny == n)ny = 0;
if (used[nx][ny]) {
nx = x + 1, ny = y;
if (nx == n)nx = 0;
}
x = nx, y = ny;
}
}
return res;
}
if (n % 4 == 0) {
vector<vector<int>> res(n, vector<int>(n));
if (n == 4) {
res = { {16,9,7,2},{3,6,12,13},{10,15,1,8},{5,4,14,11} };
return res;
}
vector<vector<int>> col(n, vector<int>(n, 0));
rep(i, n / 4)rep(j, n / 4) {
rep(k, 4) {
col[i * 4 + k][j * 4 + k] = 1;
col[i * 4 + k][j * 4 + 3 - k] = 1;
}
}
rep(i, n)rep(j, n) {
if (col[i][j]) {
res[i][j] = i * n + j + 1;
}
}
per(i, n)per(j, n) {
if (!col[i][j]) {
res[i][j] = (n - 1 - i) * n + (n - 1 - j) + 1;
}
}
return res;
}
int d = n / 2;
vector<vector<int>> res(n, vector<int>(n));
vector<vector<int>> p = make_s(d);
rep(i, d)rep(j, d) {
p[i][j] = (p[i][j] - 1) * 4;
}
rep(i, d)rep(j, d) {
int lx = 2 * i, ly = 2 * j;
int col = 0;
if (i > d / 2 + 1)col = 2;
else if (i < d / 2 + 1) {
col = 0;
if (i == d / 2 && j == d / 2)col = 1;
}
else {
col = 1;
if (j == d / 2)col = 0;
}
rep(s, 2)rep(t, 2) {
res[lx + s][ly + t] = p[i][j] + ad[col][s][t];
}
}
return res;
}
int n;
vector<vector<int>> a;
int calc(vector<vector<int>> v) {
vector<int> p(n * n);
rep(i, n)rep(j, n) {
p[i * n + j] = v[i][j] - 1;
}
vector<bool> used(n * n);
int res = 0;
rep(i, n * n) {
if (used[i])continue;
int cur = p[i];
int cnt = 1; used[i] = true;
while (cur != i) {
cnt++; used[cur] = true;
cur = p[cur];
}
res += cnt - 1;
}
return res % 2;
}
void trev(vector<vector<int>> &v) {
rep(i, n / 2) {
rep(j, n) {
swap(v[i][j], v[n - 1 - i][j]);
}
}
}
void yrev(vector<vector<int>>& v) {
rep(i, n)rep(j, n / 2) {
swap(v[i][j], v[i][n - 1 - j]);
}
}
void solve() {
/*for (n = 3; n <= 50; n++) {
vector<vector<int>> ans = make_s(n);
cout << n << " " << calc(ans) << "\n";
}*/
cin >> n;
a.resize(n, vector<int>(n));
rep(i, n)rep(j, n)cin >> a[i][j];
rep(i, n)rep(j, n)if (a[i][j] == 0)a[i][j] = n * n;
int b = calc(a);
cout << b << "\n";
if (n == 1) {
cout << "possible\n";
cout << 1 << "\n"; return;
}
else if (n == 2) {
cout << "impossible\n";
}
else {
vector<vector<int>> ans = make_s(n);
rep(i, 2)rep(j, 2) {
vector<vector<int>> cop = ans;
if (i)trev(cop);
if (j)yrev(cop);
int c = calc(cop);
if (b == c) {
cout << "possible\n";
rep(i, n) {
rep(j, n) {
if (j > 0)cout << " ";
cout << cop[i][j];
}
cout << "\n";
}
return;
}
}
assert(false);
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//expr();
//int t; cin >> t; rep(i, t)
//while (cin >> n >> m>>s1>>s2>>t, n)
solve();
return 0;
}