QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#454749	#8813. Records in Chichén Itzá	yemuzhe	WA	13ms	1496kb	C++14	310b	2024-06-25 13:09:36	2024-06-25 13:09:37

Judging History

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

[2024-06-25 13:09:37]
评测

测评结果：WA
用时：13ms
内存：1496kb

查看

[2024-06-25 13:09:36]
提交

answer

#include <cstdio>
using namespace std;

int T, n, f1;
bool f2;

int main ()
{
	scanf ("%d", &T);
	while (T --)
	{
		scanf ("%d", &n), f1 = f2 = 0;
		for (int i = 1, x; i <= n; i ++)
		{
			scanf ("%d", &x), f1 += x == 2, f2 |= x > 2;
		}
		puts (f1 > 1 && f2 ? "Yes" : "No");
	}
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 1400kb

input:

3
6
1 1 1 1 3 3
5
1 1 2 2 2
10
1 1 1 1 2 2 2 2 3 3

output:

No
No
Yes

result:

ok 3 tokens

Test #2:

score: 0

Accepted

time: 0ms

memory: 1480kb

input:

1
2
1 1

output:

No

result:

ok "No"

Test #3:

score: 0

Accepted

time: 13ms

memory: 1496kb

input:

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
...

result:

ok 100000 tokens

Test #4:

score: -100

Wrong Answer

time: 11ms

memory: 1496kb

input:

50000
3
1 1 2
3
1 1 2
2
1 1
4
1 1 2 2
5
1 1 1 2 3
2
1 1
4
1 1 2 2
4
1 1 2 2
3
1 1 2
3
1 1 2
3
1 1 2
4
1 1 2 2
2
1 1
4
1 1 2 2
3
1 1 2
2
1 1
4
1 1 2 2
3
1 1 2
6
1 1 1 2 2 3
5
1 1 1 2 3
5
1 1 1 1 4
4
1 1 1 3
8
1 1 1 1 1 2 3 4
3
1 1 2
4
1 1 2 2
6
1 1 2 2 2 2
4
1 1 2 2
2
1 1
4
1 1 1 3
4
1 1 1 3
4
1 1 1 ...

output:

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

result:

wrong answer 23rd words differ - expected: 'Yes', found: 'No'