QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#481602#5141. Identical Parity333zhanWA 5ms3788kbC++201.4kb2024-07-17 11:11:442024-07-17 11:11:45

Judging History

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

  • [2024-07-17 11:11:45]
  • 评测
  • 测评结果:WA
  • 用时:5ms
  • 内存:3788kb
  • [2024-07-17 11:11:44]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long

using namespace std;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

void solve () {
	int n = read (), k = read ();

    if (n == 1) {
        printf ("Yes\n");
        return;
    }

    if (k == 1) {
        printf ("No\n");
        return;
    }

    if (k & 1 ^ 1) {
        printf ("Yes\n");
        return;
    }

    int t = n / k;
    int sum1 = (n + 1) / 2, sum2 = n - sum1;

    int a = t * k / 2, b = t * (k + 1) / 2;

    int w = n % k;

    if (b + min (w, (k + 1) / 2) == sum1 && a + max (0LL, w - (k + 1) / 2) == sum2) {
        printf ("Yes\n");
        return;
    }
    if (b + max (0LL, w - k / 2) == sum1 && a + min (w, k / 2) == sum2) {
        printf ("Yes\n");
        return;
    }

    printf ("No\n");
} 

signed main () {
	// ios::sync_with_stdio (false);
    // cin.tie (nullptr);
    
	int T = 1; 
	// cin >> T;
	T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}
/*
4 3
1 2 3 4
2 1 3 4

6 3
2 1 3 4 5 6
x
y

n / k


9 3
1 1 0 1 1 0 1 1 0
0 1 1 0 1 1 0 1 1

0 0 1 0 1 0 1 0 1

9 5
0 0 1 1 1 0 0 1 1 

7 3
2 1 3 4 5 7 6
0 1 1 0 1 1 0   

8 5
0 0 1 1 1 0 0 1
*/

详细

Test #1:

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

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: 5ms
memory: 3788kb

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

result:

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