QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#463755	#8813. Records in Chichén Itzá	GenshinImpactsFault^#	WA	10ms	3708kb	C++20	597b	2024-07-05 13:44:28	2024-07-05 13:44:29

Judging History

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

[2024-07-05 13:44:29]
评测

测评结果：WA
用时：10ms
内存：3708kb

查看

[2024-07-05 13:44:28]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int a[100010];
void Do() {
    int n;
    cin >> n;
    int lst = -1, cnt = 0;
    bool flag = true;
    for(int i = 1; i <= n; ++ i) {
        cin >> a[i];
        if(a[i] == 1) continue;
        ++ cnt;
        if(lst == -1) lst = a[i];
        if(lst != a[i]) {
            flag = false;
        }
    }
    // sort(a + 1, a + n + 1);
    
    if(flag || cnt <= 2) puts("No");
    else puts("Yes");
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while(T --) {
        Do();
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3704kb

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: 3632kb

input:

1
2
1 1

output:

No

result:

ok "No"

Test #3:

score: 0

Accepted

time: 10ms

memory: 3708kb

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: 8ms

memory: 3564kb

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

result:

wrong answer 550th words differ - expected: 'Yes', found: 'No'