#709177 (C++14) No.1717 Levi-Civita Triangle

• 問題: No.1717 Levi-Civita Triangle
• ユーザー: square1001
• 提出日時: 2021-10-22 21:45:57
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 63 ms / 2,000 ms
• コード長: 1,986 bytes
• コンパイル時間: 848 ms
• コンパイル使用メモリ: 80,164 KB
• 実行使用メモリ: 7,432 KB
• 最終ジャッジ日時: 2024-09-23 05:09:03
• 合計ジャッジ時間: 3,144 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 42

ソースコード

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
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int solve(int N, vector<int> A) {
    vector<int> B(2 * N - 1);
    for (int i = 0; i <= 2 * N - 2; ++i) {
        vector<int> seq = { A[i], A[i + 1], A[i + 2] };
        if (seq == vector<int>({ 0, 1, 2 }) || seq == vector<int>({ 1, 2, 0 }) || seq == vector<int>({ 2, 0, 1 })) {
            B[i] = 1;
        }
        else if (seq == vector<int>({ 0, 2, 1 }) || seq == vector<int>({ 1, 0, 2 }) || seq == vector<int>({ 2, 1, 0 })) {
            B[i] = 2;
        }
        else {
            B[i] = 0;
        }
    }
    if (N == 1) {
        return B[0];
    }
    vector<int> s0, s1;
    for (int i = 0; i <= 2 * N - 2; ++i) {
        if (i % 2 == 1) {
            s0.push_back(0);
            s1.push_back(0);
        }
        else {
            s0.push_back(i % 4 == 0 ? 1 : 2);
            s1.push_back(i % 4 == 0 ? 2 : 1);
        }
    }
    if (B == (N % 2 == 0 ? s1 : s0)) {
        return 1;
    }
    else if (B == (N % 2 == 0 ? s0 : s1)) {
        return 2;
    }
    return 0;
}
int solve_easy(int N, vector<int> A) {
    for (int len = N; len >= 1; --len) {
        vector<int> B(2 * len - 1);
        for (int i = 0; i <= 2 * len - 2; ++i) {
            vector<int> seq = { A[i], A[i + 1], A[i + 2] };
            if (seq == vector<int>({ 0, 1, 2 }) || seq == vector<int>({ 1, 2, 0 }) || seq == vector<int>({ 2, 0, 1 })) {
                B[i] = 1;
            }
            else if (seq == vector<int>({ 0, 2, 1 }) || seq == vector<int>({ 1, 0, 2 }) || seq == vector<int>({ 2, 1, 0 })) {
                B[i] = 2;
            }
            else {
                B[i] = 0;
            }
        }
        A = B;
    }
    return A[0];
}
void random_check() {
    for (int N = 1; N <= 8; ++N) {
        int mul = 1;
        for (int i = 0; i < 2 * N + 1; ++i) {
            mul *= 3;
        }
        for (int i = 0; i < mul; ++i) {
            vector<int> A(2 * N + 1);
            int x = i;
            for (int j = 0; j <= 2 * N; ++j) {
                A[j] = x % 3;
                x /= 3;
            }
            int res1 = solve(N, A);
            int res2 = solve_easy(N, A);
            if (res1 != res2) {
                cout << "!" << endl;
            }
        }
    }
}
int main() {
    int N;
    cin >> N;
    vector<int> A(2 * N + 1);
    for (int i = 0; i <= 2 * N; ++i) {
        cin >> A[i];
    }
    int res = solve(N, A);
    cout << res << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX