#923158 (C++17) No.2518 Adjacent Larger

• 問題: No.2518 Adjacent Larger
• ユーザー: 👑 binap
• 提出日時: 2023-10-27 21:55:43
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 1,931 bytes
• コンパイル時間: 4,128 ms
• コンパイル使用メモリ: 263,232 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-09-25 14:02:05
• 合計ジャッジ時間: 6,887 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	RE	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	RE	-
testcase_05	WA	-
testcase_06	RE	-
testcase_07	RE	-
testcase_08	RE	-
testcase_09	RE	-
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	RE	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	AC	35 ms; 6,940 KB
testcase_17	AC	21 ms; 6,940 KB
testcase_18	AC	21 ms; 6,940 KB
testcase_19	AC	18 ms; 6,944 KB
testcase_20	AC	25 ms; 6,940 KB
testcase_21	AC	33 ms; 6,940 KB
testcase_22	AC	33 ms; 6,944 KB
testcase_23	AC	36 ms; 6,944 KB
testcase_24	AC	32 ms; 6,940 KB
testcase_25	AC	32 ms; 6,944 KB
testcase_26	AC	33 ms; 6,940 KB
testcase_27	AC	33 ms; 6,944 KB
testcase_28	AC	36 ms; 6,940 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m>
std::ostream& operator<<(std::ostream& os, const atcoder::static_modint<m>& a) {os << a.val(); return os;}
template<typename T>
istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

void solve(){
	int n;
	cin >> n;
	vi a(n);
	cin >> a;
	int sum = 0;
	rep(i, n) sum += a[i];
	if(sum != n){
		cout << "No\n";
		return;
	}
	bool all_one = true;
	rep(i, n) if(a[i] != 1) all_one = false;
	if(all_one){
		cout << "No\n";
		return;
	}
	bool success = true;
	rep(i, n) if((a[i] == 0 and a[(i + 1) % n] == 0) or (a[i] == 2 and a[(i + 1) % n] == 2)) success = false;
	if(!success){
		cout << "No\n";
		return;
	}
	vector<char> b(n, '?');
	int idx = -1;
	rep(i, n){
		if(a[i] == 0){
			b[(i + n - 1) % n] = '>';
			b[i] = '<';
			idx = i;
		}
		if(a[i] == 2){
			b[(i + n - 1) % n] = '<';
			b[i] = '>';
		}
	}
	rep(_, n){
		if(a[idx] == 1){
			if(b[(idx + n - 1) % n] == '<'){
				if(b[idx] == '>'){
					cout << "No\n";
					return;
				}else b[idx] = '<';
			}else if(b[(idx + n - 1) % n] == '>'){
				if(b[idx] == '<'){
					cout << "No\n";
					return;
				}else b[idx] = '>';
			}else assert(true);
		}
		idx++;
	}
	cout << "Yes\n";
	return;
}

int main(){
	int t;
	cin >> t;
	rep(i, t) solve();
	
	return 0;
}