QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #778034 | #5141. Identical Parity | Bicycle_23# | WA | 10ms | 3608kb | C++17 | 787b | 2024-11-24 12:15:29 | 2024-11-24 12:15:31 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int , int> PII;
const int N = 1e5 + 10;
void solve()
{
int n , k;
cin >> n >> k;
if(n == k)
{
cout << "YES" << endl;
return;
}
if(k == 1)
{
cout << "NO" << endl;
return;
}
if(!(k & 1))
{
cout << "YES" << endl;
return;
}
else
{
int a = n / k - 1; //补的0
int cnt = k >> 1; //0的个数
int x = n % k; //剩下的
// cout << a << ' ' << cnt << ' ' << x << endl;
if(x != 0 && cnt >= a && x >= a)
{
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while(T --)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3596kb
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: 10ms
memory: 3608kb
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 NO 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 [31st token]