Submission #34053861

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef pair<ld,ld> state;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;

void solve()
{
	int n; cin>>n;
	deque<int> a(n);
	for(int i=0;i<n;i++) 
	{
		cin>>a[i]; a[i]--;
	}
	while(true)
	{
		deque<int> cur; cur.pb(a[0]);
		for(int i=1;i<n;i++)
		{
			int x=cur.back(); int y=a[i];
			if(x/2!=y/2)
			{
				cur.pb(y); continue;
			}
			//same color
			if(x<2)
			{
				cur.pop_back(); cur.pb(max(x,y));
			}
			else
			{
				cur.pop_back(); cur.pb(min(x,y));
			}
		}
		a=cur;n=a.size();
		if(a.size()==1) break;
		if(a[0]/2!=a[n-1]/2) break;
		a.push_front(a.back()); a.pop_back();
	}
	if(n<=2)
	{
		cout<<"Yes\n"; return ;
	}
	int cnt[4]={};
	for(auto x:a) cnt[x]++;
	if(cnt[1]>cnt[3]&&cnt[2]>cnt[0]){cout<<"Yes\n"; return ;}
	cout<<"No\n";
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t; cin>>t;
	while(t--) solve();
}

Submission Info

Judge Result