QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#560556 | #8813. Records in Chichén Itzá | ucup-team3651 | WA | 4ms | 3732kb | C++14 | 1.0kb | 2024-09-12 16:27:06 | 2024-09-12 16:27:06 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define N 500005
using namespace std;
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return x*f;
}
void write(int x){
if(x<0)x=-x,putchar('-');
if(x/10)write(x/10);
putchar(x%10+'0');
}
int a[N];
void solve(){
int n=read();
for(int i=1;i<=n;i++)a[i]=read();
if(a[n]<3)printf("No\n");
else if(n<=3)printf("No\n");
else if(a[n-2]==1)printf("No\n");
else printf("Yes\n");
}
int main(){
#ifdef EAST_CLOUD
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
#endif
int T=read();while(T--)solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
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: 4ms
memory: 3732kb
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: 0ms
memory: 3732kb
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 2045th words differ - expected: 'No', found: 'Yes'