// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
int n , k , q; cin >> n >> k >> q;
vector<int> a(1 , 0);
for(int i = 1; i < n; i++){
int y; cin >> y;
a.push_back(a[y-1]+1);
}
vector<int> b(1 , 0);
for(int i = 1; i < n; i++){
int u = 0 , c = k+i-1;
while(c%2){
c/=2;
u++;
}
c = i;
while(c%2){
c/=2;
u--;
}
b.push_back(u);
}
while(q--){
int ans = 0;
for(int i = 0; i < n; i++){
int y; cin >> y;
if(y && b[i]==0)ans++;
}
cout << ans%2 << "\n";
}
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Wrong answer | 1ms | 364 KiB | ||||
| subtask2 | 0/15 | ||||||
| 3 | Wrong answer | 3ms | 316 KiB | ||||
| 4 | Wrong answer | 39ms | 560 KiB | ||||
| 5 | Wrong answer | 111ms | 1404 KiB | ||||
| subtask3 | 0/10 | ||||||
| 6 | Wrong answer | 1ms | 316 KiB | ||||
| 7 | Wrong answer | 1ms | 316 KiB | ||||
| 8 | Wrong answer | 2ms | 316 KiB | ||||
| 9 | Wrong answer | 1ms | 316 KiB | ||||
| 10 | Wrong answer | 1ms | 532 KiB | ||||
| subtask4 | 0/30 | ||||||
| 11 | Accepted | 43ms | 412 KiB | ||||
| 12 | Wrong answer | 43ms | 404 KiB | ||||
| 13 | Wrong answer | 43ms | 420 KiB | ||||
| 14 | Wrong answer | 43ms | 404 KiB | ||||
| 15 | Wrong answer | 43ms | 316 KiB | ||||
| 16 | Wrong answer | 45ms | 316 KiB | ||||
| 17 | Wrong answer | 43ms | 316 KiB | ||||
| subtask5 | 0/45 | ||||||
| 18 | Wrong answer | 101ms | 564 KiB | ||||
| 19 | Wrong answer | 100ms | 736 KiB | ||||
| 20 | Wrong answer | 100ms | 568 KiB | ||||
| 21 | Wrong answer | 100ms | 564 KiB | ||||
| 22 | Wrong answer | 101ms | 564 KiB | ||||
| 23 | Wrong answer | 125ms | 1420 KiB | ||||
| 24 | Wrong answer | 126ms | 1452 KiB | ||||
| 25 | Wrong answer | 128ms | 1556 KiB | ||||
| 26 | Wrong answer | 126ms | 1452 KiB | ||||
| 27 | Wrong answer | 126ms | 1444 KiB | ||||
| 28 | Wrong answer | 92ms | 476 KiB | ||||
| 29 | Wrong answer | 96ms | 480 KiB | ||||