結果

問題 No.1717 Levi-Civita Triangle
ユーザー zkou
提出日時 2021-08-04 21:54:50
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 2,094 bytes
コンパイル時間 1,624 ms
コンパイル使用メモリ 173,348 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-09-23 03:45:05
合計ジャッジ時間 6,010 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 4 TLE * 1 -- * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 高速化愚直解　想定 TLE

#include <bits/stdc++.h>

using namespace std;

int main(){
    int N;
    scanf("%d", &N);

    bitset<200010> bit_0, bit_1, bit_2;
    
    int a;
    for (int i = 0; i < 2 * N + 1; i++) {
        scanf("%d", &a);
        // cout << a << endl;
        if (a == 0) {
            bit_0.set(i);
        } else if (a == 1) {
            bit_1.set(i);
        } else {
            bit_2.set(i);
        }
    }

    // cout << -1 << " 0 " << bit_0.any() << endl;
    // cout << -1 << " 1 " << bit_1.any() << endl;
    // cout << -1 << " 2 " << bit_2.any() << endl;

    for (int i = 0; i < N; i++) {
        bitset<200010> new_bit_0, new_bit_1, new_bit_2;
        bitset<200010> bit_01 = bit_0 & (bit_1 >> 1);
        new_bit_1 |= bit_01 & (bit_2 >> 2);
        new_bit_1 |= bit_1 & (bit_2 >> 1) & (bit_0 >> 2);
        new_bit_1 |= bit_2 & (bit_01 >> 1);
        bitset<200010> bit_10 = bit_1 & (bit_0 >> 1);
        new_bit_2 |= bit_0 & (bit_2 >> 1) & (bit_1 >> 2);
        new_bit_2 |= bit_2 & (bit_10 >> 1);
        new_bit_2 |= bit_10 & (bit_2 >> 2);
        bit_1 = new_bit_1;
        bit_2 = new_bit_2;
        bit_0 = (bit_1 ^ bit_2).flip();
        // cout << i << " 0 " << bit_0.any() << endl;
        // cout << i << " 1 " << bit_1.any() << endl;
        // cout << i << " 2 " << bit_2.any() << endl;
    }

    if (bit_1.any()) putchar('1');
    else if (bit_2.any()) putchar('2');
    else putchar('0');
    
    
    return 0;
}

// for i in range(N):
//     l = 2 * (N - i) - 1
//     bit_10 = bit_1 & (bit_0 >> 1)
//     new_bit_1 = 0
//     new_bit_1 |= bit_0 & (bit_2 >> 1) & (bit_1 >> 2)
//     new_bit_1 |= bit_2 & (bit_10 >> 1)
//     new_bit_1 |= bit_10 & (bit_2 >> 2)
//     bit_01 = bit_0 & (bit_1 >> 1)
//     new_bit_2 = 0
//     new_bit_2 |= bit_01 & (bit_2 >> 2)
//     new_bit_2 |= bit_1 & (bit_2 >> 1) & (bit_0 >> 2)
//     new_bit_2 |= bit_2 & (bit_01 >> 1)
//     bit_1 = new_bit_1
//     bit_2 = new_bit_2
//     bit_0 = (-1) ^ bit_1 ^ bit_2

// if bit_1:
//     print(1)
// elif bit_2:
//     print(2)
// else:
//     print(0)
0