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

提出ソース

結果

問題	No.2518 Adjacent Larger
ユーザー	dyktr_06
提出日時	2023-10-27 22:12:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	23 ms / 2,000 ms
コード長	5,478 bytes
コンパイル時間	8,594 ms
コンパイル使用メモリ	311,092 KB
実行使用メモリ	8,416 KB
最終ジャッジ日時	2023-10-27 22:12:20
合計ジャッジ時間	8,095 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,348 KB
testcase_01	AC	12 ms 4,348 KB
testcase_02	AC	12 ms 4,348 KB
testcase_03	AC	13 ms 4,348 KB
testcase_04	AC	12 ms 4,348 KB
testcase_05	AC	12 ms 4,348 KB
testcase_06	AC	6 ms 4,348 KB
testcase_07	AC	6 ms 4,348 KB
testcase_08	AC	6 ms 4,348 KB
testcase_09	AC	7 ms 4,348 KB
testcase_10	AC	6 ms 4,348 KB
testcase_11	AC	6 ms 4,348 KB
testcase_12	AC	6 ms 4,348 KB
testcase_13	AC	6 ms 4,348 KB
testcase_14	AC	5 ms 4,348 KB
testcase_15	AC	5 ms 4,348 KB
testcase_16	AC	23 ms 8,388 KB
testcase_17	AC	14 ms 6,212 KB
testcase_18	AC	14 ms 6,172 KB
testcase_19	AC	12 ms 5,736 KB
testcase_20	AC	16 ms 6,384 KB
testcase_21	AC	16 ms 6,444 KB
testcase_22	AC	17 ms 6,444 KB
testcase_23	AC	23 ms 8,416 KB
testcase_24	AC	15 ms 6,180 KB
testcase_25	AC	16 ms 6,444 KB
testcase_26	AC	15 ms 6,444 KB
testcase_27	AC	15 ms 6,444 KB
testcase_28	AC	21 ms 8,416 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll T;

void input(){
    in(T);
}

void solve(){
    ll n; in(n);
    vll a; vin(a, n);

    vll cnt(3);
    rep(i, n) cnt[a[i]]++;

    vll b = {a[0]};
    rep(i, 1, n){
        if(b.back() != a[i]){
            b.push_back(a[i]);
        }else{
        	if(a[i] != 1){
        		out("No");
        		return;
        	}
        }
    }
    if(b[0] == b.back()) b.pop_back();
    ll s = b.size();
    
    ll check = 1;
    rep(i, s){
        ll prev = (i + s - 1) % s, nxt = (i + 1) % s;
        if(b[i] != 1){
            if(b[prev] == b[i]) check = 0;
            if(b[nxt] == b[i]) check = 0;
        }else{
            if(b[prev] == b[nxt] && b[prev] != 1) check = 0;
        }
    }
    if(check && cnt[0] >= 1 && cnt[0] == cnt[2]){
        out("Yes");
    }else{
        out("No");
    }
}

void test(){
    ll n = 6;
    vll p(n);
    iota(ALL(p), 0);
    set<vll> s;
    do{
        vll cnt(n);
        vll cnt2(3);
        rep(i, n){
            if(p[i] < p[(i + n - 1) % n]){
                cnt[i]++;
            }
            if(p[i] < p[(i + 1) % n]){
                cnt[i]++;
            }
        }
        rep(i, n) cnt2[cnt[i]]++;
        s.insert(cnt);
    }while(next_permutation(ALL(p)));
    for(auto v : s) out(v);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    while(T--) solve();
    // test();
}

yukicoder

結果

テストケース

ソースコード