#257768 (C++17) No.240 ナイト散歩

• 問題: No.240 ナイト散歩
• ユーザー: cande398
• 提出日時: 2018-05-14 19:40:40
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 1,702 bytes
• コンパイル時間: 2,236 ms
• コンパイル使用メモリ: 198,320 KB
• 最終ジャッジ日時: 2025-01-05 10:36:36
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 30

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
    int depth = 0, count = 0;
    long long int X, Y;
    bool find = true;
    cin >> X >> Y;
    queue<complex<long long int>> que;
    que.push(complex<long long int> (0, 0));
    while(!que.empty()) {
        
        if(pow(8, depth) <= count) depth++;
        auto now_x = que.front().real();
        auto now_y = que.front().imag();
        //8つの場合においてアレ
        //1
        if(now_x + 1 == X && now_y + 2 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x + 1, now_y + 2));
            count++;
        }
        //2
        if(now_x - 1 == X && now_y + 2 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x - 1, now_y + 2));
            count++;
        }
        //3
        if(now_x - 2 == X && now_y + 1 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x - 2, now_y + 1));
            count++;
        }
        //4
        if(now_x - 2 == X && now_y - 1 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x - 2, now_y - 1));
            count++;
        }
        //5
        if(now_x - 1 == X && now_y - 2 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x - 1, now_y - 2));
            count++;
        }
        //6
        if(now_x + 1 == X && now_y - 2 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x + 1, now_y - 2));
            count++;
        }
        //7
        if(now_x + 2 == X && now_y - 1 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x + 2, now_y - 1));
            count++;
        }
        //8
        if(now_x + 2 == X && now_y + 1 == Y) {
            break;
        }
        else {
            que.push(complex<long long int> (now_x + 2, now_y + 1));
            count++;
        }
        
        que.pop();
        
        if(depth > 3) {
            find = false;
            break;
        }
    }
    if(find) cout << "YES" << endl;
    else cout << "NO" << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX