QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #757093 | #5141. Identical Parity | ryx | WA | 51ms | 3688kb | C++23 | 2.5kb | 2024-11-16 23:59:56 | 2024-11-16 23:59:56 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int a,b,x,y;
int exgcd(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1,y=0;
return a;
}
int d=exgcd(b,a%b,x,y);
int k=x;
x=y;
y=k-a/b*y;
return d;
}
signed main(){
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(n==1) cout<<"YES"<<endl;
else if(n==2){
if(k==1) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
else{
if(n%k==0){
if(k%2==0||n==k) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
else{
//a<b
a = n/k,b = a+1;
int t = n/2;
int d = exgcd(a,b,x,y);
//cout<<"x="<<x<<" y="<<y<<endl;
x*=t,y*=t;
if(x<=0&&y<=0) cout<<"NO"<<endl;
else{
if(x>0){
x%=b;
int l = 0,r = (k-n%k-x)/b;
int ok = 0;
while(l<=r){
int mid = (l+r)/2;
int nx = x+mid*b;
int ny = (t-nx*a)/b;
if(ny<0) r = mid-1;
else if(ny>n%k) l = mid+1;
else {
ok = 1;
break;
}
}
if(ok) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
else if(y>0){
y%=a;
int l = 0,r = (n%k-y)/a;
int ok = 0;
while(l<=r){
int mid = (l+r)/2;
int ny = y+mid*a;
int nx = (t-b*ny)/a;
if(nx<0) r = mid-1;
else if(nx>k-n%k) l = mid+1;
else {
ok = 1;
break;
}
}
if(ok) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3688kb
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: 51ms
memory: 3620kb
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 NO, found YES [125th token]