QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #601973 | #5141. Identical Parity | SSL_TJH | WA | 11ms | 3880kb | C++23 | 791b | 2024-09-30 17:06:50 | 2024-09-30 17:06:51 |
Judging History
answer
#include<cstdio>
#include<iostream>
using namespace std;
int n, k;
void slove() {
scanf("%d %d", &n, &k);
int x = n / k, xn = k - n % k, yn = n % k;
int xuse = (n / 2) / x;
if (n / 2 - x * xuse <= yn && xuse >= (n / 2 - x * xuse) && xuse - (n / 2 - x * xuse) <= xn) {printf("Yes\n"); return ;}
else if (n / 2 - x * xn >= 0 && (n / 2 - x * xn) % (x + 1) == 0) {printf("Yes\n"); return ;}
xuse = ((n + 1) / 2) / x;
if ((n + 1) / 2 - x * xuse <= yn && xuse >= ((n + 1) / 2 - x * xuse) && xuse - ((n + 1) / 2 - x * xuse) <= xn) {printf("Yes\n"); return ;}
else if (((n + 1) / 2) - x * xn >= 0 && ((n + 1) / 2 - x * xn) % (x + 1) == 0) {printf("Yes\n"); return ;}
printf("No\n");
}
int main() {
int t; scanf("%d", &t);
while (t--) slove();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
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: 11ms
memory: 3880kb
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 No 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 No No 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 No...
result:
wrong answer expected YES, found NO [19th token]