QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #190758 | #5141. Identical Parity | chroneZ | WA | 9ms | 3580kb | C++17 | 952b | 2023-09-29 13:54:11 | 2023-09-29 13:54:12 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int long long
constexpr int inf = 1e9;
void solve() {
int n, k; cin >> n >> k;
if(k == 1) {
cout << (n == 1 ? "Yes" : "No") << "\n";
return;
}
if(k % 2 == 0) {
cout << "Yes\n";
return;
}
int x1 = ((n + 1) / 2) % (n / k);
int x2 = (n / 2) % (n / k);
if(x1 + x2 > n % k) {
cout << "No\n";
return;
}
if((n % k - (x1 + x2)) % (n / k) != 0) {
cout << "No\n";
}
int c1 = (n + 1) / 2 - x1 - x1 * (n / k);
int c2 = n / 2 - x2 - x2 * (n / k);
i64 D = 1ll * (n / k + 1) * (n / k);
if(c1 / D + c2 / D >= (n % k - (x1 + x2)) / (n / k)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int T; cin >> T;
while(T--) {
solve();
}
}
/*
Author: chroneZ
Start thinking at
Start coding at
Finish debugging at
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
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: 3580kb
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 Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Ye...
result:
wrong answer expected NO, found YES [58th token]