QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#756711 | #5141. Identical Parity | SkyEyeController | WA | 12ms | 3680kb | C++23 | 1.1kb | 2024-11-16 21:40:16 | 2024-11-16 21:40:17 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 mod = 998244353;
#define endl '\n'
void exgcd(int a, int b, int &x, int &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 big = n % k, sml = k - big;
int x, y;
exgcd(n / k, n / k + 1, x, y);
int ks = k;
x *= ks, y *= ks;
int tmpkx = (n / k + 1), tmpky = (n / k);
x = (x % tmpkx + tmpkx) % tmpkx;
y = (n / 2 - x * (n / k)) / (n / k + 1);
if (x >= 0 && x <= sml && y >= 0 && y <= big)
{
cout << "Yes" << endl;
return;
}
y = (y % tmpky + tmpky) % tmpky;
x = (n / 2 - y * (n / k + 1)) / (n / k);
if (x >= 0 && x <= sml && y >= 0 && y <= big)
{
cout << "Yes" << endl;
return;
}
cout << "No" << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--)
solve();
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
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: 12ms
memory: 3680kb
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 No Yes Yes Yes No Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes No No Yes Yes No Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes Yes Yes Yes No No Ye...
result:
wrong answer expected YES, found NO [30th token]