QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #630329 | #5141. Identical Parity | adivse# | WA | 10ms | 3712kb | C++20 | 2.2kb | 2024-10-11 17:56:41 | 2024-10-11 17:56:45 |
Judging History
answer
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename... Args>
void bubu(Args... args) { cout << ":: "; ((cout << args << " "), ...); cout << endl; }
void bubu(vector<int> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;
//=======================================================================
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;
int A[N];
int num[N];
//=======================================================================
signed main() {
kuaidu();
cin >> T;
while (T--) {
int k; cin >> n >> k;
if (k == 1) {
cout << "No" << endl;
continue;
}
if (k % 2 == 0) {
cout << "Yes" << endl;
continue;
}
if (n % 2) {
// k:0>1
int c = n % k;
int cnt1 = n / k + 1;
if (cnt1 <= c and cnt1 <= k / 2) {
cout << "Yes" << endl;
continue;
}
//k:1>0
int cnt0 = n / k - 1;
if (cnt0 <= c and cnt0 <= k / 2) {
cout << "Yes" << endl;
continue;
}
cout << "No" << endl;
}
else {
//k:0>1
int c = n % k;
int cnt1 = n / k;
if (cnt1 <= c and cnt1 <= k / 2) {
cout << "Yes" << endl;
continue;
}
//k:1>0
int cnt0 = n / k;
if (cnt0 <= c and cnt0 <= k / 2) {
cout << "Yes" << endl;
continue;
}
cout << "No" << endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 3712kb
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 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 No 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 Yes ...
result:
wrong answer expected YES, found NO [1st token]