結果

問題 No.3131 Twin Slide Puzzles
コンテスト
ユーザー amentorimaru
提出日時 2025-04-25 23:11:50
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,150 bytes
コンパイル時間 5,324 ms
コンパイル使用メモリ 274,068 KB
実行使用メモリ 15,140 KB
最終ジャッジ日時 2025-04-25 23:12:08
合計ジャッジ時間 17,350 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 2
other AC * 22 WA * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define ATCODER
#include <bit>
#include <cstdint>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <bitset>
#include <chrono>
#include <type_traits>
using namespace std;

using ll = long long;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VP vector< pair<ll,ll> >
#define VVP vector<vector<pair<ll,ll>>>
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define MP(a,b) make_pair(a,b)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

template<typename T> T det2(array<T, 4> ar) { return ar[0] * ar[3] - ar[1] * ar[2]; }
template<typename T> T det3(array<T, 9> ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; }
template<typename T> bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; }
template<typename T> bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; }
template<typename T> void inc(vector<T>& ar) { for (auto& v : ar) v++; }
template<typename T> void dec(vector<T>& ar) { for (auto& v : ar) v--; }
template<typename T> vector<pair<T, int>> id_sort(vector<T>& a) {
  vector<T, int> res(a.size());
  for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i);
  SORT(res);
  return res;
}

using val = ll; using func = ll;

val op(val a, val b) { return max(a, b); }
val e() { return 0; }
val mp(func f, val a) { return a + f; }
func comp(func f, func g) { return f + g; }
func id() { return 0; }


// Rook
ll dxr[4] = { 1,0,-1,0 };
ll dyr[4] = { 0,1,0,-1 };
// Bishop
ll dxb[4] = { -1,-1,1,1 };
ll djb[4] = { -1,1,-1,1 };
// qween
ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dyq[8] = { -1,-1,0,1,1,1,0,-1 };

class BIT {
public:
  BIT(ll s) {
    size = 1;
    while (size < s)
      size *= 2;
    bit.assign(size, 0); // def unit
  }

  void update(ll k, ll var) {
    k += 1;
    while (k <= size) {
      bit[k - 1] += var;  // def func
      k += k & -k;
    }
  }

  ll query(ll a) {
    ll s = 0;
    a++;
    while (a > 0) {
      s += bit[a - 1];  // def func
      a -= a & -a;
    }
    return s;
  }

  ll size;
  vector<ll> bit;
};

void solve() {
  ll n;
  cin >> n;
  ll n2 = n * n;
  VL a = read(n2);
  VP ai(n2);
  REP(i, n2)ai[i] = MP(a[i], i);
  SORT(ai);

  if (n == 2) {
    VVL ps = { { 0,1,2,3 },{1,0,2,3},{1,3,2,0},{1,3,0,2} };
    
  }

  // スライドパズルなんだからそら動くの空白だけだよなぁ（誤読）
  BIT bit(n2);
  ll t = 0;
  REP(i, n2) {
    t += bit.query(ai[i].second);
    bit.update(ai[i].second, 1);
  }
  
  // Nがでかい場合は絶対にいい内分点があるので、それでよさそう
  REP(i, n2 - 2) {
    if (abs(ai[i + 2].first - ai[i].first) < n2 - 1) {
      VL ans(n2);
      vector<bool> use(n2);
      auto [v0, i0] = ai[i];
      auto [v1, i1] = ai[i + 1];
      auto [v2, i2] = ai[i + 2];
      use[1] = use[v2 - v0 + 1] = true;
      use[v1 - v0 + 1] = true;
      ans[i0] = 1;
      ans[i2] = v2 - v0 + 1;
      ans[i1] = v1 - v0 + 1;
      ll zz = 0;
      ll vv = 0;
      REP(j, n2) {
        if (j == i0 || j == i1 || j == i2)continue;
        while (use[vv])vv++;
        ans[j] = vv;
        if (vv == 0)zz = j;
        use[vv] = true;
      }
      BIT b2(n2);
      ll t2 = 0;
      REP(j, n2) {
        t2 += bit.query(ans[j]);
        bit.update(ans[j], 1);
      }
      bool ok = true;
      if (t2 % 2 != zz % 2) {        
        ok = false;
        REP(j, n2 - 1) {
          if (j == i0 || j == i1 || j == i2 || j + 1 == i0 || j + 1 == i1 || j + 1 == i2 || ans[j] == 0 || ans[j + 1] == 0)continue;
          swap(ans[j], ans[j + 1]);
          ok = true;
          break;
        }
      }
      if (!ok)continue;

      swap(ans[i1], ans[i2]);
      swap(ans[i0], ans[i1]);
      cout << "Yes\n";
      REP(i, n2) {
        cout << ans[i] << " ";
        if (i % n == n - 1)cout << "\n";
      }
      swap(ans[i1], ans[i2]);
      swap(ans[i0], ans[i1]);
      REP(i, n2) {
        cout << ans[i] << " ";
        if (i % n == n - 1)cout << "\n";
      }
      return;
    }
  }

  // とりあえず定数倍軽いし雑にTLEするのと、転倒数がバラバラに変わるのでたぶんちがう
  REP(i, n2) {
    FOR(j, i + 1, n2) {
      FOR(k, j + 1, n2) {
        auto [v0, i0] = ai[i];
        auto [v1, i1] = ai[j];
        auto [v2, i2] = ai[k];
        ll g = gcd(v2 - v1, v1 - v0);
        if ((v2 - v0) / g < n2 - 1) {
          VL ans(n2);
          vector<bool> use(n2);
          use[1] = use[(v2 - v0) / g + 1] = true;
          use[(v1 - v0) / g + 1] = true;
          ans[i0] = 1;
          ans[i2] = (v2 - v0) / g + 1;
          ans[i1] = (v1 - v0) / g + 1;
          ll vv = 0;
          ll zz = 0;
          REP(j, n2) {
            if (j == i0 || j == i1 || j == i2)continue;
            while (use[vv])vv++;
            ans[j] = vv;
            if (vv == 0)zz = j;
            use[vv] = true;
          }
          BIT b2(n2);
          ll t2 = 0;
          REP(j, n2) {
            t2 += bit.query(ans[j]);
            bit.update(ans[j], 1);
          }
          bool ok = true;
          if (t2 % 2 != zz % 2) {            
            ok = false;
            REP(j, n2 - 1) {
              if (j == i0 || j == i1 || j == i2 || j + 1 == i0 || j + 1 == i1 || j + 1 == i2 || ans[j] == 0 || ans[j + 1] == 0)continue;
              swap(ans[j], ans[j + 1]);
              ok = true;
              break;
            }
          }
          if (!ok)continue;
          cout << "Yes\n";
          swap(ans[i1], ans[i2]);
          swap(ans[i0], ans[i1]);
          REP(i, n2) {
            cout << ans[i] << " ";
            if (i % n == n - 1)cout << "\n";
          }
          swap(ans[i1], ans[i2]);
          swap(ans[i0], ans[i1]);
          REP(i, n2) {
            cout << ans[i] << " ";
            if (i % n == n - 1)cout << "\n";
          }
          return;
        }
      }
    }
  }
  cout << "No";
  return;
}

int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
0