QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#755982#5141. Identical ParityL_wwqqWA 9ms3668kbC++20845b2024-11-16 18:37:222024-11-16 18:37:23

Judging History

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

  • [2024-11-16 18:37:23]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3668kb
  • [2024-11-16 18:37:22]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define i128 __int128
#define fi first
#define se second
#define all(a) begin(a)+1,end(a)
typedef unsigned long long ull;
using namespace std;
using pii = pair<int,int>;
using piii = pair<int,pii>;
const int N = 1e6+5;

int n,m,k;

inline void beez(){
	cin >> n >> k;
	if(n == 1 and k == 1){
		cout << "Yes\n";
		return;
	}
	if(n != 1 and k == 1){
		cout << "No\n";
		return;
	}
	if(k % 2 == 0){
		cout << "Yes\n";
		return;
	} else{
		if(n == k){
			cout << "Yes\n";
			return;
		}
		bool ok = true;
		int cnt = n / k,tmp = n % k;
		if(tmp > ((k + 1) / 2)) ok = false;
		if(ok) cout << "Yes\n";
		else cout << "No\n";
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int __=1;
	cin>>__;
	while(__--){
		beez();
	}
	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: 3668kb

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

result:

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