QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#756826	#5141. Identical Parity	0And1Story	WA	12ms	3828kb	C++20	764b	2024-11-16 22:08:01	2024-11-16 22:08:02

Judging History

你现在查看的是最新测评结果

[2024-11-16 22:08:02]
评测

测评结果：WA
用时：12ms
内存：3828kb

查看

[2024-11-16 22:08:01]
提交

answer

#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define rrep(i, l, r) for (int i = r; i >= l; --i)

void work() {
    int n, k;
    scanf("%d%d", &n, &k);
    if (k % 2 == 0) {
        printf("Yes\n");
        return;
    }
    if (k == 1 && n != 1) {
        printf("No\n");
        return;
    }
    if (n % k == 0) {
        printf("Yes\n");
        return;
    }
    if (n % 2 == 0) printf("%s\n", n / k <= min(n % k * 2, k / 2 * 2) && n / k % 2 == n % k % 2 ? "Yes" : "No");
    else printf("%s\n", n / k - 1 <= min(n % k * 2, k / 2 * 2) && (n / k - 1) % 2 == n % k % 2 ? "Yes" : "No");
}

int main() {
    int T = 1;
    scanf("%d", &T);
    while (T--) work();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3828kb

input:

output:

No
Yes
Yes

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: -100

Wrong Answer

time: 12ms

memory: 3824kb

input:

output:

Yes
No
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
...

result:

wrong answer expected NO, found YES [18th token]