Submission #40166299

Source Code Expand

// LUOGU_RID: 106435602
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define int long long
#define pow Pow
using namespace std;
int t,n,a[300005],m,flag;
bitset<5> b; 
bool check(int a,int b,int c){
	if(abs(b-a)>=2&&abs(b-c)>=2) return 1;
	else return 0;
}
signed main(){
	cin>>t;
	while(t--){
		cin>>n;
		m=0;
		flag=1;
		for(int i=1;i<=n;i++){
			int x;
			cin>>x;
			if(x==a[m]) continue;
			if(x==1&&a[m]==2||x==4&&a[m]==3) continue;
			if(x==2&&a[m]==1||x==3&&a[m]==4){
				a[m]=x;
				continue;
			}
			m++;
			a[m]=x;
		}
		while(m){
			if(a[m]==a[1]||a[m]==4&&a[1]==3||a[m]==1&&a[1]==2) m--;
			else if(a[m]==3&&a[1]==4||a[m]==2&&a[1]==1) a[1]=a[m],m--;
			else break;
		}
		if(m<3){
			cout<<"Yes\n";
			continue;
		}
		a[m+1]=a[1];
		a[0]=a[m];
//		cout<<m<<endl;
//		for(int i=1;i<=m;i++) cout<<a[i]<<" ";
//		cout<<endl;
		for(int i=1;i<=m-1;i++){
			if(check(a[i-1],a[i],a[i+1])&&check(a[i],a[i+1],a[i+2])){
				flag++;
			}
			else{
				
			}
		}
		if(flag>=m/2) cout<<"No\n";
		else cout<<"Yes\n";
	}
	return 0;
}

Submission Info

Submission Time
Task C - Planar Tree
User luogu_bot5
Language C++ (GCC 9.2.1)
Score 0
Code Size 1090 Byte
Status WA
Exec Time 107 ms
Memory 5940 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:11: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   23 |    if(x==1&&a[m]==2||x==4&&a[m]==3) continue;
      |       ~~~~^~~~~~~~~
