QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #661932 | #5141. Identical Parity | Tytytony# | WA | 40ms | 3652kb | C++23 | 514b | 2024-10-20 19:12:17 | 2024-10-20 19:12:19 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll n,k,cnt1,cnt0;
int main(){
int T; cin>>T;
while(T--){
cin>>n>>k;
if(k==1){
cout<<"No\n";
continue;
}
if(k==2){
cout<<"Yes\n";
continue;
}
cnt1=0,cnt0=0;
ll k1=k/2+1,k0=k/2;
cnt1=k1*(n/k),cnt0=k0*(n/k);
if(((n/k)-n%2+n%k)%2==0&&(n/k)-n%2<=k0){
cout<<"Yes\n";
continue;
}
cout<<"No\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3652kb
input:
3 3 1 4 2 5 3
output:
No Yes Yes
result:
ok 3 token(s): yes count is 2, no count is 1
Test #2:
score: -100
Wrong Answer
time: 40ms
memory: 3652kb
input:
100000 1 1 2 1 2 2 3 1 3 2 3 3 4 1 4 2 4 3 4 4 5 1 5 2 5 3 5 4 5 5 6 1 6 2 6 3 6 4 6 5 6 6 7 1 7 2 7 3 7 4 7 5 7 6 7 7 8 1 8 2 8 3 8 4 8 5 8 6 8 7 8 8 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 9 9 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 11 11 12 1 ...
output:
No No Yes No Yes Yes No Yes Yes No No Yes Yes No Yes No Yes No No Yes No No Yes Yes No Yes No Yes No Yes No Yes Yes No Yes No No Yes No Yes Yes No Yes No Yes No Yes No Yes Yes No Yes No Yes No No Yes No Yes Yes No Yes No Yes No Yes No Yes No No Yes Yes Yes No Yes No Yes No No Yes No No Yes Yes Yes N...
result:
wrong answer expected YES, found NO [1st token]