結果
問題 | No.2518 Adjacent Larger |
ユーザー |
![]() |
提出日時 | 2023-10-27 22:42:25 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 16 ms / 2,000 ms |
コード長 | 1,853 bytes |
コンパイル時間 | 3,425 ms |
コンパイル使用メモリ | 250,616 KB |
最終ジャッジ日時 | 2025-02-17 15:31:58 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
#include<bits/stdc++.h>using namespace std;//* ATCODER#include<atcoder/all>using namespace atcoder;typedef modint998244353 mint;//*//* BOOST MULTIPRECISION#include<boost/multiprecision/cpp_int.hpp>using namespace boost::multiprecision;//*/typedef long long ll;#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)template <typename T> bool chmin(T &a, const T &b) {if (a <= b) return false;a = b;return true;}template <typename T> bool chmax(T &a, const T &b) {if (a >= b) return false;a = b;return true;}template <typename T> T max(vector<T> &a){assert(!a.empty());T ret = a[0];for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);return ret;}template <typename T> T min(vector<T> &a){assert(!a.empty());T ret = a[0];for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);return ret;}template <typename T> T sum(vector<T> &a){T ret = 0;for (int i=0; i<(int)a.size(); i++) ret += a[i];return ret;}void solve(){int n; cin >> n;vector<int> a(n);rep(i,0,n) cin >> a[i];if (max(a) != 2){cout << "No\n";return;}if (min(a) != 0){cout << "No\n";return;}if (sum(a) != n){cout << "No\n";return;}vector<int> cnt(3);rep(i,0,n){cnt[a[i]]++;}if (cnt[0] != cnt[2]){cout << "No\n";return;}int lst = -1;rep(i,0,n){if (a[i%n] == 0 || a[i%n] == 2){if (lst == -1){lst = a[i%n];}else if (lst != a[i%n]){lst = a[i%n];}else{cout << "No\n";return;}}if (a[i%n] == 2 && a[(i+1)%n] == 2){cout << "No\n";return;}if (a[i%n] == 0 && a[(i+1)%n] == 0){cout << "No\n";return;}}cout << "Yes\n";return;}int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);int t; cin >> t;while(t--) solve();}