./Main.cpp:24:11: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   24 |    if(x==2&&a[m]==1||x==3&&a[m]==4){
      |       ~~~~^~~~~~~~~
./Main.cpp:32:26: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   32 |    if(a[m]==a[1]||a[m]==4&&a[1]==3||a[m]==1&&a[1]==2) m--;
      |                   ~~~~~~~^~~~~~~~~
./Main.cpp:32:44: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   32 |    if(a[m]==a[1]||a[m]==4&&a[1]==3||a[m]==1&&a[1]==2) m--;
      |                                     ~~~~~~~^~~~~~~~~
./Main.cpp:33:19: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   33 |    else if(a[m]==3&&a[1]==4||a[m]==2&&a[1]==1) a[1]=a[m],m--;
      |            ~~~~~~~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 2
AC × 33
WA × 50
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt
All 00-sample-001.txt, 00-sample-002.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt, 01-028.txt, 01-029.txt, 01-030.txt, 01-031.txt, 01-032.txt, 01-033.txt, 01-034.txt, 01-035.txt, 01-036.txt, 01-037.txt, 01-038.txt, 01-039.txt, 01-040.txt, 01-041.txt, 01-042.txt, 01-043.txt, 01-044.txt, 01-045.txt, 01-046.txt, 01-047.txt, 01-048.txt, 01-049.txt, 01-050.txt, 01-051.txt, 01-052.txt, 01-053.txt, 01-054.txt, 01-055.txt, 01-056.txt, 01-057.txt, 01-058.txt, 01-059.txt, 01-060.txt, 01-061.txt, 01-062.txt, 01-063.txt, 01-064.txt, 01-065.txt, 01-066.txt, 01-067.txt, 01-068.txt, 01-069.txt, 01-070.txt, 01-071.txt, 01-072.txt, 01-073.txt, 01-074.txt, 01-075.txt, 01-076.txt, 01-077.txt, 01-078.txt, 01-079.txt, 01-080.txt, 01-081.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 13 ms 3464 KiB
00-sample-002.txt AC 2 ms 3480 KiB
01-001.txt WA 107 ms 3532 KiB
01-002.txt WA 99 ms 3520 KiB
01-003.txt WA 98 ms 3480 KiB
01-004.txt WA 97 ms 3376 KiB
01-005.txt WA 95 ms 3532 KiB
01-006.txt WA 96 ms 3468 KiB
01-007.txt WA 92 ms 3520 KiB
01-008.txt WA 5 ms 3444 KiB
01-009.txt WA 6 ms 3528 KiB
01-010.txt WA 8 ms 3384 KiB
01-011.txt WA 8 ms 3596 KiB
01-012.txt WA 4 ms 3468 KiB
01-013.txt WA 11 ms 3368 KiB
01-014.txt WA 8 ms 3316 KiB
01-015.txt WA 10 ms 3480 KiB
01-016.txt WA 8 ms 3600 KiB
01-017.txt WA 7 ms 3528 KiB
01-018.txt WA 10 ms 3480 KiB
01-019.txt WA 9 ms 3320 KiB
01-020.txt AC 50 ms 4700 KiB
01-021.txt AC 45 ms 3716 KiB
01-022.txt AC 46 ms 3608 KiB
01-023.txt AC 46 ms 3380 KiB
01-024.txt WA 62 ms 3464 KiB
01-025.txt AC 45 ms 5692 KiB
01-026.txt WA 45 ms 3792 KiB
01-027.txt WA 49 ms 3396 KiB
01-028.txt WA 46 ms 3560 KiB
01-029.txt WA 61 ms 3476 KiB
01-030.txt WA 45 ms 5720 KiB
01-031.txt WA 46 ms 5936 KiB
01-032.txt AC 44 ms 5816 KiB
01-033.txt AC 41 ms 3528 KiB
01-034.txt WA 42 ms 3380 KiB
01-035.txt WA 43 ms 3372 KiB
01-036.txt AC 41 ms 3628 KiB
01-037.txt WA 43 ms 3680 KiB
01-038.txt AC 43 ms 4556 KiB
01-039.txt WA 44 ms 4640 KiB
01-040.txt AC 46 ms 4696 KiB
01-041.txt WA 44 ms 4732 KiB
01-042.txt WA 43 ms 4520 KiB
01-043.txt WA 44 ms 4660 KiB
01-044.txt AC 43 ms 4768 KiB
01-045.txt AC 45 ms 4636 KiB
01-046.txt WA 45 ms 4636 KiB
01-047.txt WA 47 ms 5548 KiB
01-048.txt WA 45 ms 5476 KiB
01-049.txt WA 45 ms 5592 KiB
01-050.txt WA 44 ms 5544 KiB
01-051.txt WA 45 ms 5476 KiB
01-052.txt WA 46 ms 5584 KiB
01-053.txt AC 47 ms 5940 KiB
01-054.txt WA 45 ms 5712 KiB
01-055.txt AC 45 ms 5816 KiB
01-056.txt AC 43 ms 3532 KiB
01-057.txt AC 41 ms 3320 KiB
01-058.txt AC 41 ms 3480 KiB
01-059.txt AC 41 ms 3580 KiB
01-060.txt AC 46 ms 4028 KiB
01-061.txt AC 43 ms 4648 KiB
01-062.txt WA 43 ms 4540 KiB
01-063.txt AC 45 ms 4772 KiB
01-064.txt AC 43 ms 4772 KiB
01-065.txt WA 45 ms 4704 KiB
01-066.txt WA 46 ms 4656 KiB
01-067.txt AC 46 ms 4544 KiB
01-068.txt AC 43 ms 4496 KiB
01-069.txt AC 45 ms 4544 KiB
01-070.txt AC 44 ms 5480 KiB
01-071.txt AC 44 ms 5584 KiB
01-072.txt AC 44 ms 5460 KiB
01-073.txt WA 45 ms 5644 KiB
01-074.txt AC 48 ms 5424 KiB
01-075.txt WA 44 ms 5480 KiB
01-076.txt AC 32 ms 4660 KiB
01-077.txt AC 38 ms 4636 KiB
01-078.txt WA 38 ms 3608 KiB
01-079.txt WA 39 ms 3556 KiB
01-080.txt WA 36 ms 3372 KiB
01-081.txt WA 45 ms 3380 KiB