QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #756831 | #5141. Identical Parity | frankly6 | WA | 2ms | 3652kb | C++17 | 1.1kb | 2024-11-16 22:10:50 | 2024-11-16 22:10:50 |
Judging History
answer
#include<iostream>
#include<cstdio>
using namespace std;
const int MX=100050;
int T, N, K;
int read()
{
int r=0, f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
return r*f;
}
int main()
{
// freopen("testdata.in","r",stdin);
T=read();
while(T--)
{
N=read(), K=read();
if(K%2==0) cout << "Yes\n";
else
{
int seg=N/K, det=min(N-N/K*K,K-N+N/K*K);
int num1=K-N%K, num2=N%K;
int n1=N/2, n2=N-N/2;
int c1=min(num1,n1/seg), c2=min(num1,n2/seg);
// cout << "det=" << det << ", n1=" << n1 << ", n2=" << n2 << ", seg=" << seg << ", c1=" << c1 << ", c2=" << c2 << '\n';
if(n1-c1*seg<=det||n2-c2*seg<=det) cout << "Yes\n";
else cout << "No\n";
}
}
return (0-0);
}
/*
n/k full length k parts
n-n/k :(n/k+1 same parity)
k-(n-n/k) :(n/k same parity)
n/2 : even
n-n/2 : odd
\det <= 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
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: 2ms
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 No 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 No Yes Yes Yes Yes Yes No Yes N...
result:
wrong answer expected YES, found NO [41st token]