QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #707836 | #5141. Identical Parity | Rosmontis_L# | WA | 9ms | 3736kb | C++20 | 921b | 2024-11-03 17:46:09 | 2024-11-03 17:46:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
void solve(){
ll n, k;
cin >> n >> k;
if(k == 1){
if(n == 1) cout << "Yes\n";
else cout << "No\n";
return;
}
if(k % 2 == 0){
cout << "Yes\n";
return;
}
bool ok = 0;
if(n % k != 0){
ll x = n / k;
ll p1 = x * (k / 2), p2 = x * ((k + 1) / 2);
ll yu = n % k, cha = abs(p1 - p2);
if(n & 1) cha += 1;
if(yu <= cha){
ok = 1;
}
}
ll fst = 0;
if(n % 2 == 0 && ((n / 2) & 1)) fst = (n / 2 + 1);
else fst = n / 2;
if(k >= fst) ok = 1;
cout << (ok ? "Yes\n" : "No\n");
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1;
cin >> t;
while(t --){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3728kb
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: 3736kb
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 Yes 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 ...
result:
wrong answer expected NO, found YES [31st token]