QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #757022 | #5141. Identical Parity | Foracy | WA | 60ms | 3636kb | C++20 | 623b | 2024-11-16 23:33:45 | 2024-11-16 23:33:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
int T;
cin >> T;
while (T--){
int n,k;
cin >> n >> k;
if (n == k || k%2 == 0){
cout << "YES\n";
} else{
int odd = n/2 + n%2;
int res = odd % (n/k);
int tap = odd / (n/k);
if (res > tap || res > n%k){
cout << "NO\n";
} else{
cout << "YES\n";
}
}
}
}
// 7 3
/*
0 0 1 1
0 0 1 1
0 0 1 1
0
odd = (n/2+n%2)
res = odd % (n/k)
m = odd / (n/k)
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
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: 60ms
memory: 3636kb
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]