QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #185175 | #5141. Identical Parity | PhantomThreshold# | WA | 7ms | 3708kb | C++14 | 550b | 2023-09-21 18:28:25 | 2023-09-21 18:28:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool solve(ll n,ll k){
ll q=n/k;
ll r=n%k;
ll mid=(n+1)/2;
ll lim=min(mid/(q+1),r);
ll rest=mid%q;
if (rest>lim) return false;
ll A=rest+(lim-rest)/q;
ll B=mid-A*(q+1);
if (B<0 || B%q!=0) return false;
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int Tcase=1;
cin >> Tcase;
for (;Tcase--;){
ll n,k;
cin >> n >> k;
if (solve(n,k)) cout << "Yes" << "\n";
else cout << "No" << "\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3680kb
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: 7ms
memory: 3708kb
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 No Yes Yes Yes Yes Yes Yes Yes No Yes No Yes No Yes Yes Yes Yes Yes Yes Yes No Yes...
result:
wrong answer expected NO, found YES [31st token]