QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #413659 | #5141. Identical Parity | huangbrother | WA | 47ms | 3648kb | C++17 | 919b | 2024-05-17 20:45:52 | 2024-05-17 20:45:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[100010];
int exgcd(int a,int b,int &x,int &y){
if(!b){
x=1,y=0;
return a;
}
int d=exgcd(b,a%b,y,x);
y-=x*(a/b);
return d;
}
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;
int res0=k-res1;
int cnt0=n/2;
int x,y;
int d=exgcd(n/k,n/k+1,x,y);
int mod=(n/k+1)/d;
x=((x*(cnt0/d))%mod+mod)%mod;
int r=(cnt0-x*(n/k))/(n/k+1);
int X=(res0-x)/mod*mod+x;
int l=(cnt0-X*(n/k))/(n/k+1);
if(r<0||l>res1||x>res0)cout<<"No\n";
else cout<<"Yes\n";
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3648kb
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: 47ms
memory: 3580kb
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]