QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#682371	#8813. Records in Chichén Itzá	Gardenia_2024 (Xilin Tang, Jialei Wei, Zexu Yang)^#	WA	11ms	3716kb	C++23	658b	2024-10-27 15:12:02	2024-10-27 15:12:03

Judging History

This is the latest submission verdict.

[2024-10-27 15:12:03]
Judged

Verdict: WA
Time: 11ms
Memory: 3716kb

Show

[2024-10-27 15:12:02]
Submitted

answer

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
int a[100005],cnt[100005];
void solve(){
	int n;
	cin>>n;
	int ncnt=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]>1)ncnt++;
	}
	if(ncnt<=2){
		cout<<"No\n";
		return;
	}
	if(ncnt>3){
		cout<<"Yes\n";
		return;
	}
	if(a[n]==a[n-2]){
		cout<<"No\n";
		return;
	}
	cout<<"Yes\n";
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int t=1;
	cin>>t;
    while(t--)solve();
    return 0;
}
/*
 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
*/

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3716kb

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

input:

1
2
1 1

output:

No

result:

ok "No"

Test #3:

score: 0

Accepted

time: 11ms

memory: 3664kb

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

memory: 3716kb

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

result:

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