QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#108540	#6506. Chase Game 3	keainie^#	WA	31ms	1500kb	C++14	429b	2023-05-25 14:18:05	2023-05-25 14:18:56

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-25 14:18:56]
评测

测评结果：WA
用时：31ms
内存：1500kb

查看

[2023-05-25 14:18:05]
提交

answer

#include <cstdio>

const int N = 4e5 + 10;
int n, a[N];

void work()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
	if (n <= 3) return puts("Yes"), void();
	bool flag1 = true, flag2 = true;
	for (int i = 1; i <= n; ++ i) flag1 &= a[i] == i, flag2 &= a[i] == n - i + 1;
	puts(flag1 || flag2 ? "Yes" : "No");
}

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

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 1492kb

input:

5
2
1 2
3
2 3 1
4
1 4 3 2
5
1 5 2 3 4
6
1 2 3 4 5 6

output:

Yes
Yes
No
No
Yes

result:

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

Test #2:

score: 0

Accepted

time: 1ms

memory: 1404kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 8 token(s): yes count is 8, no count is 0

Test #3:

score: -100

Wrong Answer

time: 31ms

memory: 1500kb

input:

output:

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

result:

wrong answer expected YES, found NO [1st token]