QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #680270 | #5141. Identical Parity | xyz | WA | 47ms | 3628kb | C++23 | 2.5kb | 2024-10-26 20:27:29 | 2024-10-26 20:27:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
long long exgcd(long long a, long long b, long long &u, long long &v) { //返回gcd(a,b) 并求出解(引用带回)
if (b == 0) {
u = 1, v = 0;
return a;
}
long long x1, y1, gcd;
gcd = exgcd(b, a % b, x1, y1);
u = y1, v = 1ll * x1 - 1ll * a / b * y1;
return gcd;
}
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long x = n / k, y = n % k;
long long a, b;
a = 2 * x + 2, b = 2 * x;
long long u, v;
if (n % 2 == 0) {
long long c = 1ll * k * x + y;
if (c % a == 0 || c % b == 0) {
cout << "Yes" << endl;
continue;
}
long long g = __gcd(a, b);
if (c % g != 0) {
cout << "No" << endl;
continue;
}
exgcd(a, b, u, v);
u = 1ll * u * c / g, v = 1ll * v * c / g;
long long t1 = b / g, t2 = a / g;
long long mn1 = (u % t1 + t1) % t1, mn2 = (v % t2 + t2) % t2;
long long k1min = -1.0 * u / t1, k1max = 1.0 * (y - u) / t1;
if (k1min == k1max && !(-t1 * k1min + u >= 0 && -t1 * k1min + u <= y)) {
cout << "No" << endl;
continue;
}
long long k2min = -1.0 * u / t1, k2max = 1.0 * (y - u) / t1;
if (k2min == k2max && !(-t1 * k2min + u >= 0 && -t1 * k2min + u <= y)) {
cout << "No" << endl;
continue;
}
if (k1max >= k2min && k2max >= k1min) {
cout << "Yes" << endl;
continue;
}
if (k2max >= k1min && k1max >= k2min) {
cout << "Yes" << endl;
continue;
}
cout << "No" << endl;
} else {
long long c = 1ll * k * x + y + 1;
if (c % a == 0 || c % b == 0) {
cout << "Yes" << endl;
continue;
}
long long g = __gcd(a, b);
if (c % g != 0) {
cout << "No" << endl;
continue;
}
exgcd(a, b, u, v);
u = 1ll * u * c / g, v = 1ll * v * c / g;
long long t1 = b / g, t2 = a / g;
long long mn1 = (u % t1 + t1) % t1, mn2 = (v % t2 + t2) % t2;
long long k1min = -u / t1, k1max = (y - u) / t1;
if (k1min == k1max && !(-t1 * k1min + u >= 0 && -t1 * k1min + u <= y)) {
cout << "No" << endl;
continue;
}
long long k2min = -1.0 * u / t1, k2max = 1.0 * (y - u) / t1;
if (k2min == k2max && !(-t1 * k2min + u >= 0 && -t1 * k2min + u <= y)) {
cout << "No" << endl;
continue;
}
if (k1max >= k2min && k2max >= k1min) {
cout << "Yes" << endl;
continue;
}
if (k2max >= k1min && k1max >= k2min) {
cout << "Yes" << endl;
continue;
}
cout << "No" << endl;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
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: 47ms
memory: 3628kb
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 Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes No Yes No No Yes Yes Yes Yes Yes No Yes No Yes No Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Y...
result:
wrong answer expected NO, found YES [18th token]