QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#757150#5141. Identical ParityhuanyizhiyuanWA 9ms3628kbC++201.5kb2024-11-17 00:57:072024-11-17 00:57:07

Judging History

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

  • [2024-11-17 00:57:07]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3628kb
  • [2024-11-17 00:57:07]
  • 提交

answer

#include<bits/stdc++.h>
#define i64 long long
#define int i64
using PII = std::pair<int,int>;
using TIII = std::tuple<int,int,int>;
constexpr int mod = 1e9+7;
constexpr int inf = 1e9+5;
int n,m,k;

void solve()
{
    std::cin >> n >> k;

    if(n == k)
    {
        std::cout << "YES\n";
        return ;
    }

    if(k % 2 == 0)
    {
        std::cout << "YES\n";
        return ;
    }

    // 1 2 3 4 5
    // 1 2 3 5 4
    // 1 3 2 5

    if(n & 1)
    {
        // 奇数和偶数的个数。
        int odd = (n + 1) / 2;
        int even = n / 2;
        // 一定需要多少个奇数聚集在一起。
        int need = (k + 1) / 2;
        // 最多可以分成多少段?
        int num = n / k;

        if(num * need <= odd)
            std::cout << "YES\n";
        else
            std::cout << "NO\n";
    }
    else
    {
        // 奇数和偶数的个数。
        int odd = n / 2;
        int even = n / 2;
        // 一定需要多少个奇数聚集在一起。
        int need = (k + 1) / 2;
        // 最多可以分成多少段?
        int num = n / k;

        if(num * need <= odd)
            std::cout << "YES\n";
        else
            std::cout << "NO\n";
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int T=1;
    std::cin>>T;
    while(T--)
    {
        solve();
    }
    return  0;
}


詳細信息

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: 9ms
memory: 3600kb

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
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
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 [31st token]