QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#756192 | #5141. Identical Parity | shunhualin | WA | 8ms | 3716kb | C++20 | 1.1kb | 2024-11-16 19:19:41 | 2024-11-16 19:19:41 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
const int mod = 1e9 + 7;
const int N = 1e5 + 50;
using namespace std;
int Exgcd(int a, int b, int &x, int &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
int d = Exgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - (a / b) * y;
return d;
}
void slove() {
int n, k;
cin >> n >> k;
int p = n % k, q = k - n % k;
int a = n / k + 1, b = n / k, c = (n + 1) / 2;
int x, y;
int d = Exgcd(a, b, x, y);
if(c % d != 0){
cout << "No" << endl;
}else{
a = a / d, b = b / d, c = c / d;
x = x * c, y = y * c;
int r1 = floor(1.0 * (q - x) / b);
int l1 = ceil(1.0 * -x / b);
int l2 = ceil(1.0 * (y - p) / a);
int r2 = floor(1.0 * y / a);
int l = max(l1, l2), r = max(r1, r2);
if(l <= r){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
cin >> T;
while(T--) {
slove();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 8ms
memory: 3716kb
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 Yes Yes No Yes Yes No Yes Yes Yes No Yes Yes Yes Yes No No Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No...
result:
wrong answer expected NO, found YES [2nd token]