結果

問題 No.1827 最長部分スーパーリッチ門松列列
ユーザー rianoriano
提出日時 2022-01-28 22:21:16
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 5,053 bytes
コンパイル時間 1,687 ms
コンパイル使用メモリ 182,112 KB
実行使用メモリ 16,552 KB
最終ジャッジ日時 2024-06-09 15:33:13
合計ジャッジ時間 4,862 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 5 ms
6,940 KB
testcase_04 AC 26 ms
6,944 KB
testcase_05 AC 26 ms
6,940 KB
testcase_06 AC 26 ms
6,940 KB
testcase_07 AC 61 ms
15,120 KB
testcase_08 AC 62 ms
15,128 KB
testcase_09 AC 62 ms
16,552 KB
testcase_10 AC 63 ms
15,200 KB
testcase_11 AC 63 ms
15,832 KB
testcase_12 AC 116 ms
15,104 KB
testcase_13 AC 113 ms
15,144 KB
testcase_14 AC 118 ms
15,132 KB
testcase_15 AC 120 ms
15,056 KB
testcase_16 AC 116 ms
15,396 KB
testcase_17 AC 113 ms
15,336 KB
testcase_18 AC 101 ms
15,236 KB
testcase_19 AC 71 ms
15,256 KB
testcase_20 AC 71 ms
15,004 KB
testcase_21 AC 70 ms
15,084 KB
testcase_22 AC 81 ms
15,288 KB
testcase_23 AC 82 ms
15,608 KB
testcase_24 AC 79 ms
16,392 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:154:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  154 |             auto[a,id] = p[i];
      |                 ^

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)

//Graph
struct graph {
    long long N;
	vector<vector<tuple<long long,long long,int>>> G;
    vector<long long> par_v;
    vector<long long> par_e;
    int edge_count = 0;
    
	graph(long long n) {
        N = n;
		G = vector<vector<tuple<long long,long long,int>>>(N);
        par_v = vector<long long>(N,-1);
        par_e = vector<long long>(N,-1);
	}

    void unite(long long a,long long b,long long cost = 1,bool directed = false){
        G[a].emplace_back(b,cost,edge_count);
        if(!directed) G[b].emplace_back(a,cost,edge_count);
        edge_count++;
    }
};

const ll mod = 998244353;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint modinv(long long a, long long m = mod) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))
void out(vector<ll> &v){
    for(ll x:v) cout << x << " ";
    cout << "\n"; return;
}


int main() {
    riano_; ll ans = 0;
    ll N,M,K,T; cin >> T;
    rep(ii,T){
        cin >> N; ans = 0;
        vector<Pr> p;
        ll q[N];
        rep(i,N){
            ll a; cin >> a; p.emplace_back(a,i); q[i] = a;
        }
        sort(all(p)); reverse(all(p));
        int ed = 0; ll cn = N;
        rep(i,N){
            auto[a,id] = p[i];
            ll tmp;
            if(id==0){
                ed++;
                if(q[id+1]>q[id]) cn--;
                tmp = (cn-(N-1-i))*2LL+1-ed;
            }
            else if(id==N-1){
                if(q[id-1]>q[id]) cn--;
                ed++;
                tmp = (cn-(N-1-i))*2LL+1-ed;
            }
            else{
                if(q[id-1]>q[id]) cn--;
                if(q[id+1]>q[id]) cn--;
                tmp = (cn-(N-1-i))*2LL+1-ed;
            }
            chmax(ans,tmp);
            //cout << tmp << "\n";
        }
        cout << ans << "\n";
    }
    //cout << ans << endl;
}
0