QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#731976 | #5141. Identical Parity | yumingsk# | WA | 6ms | 3636kb | C++20 | 1.2kb | 2024-11-10 12:34:44 | 2024-11-10 12:34:49 |
Judging History
answer
#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";
using namespace std;
const int Mod = 998244353;
using ll = long long;
void solve()
{
int n, k;
cin >> n >> k;
if (k & 1)
{
if (k == 1)
{
cout << "No\n";
}
else
{
int m = n / k;
int mm = n % k;
int s1 = m * (k / 2) + mm;
int s2 = m * (k - k / 2);
if (s1 + 1 > s2)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
}
}
else
{
cout << "Yes\n";
}
}
int main()
{
IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
clock_t start_time = clock();
#endif
int t = 1;
cin >> t;
while (t--)
{
solve();
}
#ifndef ONLINE_JUDGE
cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
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: 6ms
memory: 3552kb
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:
No No Yes No Yes No No Yes Yes Yes No Yes Yes Yes No No Yes No Yes Yes Yes No Yes No Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes No No Yes No Yes No Yes Yes Yes Yes Yes No Yes No Yes No Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes...
result:
wrong answer expected YES, found NO [1st token]