結果

問題 No.228 ゆきこちゃんの 15 パズル
ユーザー ShibuyapShibuyap
提出日時 2020-02-29 13:13:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 1,358 bytes
コンパイル時間 1,513 ms
コンパイル使用メモリ 167,260 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-13 19:56:56
合計ジャッジ時間 2,596 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/exception_ptr.h:43,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/exception:168,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
In function 'std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]',
    inlined from 'int main()' at main.cpp:48:21:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/move.h:205:11: warning: 'y' may be used uninitialized [-Wmaybe-uninitialized]
  205 |       __a = _GLIBCXX_MOVE(__b);
      |           ^
main.cpp: In function 'int main()':
main.cpp:31:16: note: 'y' was declared here
   31 |         int x, y;
      |                ^
In function 'std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]',
    inlined from 'int main()' at main.cpp:48:21:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/move.h:205:11: warning: 'x' may be used uninitialized [-Wmaybe-uninitialized]
  205 |       __a = _GLIBCXX_MOVE(__b);
      |           ^
main.cpp: In function 'int main()':
main.cpp:31:13: note: 'x' was declared here
   31 |         int x, y;
      |             ^

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int a[6][6];
    rep(i,6){
        if(i == 0 || i == 5){
            rep(j,6)a[i][j] = 1001;
        }else{
            a[i][0] = 1001;
            a[1][5] = 1001;
            srep(j,1,5){
                cin >> a[i][j];
                if(a[i][j] == 0)a[i][j] = 16;
            }
        }
    }

    int dx[4] = {-1, 1, 0, 0};
    int dy[4] = {0, 0, -1, 1};

    while(true){
        int flag = 1;
        int x, y;
        srep(i,1,5){
            srep(j,1,5){
                if(a[i][j] != (i - 1) * 4 + j)flag = 0;
                if(a[i][j] == 16){
                    x = i; y = j;
                }
            }
        }
        if(flag){
            cout << "Yes" << endl;
            return 0;
        }

        rep(i,4){
            if(a[x+dx[i]][y+dy[i]] == (x - 1) * 4 + y){
                flag = 1;
                swap(a[x][y], a[x+dx[i]][y+dy[i]]);
                break;
            }
        }

        if(flag == 0){
            cout << "No" << endl;
            return 0;
        }

    }


    return 0;
}
0