QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #630238 | #5141. Identical Parity | 7islands# | WA | 10ms | 3732kb | C++17 | 950b | 2024-10-11 17:17:02 | 2024-10-11 17:17:02 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
if(k>n/2){
cout<<"Yes"<<endl;
}
else if(k%2==0){
cout<<"Yes"<<endl;
}
else{
// int sb = n/k;
// int max0 ;
// if(n%k > k/2){
// max0 = k/2 - (n%k - k/2);
// }
// else max0 = n%k;
// if(max0>=sb - 1) cout<<"Yes"<<endl;
// else cout<<"No"<<endl;
int cnt0=0,cnt1=0;
cnt0+=(n/k)*(k/2);
cnt1+=(n/k)*(k/2+1);
if (n%k>k/2){
cnt0+=k/2;
cnt1+=(n%k-k/2);
}else cnt0+=n%k;
if (cnt0==n/2&&cnt1==(n/2+n%2))cout <<"Yes"<<endl;
else cout <<"No"<<endl;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
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: 10ms
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:
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 No 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 No Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes...
result:
wrong answer expected YES, found NO [143rd token]