結果
問題 | No.2036 Max Middle |
ユーザー | asaringo |
提出日時 | 2023-11-11 16:04:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,692 bytes |
コンパイル時間 | 2,217 ms |
コンパイル使用メモリ | 215,036 KB |
実行使用メモリ | 10,584 KB |
最終ジャッジ日時 | 2024-09-26 02:46:29 |
合計ジャッジ時間 | 3,490 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 36 ms
9,320 KB |
testcase_17 | WA | - |
testcase_18 | AC | 19 ms
6,940 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; #define overload1(a, ...) a #define overload2(a, b, ...) b #define overload3(a, b, c, ...) c #define overload4(a, b, c, d, ...) d #define overload5(a, b, c, d, e ...) e #define overload6(a, b, c, d, e, f ...) f #define overload7(a, b, c, d, e, f, g ...) g #define fast_io ios::sync_with_stdio(false); cin.tie(nullptr); #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math") typedef __int128_t int128; typedef long long ll; typedef long double ld; #define chmin(a,b) a = min(a,b); #define chmax(a,b) a = max(a,b); #define bit_count(x) __builtin_popcountll(x) #define leading_zero_count(x) __builtin_clz(x) #define trailing_zero_count(x) __builtin_ctz(x) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) a / gcd(a,b) * b #define rep(...) overload4(__VA_ARGS__, rrep, rep1, rep0)(__VA_ARGS__) #define rep0(n) for(int _ = 0 ; _ < n ; _++) #define rep1(i,n) for(int i = 0 ; i < n ; i++) #define rrep(i,a,b) for(int i = a ; i < b ; i++) #define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++) #define pt(a) cout << a << endl; #define print(...) printall(__VA_ARGS__); #define debug(a) cout << #a << " " << a << endl; #define all(a) a.begin(), a.end() #define endl "\n"; #define v1(T,n,a) vector<T>(n,a) #define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a)) #define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a)) #define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a)) template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;} template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&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(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;} template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;} template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;} template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;} void solve(){ ll n; cin >> n; vector<int> A(n); cin >> A; rep(2){ while(A.size() > 1){ int a = A.back(); A.pop_back(); int b = A.back(); if(a < b){ A.push_back(a); break; } } reverse(all(A)); } n = A.size(); A.push_back(-2e9); vector<vector<int>> B; vector<int> V; rep(i,n+1){ if(i == n || A[i] > A[i+1]){ if(!V.empty()){ V.push_back(i); B.push_back(V); } V = {}; continue; } V.push_back(i); } B.push_back({(int)n-1}); ll res = 0; ll add = 0; rep(i,B.size()-1){ ll as = B[i].size() + add - 1; ll bs = B[i+1].front() - B[i].back(); ll mn = min(as,bs); res += mn * (mn - 1) / 2; res += (as + bs + 1 - mn * 2) * mn; add = as; } pt(res) } int main(){ fast_io int t = 1; // cin >> t; rep(i,t) solve(); }