QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #89860 | #5141. Identical Parity | ylf20010818 | WA | 16ms | 3444kb | C++17 | 798b | 2023-03-21 17:26:26 | 2023-03-21 17:26:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,k;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>t;
while(t--)
{
cin>>n>>k;
if(n%k==0)
{
if(k%2==0) cout<<"YES\n";
else cout<<"NO\n";
}
else
{
ll m=n/2;
ll val1=n/k+1,val2=n/k;
ll num1=n%k,num2=k-n%k;
ll num=min(num1,m/val1);
m-=num*val1;
ll kk=m/val2;
m-=kk*val2;
num2-=kk;
if(m!=0)
{
num2--;
num2-=(val2-m);
}
if(num2>=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: 2ms
memory: 3444kb
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: 16ms
memory: 3312kb
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 NO NO YES YES YES NO YES YES YES NO NO YES NO YES YES YES NO YES YES YES YES YES NO NO YES NO YES YES YES YES YES NO YES NO YES YES YES YES YES NO NO YES NO YES NO YES YES YES YES YES NO YES NO YES YES YES YES YES YES YES NO NO YES NO YES YES YES YES YES YES YES YES YES NO YES NO YE...
result:
wrong answer expected YES, found NO [1st token]