QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#601972	#5141. Identical Parity	SSL_TJH	WA	11ms	3788kb	C++23	737b	2024-09-30 17:03:37	2024-09-30 17:03:42

Judging History

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

[2024-09-30 17:03:42]
评测

测评结果：WA
用时：11ms
内存：3788kb

查看

[2024-09-30 17:03:37]
提交

answer

#include<cstdio>
#include<iostream>

using namespace std;

int n, k;

void slove() {
	scanf("%d %d", &n, &k);
	int x = n / k, xn = k - n % k, yn = n % k;
	int xuse = (n / 2) / x;
	if (n / 2 - x * xuse <= yn && xuse >= (n / 2 - x * xuse) &&  xuse - (n / 2 - x * xuse) <= xn) {printf("Yes\n"); return ;}
		else if ((n / 2 - x * xn) % (x + 1) == 0) {printf("Yes\n"); return ;} 
	xuse = ((n + 1) / 2) / x;
	if ((n + 1) / 2 - x * xuse <= yn && xuse >= ((n + 1) / 2 - x * xuse) && xuse - ((n + 1) / 2 - x * xuse) <= xn) {printf("Yes\n"); return ;}
		else if (((n + 1) / 2 - x * xn) % (x + 1) == 0) {printf("Yes\n"); return ;} 
	printf("No\n");
}

int main() {
	int t; scanf("%d", &t);
	while (t--) slove();
	return 0;
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3748kb

input:

output:

No
Yes
Yes

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: -100

Wrong Answer

time: 11ms

memory: 3788kb

input:

output:

Yes
No
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
Yes
No
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
No
No
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
...

result:

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