QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#216002#5141. Identical Paritykrito2023#WA 9ms3644kbC++20710b2023-10-15 15:04:482023-10-15 15:04:48

Judging History

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

  • [2023-10-15 15:04:48]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3644kb
  • [2023-10-15 15:04:48]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
	int n, k;
	cin >> n >> k;
	int f = 0;
	if(k % 2 == 0) f = 1;
	int x = n / k;
	if(n % 2 == 1) {
		int res = n % k;
		if((res - (x - 1)) % 2 == 0 && res - (x - 1) >= 0 && (x - 1) <= k / 2) {
			f = 1;
		}
	} else {
		int res = n % k;
		if((res - x) % 2 == 0 && res - x >= 0 && x <= k / 2) {
			f = 1;
		}
	}
	if(f) {
		cout << "Yes\n";
	} else {
		cout << "No\n";
	}
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifndef ONLINE_JUDGE
    //freopen("in.txt", "r", stdin);
#endif
    int t = 1;
    cin >> t;
    while(t --) {
        solve();
    }
}

詳細信息

Test #1:

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

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: 9ms
memory: 3644kb

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 [96th token]