QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#238350#5141. Identical Paritytselmegkh#WA 10ms3656kbC++171.6kb2023-11-04 16:28:532023-11-04 16:28:53

Judging History

你现在查看的是最新测评结果

  • [2023-11-04 16:28:53]
  • 评测
  • 测评结果:WA
  • 用时:10ms
  • 内存:3656kb
  • [2023-11-04 16:28:53]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a, int b, int& x, int& y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int x1, y1;
    int d = gcd(b, a % b, x1, y1);
    x = y1;
    y = x1 - y1 * (a / b);
    return d;
}

bool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {
    g = gcd(abs(a), abs(b), x0, y0);
    if (c % g) {
        return false;
    }

    x0 *= c / g;
    y0 *= c / g;
    if (a < 0) x0 = -x0;
    if (b < 0) y0 = -y0;
    return true;
}
void solve() {
    int n, k;
    cin >> n >> k;
    if (k == 1) {
        cout << (n == 1 ? "Yes" : "No") << "\n";
        return;
    }
    if (k % 2 == 0) {
        cout << "Yes\n";
        return;
    }
    int a = n / k;
    int b = 2;
    int c = (n % 2) - n % k;
    int m = 0, bt = 0, g = 0;
    if (!find_any_solution(a, b, c, m, bt, g)) {
        cout << "No\n";
        return;
    }
    int x = b / gcd(a, b);
    int y = a / gcd(a, b);
    if (m >= k) {
        int t = (m - k + x - 1) / x;
        m -= t * x;
        bt += t * y;
    }
    int t = (k - 1 - m) / x;
    m += t * x;
    bt -= t * y;
    if (bt > 0) {
        int t = (bt + y - 1) / y;
        m -= t * x;
        bt += t * y;
    }
    if (0 <= m && m < k && 0 <= -bt && -bt <= n % k) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3628kb

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: 3656kb

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
No
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
No
No
Yes
No
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
No
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
No
Yes
No
No
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes...

result:

wrong answer expected YES, found NO [15th token]