QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #412429 | #5141. Identical Parity | huangbrother# | WA | 44ms | 3676kb | C++17 | 655b | 2024-05-16 14:03:22 | 2024-05-16 14:03:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[100010];
signed main(){
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(n%k==0){
if((n/2)%(n/k)==0)cout<<"YES\n";
else cout<<"NO\n";
}else {
int res1=n+k-1-(n+k-1)/k*k+1;
int res0=k-res1;
int cnt0=n/2;
cnt0-=min(cnt0/(n/k),res0)*(n/k);
if(cnt0<=res1)cout<<"YES\n";
else if(cnt0>res1){
if(cnt0%((n+k-1)/k)==0)cout<<"YES\n";
else cout<<"NO\n";
}
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 44ms
memory: 3676kb
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:
YES NO YES NO YES YES NO YES YES YES NO YES YES YES YES NO YES NO YES YES YES NO YES YES YES YES YES YES NO YES YES YES YES YES YES YES NO YES NO YES YES YES YES YES YES NO YES NO YES NO YES YES YES YES YES NO YES YES YES YES YES YES YES YES YES YES NO YES NO YES YES YES YES YES YES YES YES YES NO Y...
result:
wrong answer expected NO, found YES [31st token]