結果
問題 | No.1827 最長部分スーパーリッチ門松列列 |
ユーザー | otera |
提出日時 | 2022-01-29 01:44:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 5,212 bytes |
コンパイル時間 | 1,925 ms |
コンパイル使用メモリ | 203,020 KB |
実行使用メモリ | 9,088 KB |
最終ジャッジ日時 | 2024-06-09 19:44:30 |
合計ジャッジ時間 | 4,965 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 4 ms
5,376 KB |
testcase_04 | AC | 17 ms
5,376 KB |
testcase_05 | AC | 16 ms
5,376 KB |
testcase_06 | AC | 16 ms
5,376 KB |
testcase_07 | AC | 49 ms
8,960 KB |
testcase_08 | AC | 49 ms
9,088 KB |
testcase_09 | AC | 49 ms
9,088 KB |
testcase_10 | AC | 48 ms
9,088 KB |
testcase_11 | AC | 49 ms
8,960 KB |
testcase_12 | AC | 49 ms
8,960 KB |
testcase_13 | AC | 49 ms
9,088 KB |
testcase_14 | AC | 50 ms
9,088 KB |
testcase_15 | AC | 49 ms
8,960 KB |
testcase_16 | AC | 48 ms
8,960 KB |
testcase_17 | AC | 57 ms
9,088 KB |
testcase_18 | AC | 56 ms
9,088 KB |
testcase_19 | AC | 54 ms
9,088 KB |
testcase_20 | AC | 51 ms
9,088 KB |
testcase_21 | AC | 52 ms
8,960 KB |
testcase_22 | AC | 49 ms
9,088 KB |
testcase_23 | AC | 50 ms
8,960 KB |
testcase_24 | AC | 49 ms
8,960 KB |
ソースコード
/** * author: otera * created: 29.01.2022 00:54:47 **/ #include<bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define per(i,n) for(int i=n-1;i>=0;i--) #define per1(i,n) for(int i=n;i>=1;i--) typedef pair<int, int> P; typedef pair<ll, ll> LP; #define pb push_back #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define tpow(n) (1LL<<(n)) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } 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; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vector<type>name(__VA_ARGS__) #define VEC(type,name,size) vector<type>name(size);in(name) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name) #define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; template<class T> void scan(T& a){ cin >> a; } template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template<class T> void print(const T& a){ cout << a; } template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "<<x1<<endl #define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl #define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl #define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl #define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl #ifdef DEBUG #define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__) #define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); } #else #define debug(...) #define dump(...) #endif void solve() { INT(n); VEC(int, p, n); rep(i, n) -- p[i]; vc<int> check(n - 1, 0); vc<int> rp(n); rep(i, n) rp[p[i]] = i; int ans = 1; int res = 1; auto f = [&](int a, int b, int v) -> bool { if(a <= v and b <= v) return false; if(a > v and b > v) return false; return true; }; rep(i, n) { if(rp[i] - 1 >= 0) { int id = rp[i] - 1; int pre = check[id]; check[id] = f(p[id], p[id + 1], i); res += check[id] - pre; } if(rp[i] + 1 < n) { int id = rp[i]; int pre = check[id]; check[id] = f(p[id], p[id + 1], i); res += check[id] - pre; } chmax(ans, res); } out(ans); } signed main() { ios::sync_with_stdio(false); cin.tie(0); // cout << fixed << setprecision(20); INT(t); rep(i, t)solve(); // solve(); return 0; }