QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #671954 | #5141. Identical Parity | Repeater# | WA | 10ms | 3616kb | C++20 | 1.6kb | 2024-10-24 15:07:42 | 2024-10-24 15:07:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
void exgcd(i64 a, i64 b, i64& x, i64& y){
if(b == 0){
x = 1, y = 0;
return;
}
exgcd(b, a % b, y, x);
y -= a / b * x;
return;
}
void solve(){
int n, k;
cin >> n >> k;
int a = n / k, b = n / k + 1, c = n % k, d = k - n % k;
if(n & 1) ++n;
n >>= 1;
i64 x = 0, y = 0;
exgcd(b, a, x, y);
//cout << x << " " << y << "\n";
x *= n, y *= n;
if(x >= c){
int t = (x - c) / a + 1;
x -= t * a;
y += t * b;
}
if(x < c){
int t = (c - x) / a;
x += t * a;
y -= t * b;
}
if(y < d){
int t = (d - y) / b;
//cout << t << "\n";
//cout << x << " " << y << "\n";
x -= t * a;
y += t * b;
}
//cout << x << " " << y << "\n";
if(x < 0 || y < 0) cout << "No\n";
else if (x > c || y > d) cout << "No\n";
else cout << "Yes\n";
return;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t; cin >> t;
while(t--) solve();
return 0;
}
/*
int n, k;
cin >> n >> k;
int b = n / k, c = n % k;
int a = b + 1, d = k - c;
if(n == 1){
cout << "Yes\n";
}
else if(n > 1 && k == 1){
cout << "No\n";
}
else if(d % 2 == 0 && c % 2 == 0) {
cout << "Yes\n";
}
else if(d % 2 == 1 && c % 2 == 1){
cout << "Yes\n";
}
else if(d % 2 == 0 && c % 2 == 1){
if(min(c - 1, d) >= n)
cout << "Yes\n";
else
cout << "No\n";
}
else if(d % 2 == 1 && c % 2 == 0){
if(min(c - 1, d) >= n - 1 || d == 1)
cout << "Yes\n";
else
cout << "No\n";
}
return;
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3616kb
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: 3556kb
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 No No Yes Yes Yes No No Yes No Yes Yes No No Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes No No No Yes No Yes Yes Yes Yes No No No Yes No Yes No Yes Yes Yes No No No Yes No Yes Yes Yes Yes Yes Yes No No No Yes No Yes Yes No Yes Yes Yes No No No No Yes No Yes Yes No Y...
result:
wrong answer expected YES, found NO [10th token]