Submission #66649
ソースコード
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 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int n, q; cin >> n; vector< int > p(n + 1), e(n + 1); for ( int i = 2; i <= n; ++i){ cin >> p[i] >> e[i]; } cin >> q; vector< bool > parity(n + 1); for ( int i = 0; i < q; ++i){ int s, t; cin >> s >> t; int xs = s, xt = t; int hs = 32 - __builtin_clz(s); int ht = 32 - __builtin_clz(t); if (hs < ht) xt >>= ht - hs; if (hs > ht) xs >>= hs - ht; while (xt != xs){ xt >>= 1; xs >>= 1; } int lca = xt, scnt = 0; vector< int > edges; while (s != lca){ edges.emplace_back(s); s >>= 1; ++scnt; } while (t != lca){ edges.emplace_back(t); t >>= 1; } reverse(edges.begin() + scnt, edges.end()); bool possible = true ; for (auto edge: edges){ possible &= (parity[e[edge]] == p[edge]); parity[edge].flip(); } if (possible){ cout << "Yes\n" ; } else { cout << "No\n" ; } for (auto edge: edges){ parity[edge] = false ; } } return (0); } |
ステータス
項目 | データ |
---|---|
問題 | 1511 - Binary Tree |
ユーザー名 | ei1903 |
投稿日時 | 2021-05-12 16:59:53 |
言語 | C++17 |
状態 | Accepted |
得点 | 4 |
ソースコード長 | 1361 Byte |
最大実行時間 | 367 ms |
最大メモリ使用量 | 11216 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 4 / 4 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
in01.txt | AC | 29 ms | 604 KB |
1
|
in02.txt | AC | 14 ms | 444 KB |
1
|
in03.txt | AC | 233 ms | 796 KB |
1
|
in04.txt | AC | 48 ms | 1000 KB |
1
|
in05.txt | AC | 150 ms | 992 KB |
1
|
in06.txt | AC | 174 ms | 1340 KB |
1
|
in07.txt | AC | 58 ms | 1588 KB |
1
|
in08.txt | AC | 182 ms | 1312 KB |
1
|
in09.txt | AC | 300 ms | 2016 KB |
1
|
in10.txt | AC | 321 ms | 2532 KB |
1
|
in11.txt | AC | 300 ms | 2900 KB |
1
|
in12.txt | AC | 308 ms | 3020 KB |
1
|
in13.txt | AC | 321 ms | 3540 KB |
1
|
in14.txt | AC | 338 ms | 3744 KB |
1
|
in15.txt | AC | 321 ms | 4068 KB |
1
|
in16.txt | AC | 355 ms | 4400 KB |
1
|
in17.txt | AC | 305 ms | 4472 KB |
1
|
in18.txt | AC | 302 ms | 4556 KB |
1
|
in19.txt | AC | 315 ms | 5072 KB |
1
|
in20.txt | AC | 313 ms | 5336 KB |
1
|
in21.txt | AC | 305 ms | 5444 KB |
1
|
in22.txt | AC | 322 ms | 6008 KB |
1
|
in23.txt | AC | 330 ms | 6340 KB |
1
|
in24.txt | AC | 295 ms | 6484 KB |
1
|
in25.txt | AC | 329 ms | 7176 KB |
1
|
in26.txt | AC | 317 ms | 7712 KB |
1
|
in27.txt | AC | 308 ms | 8164 KB |
1
|
in28.txt | AC | 367 ms | 8496 KB |
1
|
in29.txt | AC | 328 ms | 8564 KB |
1
|
in30.txt | AC | 323 ms | 8888 KB |
1
|
in31.txt | AC | 318 ms | 9216 KB |
1
|
in32.txt | AC | 330 ms | 9544 KB |
1
|
in33.txt | AC | 342 ms | 10000 KB |
1
|
in34.txt | AC | 306 ms | 10452 KB |
1
|
in35.txt | AC | 287 ms | 10908 KB |
1
|
in36.txt | AC | 225 ms | 10344 KB |
1
|
in37.txt | AC | 308 ms | 11216 KB |
1
|
sample01.txt | AC | 28 ms | 10788 KB |
1
|
sample02.txt | AC | 19 ms | 10764 KB |
1
|