QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#461701#8813. Records in Chichén Itzáucup-team4074WA 44ms3688kbC++14406b2024-07-02 23:03:382024-07-02 23:03:39

Judging History

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

  • [2024-07-02 23:03:39]
  • 评测
  • 测评结果:WA
  • 用时:44ms
  • 内存:3688kb
  • [2024-07-02 23:03:38]
  • 提交

answer

#include<iostream>
using namespace std;
const int maxn=200010;
int a[maxn];
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		int ma=0,v=0,s=0,s2=0;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
			if(a[i]==1)s++;
			else s2=s2+a[i]-1;
			if(i-s-1>1)v=1;
		}
		if(s>=s2)cout<<"No\n";
		else if(s2-s==1&&a[s+1]==a[n])cout<<"No\n";
		else cout<<"Yes\n";
	}
	return 0;
 } 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3560kb

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

input:

1
2
1 1

output:

No

result:

ok "No"

Test #3:

score: 0
Accepted
time: 44ms
memory: 3600kb

input:

100000
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1
2
1 1...

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: 31ms
memory: 3688kb

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'