QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #818753 | #8975. Eva and Euro coins | Kazemaru | WA | 1ms | 7928kb | C++14 | 429b | 2024-12-18 08:19:28 | 2024-12-18 08:19:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=2e6;
char c[N];
int a[N],b[N];
signed main(){
cin>>n>>m;
scanf("%s",c+1);
f(i,1,n)a[i]^=c[i];
scanf("%s",c+1);
f(i,1,n)a[i]^=c[i];
++n;
f(i,1,n)b[i%m]^=a[i]^a[i-1];
f(i,0,m)if(b[i])cout<<"No\n",exit(0);
cout<<"Yes\n";
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7928kb
input:
6 2 000000 101101
output:
Yes
result:
ok single line: 'Yes'
Test #2:
score: 0
Accepted
time: 1ms
memory: 7920kb
input:
8 3 10101010 01010101
output:
No
result:
ok single line: 'No'
Test #3:
score: 0
Accepted
time: 1ms
memory: 7856kb
input:
10 3 0100011001 0001000000
output:
Yes
result:
ok single line: 'Yes'
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 7664kb
input:
10 3 0100001010 0000000000
output:
Yes
result:
wrong answer 1st lines differ - expected: 'No', found: 'Yes'