結果

問題 No.228 ゆきこちゃんの 15 パズル
コンテスト
ユーザー fumiphys
提出日時 2019-10-07 21:38:08
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 3,906 bytes
コンパイル時間 1,559 ms
コンパイル使用メモリ 168,216 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-14 16:43:15
合計ジャッジ時間 2,406 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int a[4][4];
int b[4][4];

bool check(){
  rep(i, 4)rep(j, 4){
    if(a[i][j] != b[i][j])return false;
  }
  return true;
}

int main(int argc, char const* argv[])
{
  int n = 4;
  rep(i, n)rep(j, n){
    cin >> a[i][j];
  }
  rep(i, n)rep(j, n){
    b[i][j] = 1 + (i * n + j);
  }
  b[n-1][n-1] = 0;
  int x = 3, y = 3;
  // vector<bool> used(16, false);
  while(true){
    /*rep(i, n)rep(j, n){
      cerr << b[i][j] << "\n "[j + 1 != n];
      }*/
    if(a[x][y] == 0 && check()){
      cout << "Yes" << endl;
      return 0;
    }else if(a[x][y] == 0){
      cout << "No" << endl;
      return 0;
    }
    rep(k, 4){
      int nx = x + dx[k];
      int ny = y + dy[k];
      if(nx >= 0 && nx < n && ny >= 0 && ny < n){
        if(b[nx][ny] == a[x][y]){
          swap(b[x][y], b[nx][ny]);
          x = nx; y = ny;
          break;
        }
      }
      if(k == 3){
        cout << "No" << endl;
        return 0;
      }
    }
    /*rep(i, n)rep(j, n){
      cerr << b[i][j] << "\n "[j + 1 != n];
      }*/
  }
  return 0;
}
0