#include <bits/stdc++.h>
using namespace std;
long long k,n,q;
struct Bencu {
int jel;
}L[100001];
long long kar[100001];
int main()
{
ifstream f("be.in");
cin>>n>>k>>q;
for (int i=2; i<=n; i++) cin>>kar[i];
for (int z=1; z<=q; z++) {
long long b[100001],s=0;
for (int i=1; i<=n; i++) {
cin>>b[i];
if (b[i]==1 && i>2) s++;
}
cout<<s<<" - ";
if (s%2==0) {
if (b[2]==1) {
cout<<(k+b[1])%2<<endl;
}
else {
cout<<b[1]<<endl;
}
}
else {
if (b[2]==0) {
cout<<(b[1]+k/2)%2<<endl;
}
else {
cout<<(b[1]+k/2+1)%2<<endl;
}
}
}
return 0;
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Wrong answer | 1ms | 316 KiB | ||||
| 2 | Wrong answer | 1ms | 316 KiB | ||||
| subtask2 | 0/15 | ||||||
| 3 | Wrong answer | 3ms | 316 KiB | ||||
| 4 | Wrong answer | 37ms | 496 KiB | ||||
| 5 | Wrong answer | 104ms | 1932 KiB | ||||
| subtask3 | 0/10 | ||||||
| 6 | Wrong answer | 2ms | 316 KiB | ||||
| 7 | Wrong answer | 2ms | 316 KiB | ||||
| 8 | Wrong answer | 1ms | 508 KiB | ||||
| 9 | Wrong answer | 1ms | 316 KiB | ||||
| 10 | Wrong answer | 1ms | 316 KiB | ||||
| subtask4 | 0/30 | ||||||
| 11 | Wrong answer | 43ms | 424 KiB | ||||
| 12 | Wrong answer | 43ms | 476 KiB | ||||
| 13 | Wrong answer | 43ms | 316 KiB | ||||
| 14 | Wrong answer | 43ms | 316 KiB | ||||
| 15 | Wrong answer | 43ms | 508 KiB | ||||
| 16 | Wrong answer | 43ms | 452 KiB | ||||
| 17 | Wrong answer | 43ms | 316 KiB | ||||
| subtask5 | 0/45 | ||||||
| 18 | Wrong answer | 94ms | 564 KiB | ||||
| 19 | Wrong answer | 96ms | 564 KiB | ||||
| 20 | Wrong answer | 94ms | 564 KiB | ||||
| 21 | Wrong answer | 94ms | 756 KiB | ||||
| 22 | Wrong answer | 94ms | 692 KiB | ||||
| 23 | Wrong answer | 119ms | 1956 KiB | ||||
| 24 | Wrong answer | 119ms | 1872 KiB | ||||
| 25 | Wrong answer | 120ms | 1844 KiB | ||||
| 26 | Wrong answer | 123ms | 1932 KiB | ||||
| 27 | Wrong answer | 119ms | 1836 KiB | ||||
| 28 | Wrong answer | 86ms | 316 KiB | ||||
| 29 | Wrong answer | 86ms | 316 KiB | ||||