QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#756827#5141. Identical Parity0And1StoryWA 12ms3832kbC++20776b2024-11-16 22:09:492024-11-16 22:09:49

Judging History

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

  • [2024-11-16 22:09:49]
  • 评测
  • 测评结果：WA
  • 用时：12ms
  • 内存：3832kb
查看
  • [2024-11-16 22:09:49]
  • 提交

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;
}
源文件, 语言: C++20

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3832kb

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: 12ms
memory: 3768kb

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
Yes
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
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Y...

result:

wrong answer expected NO, found YES [31st token]
English 繁體中文 简体中文

服务器时间: 2024-12-02 15:40:10 | 开源项目