結果
問題 | No.2697 Range LIS Query |
ユーザー | akiaa11 |
提出日時 | 2024-03-26 21:10:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 529 ms / 10,000 ms |
コード長 | 4,092 bytes |
コンパイル時間 | 4,573 ms |
コンパイル使用メモリ | 271,744 KB |
実行使用メモリ | 28,512 KB |
最終ジャッジ日時 | 2024-09-30 14:25:42 |
合計ジャッジ時間 | 10,854 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 13 ms
5,248 KB |
testcase_04 | AC | 14 ms
5,248 KB |
testcase_05 | AC | 13 ms
5,248 KB |
testcase_06 | AC | 500 ms
28,032 KB |
testcase_07 | AC | 491 ms
28,160 KB |
testcase_08 | AC | 489 ms
28,288 KB |
testcase_09 | AC | 436 ms
28,512 KB |
testcase_10 | AC | 443 ms
28,416 KB |
testcase_11 | AC | 439 ms
28,384 KB |
testcase_12 | AC | 286 ms
27,136 KB |
testcase_13 | AC | 330 ms
25,856 KB |
testcase_14 | AC | 439 ms
26,112 KB |
testcase_15 | AC | 521 ms
28,160 KB |
testcase_16 | AC | 525 ms
28,160 KB |
testcase_17 | AC | 529 ms
28,160 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} struct S{ S(){rep(i, 4) rep(j, 4) a[i][j] = 0;len = 1;} array<array<int, 4>, 4> a; int len; }; S op(S a, S b){ S c; rep(l, 4) rep(i, l, 4) rep(k, i, 4) rep(j, k, 4){ chmax(c.a[l][j], a.a[l][i] + b.a[k][j]); } c.len = a.len + b.len; return c; } S e(){return S();} S mapp(int x, S a){ if(x == -1) return a; rep(i, 4) rep(j, 4) a.a[i][j] = 0; a.a[x][x] = a.len; return a; } int comp(int a, int b){if(a == -1) return b;return a;} int id(){return -1;} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n;cin>>n; vector<S> a(n); rep(i, n){ int b;cin>>b; b--; a[i].a[b][b] = 1; } lazy_segtree<S, op, e, int, mapp, comp, id> sg(a); int q;cin>>q; veci ans; rep(i, q){ int ty, l, r;cin>>ty>>l>>r; l--; if(ty == 1){ auto d = sg.prod(l, r); int mx = 0; rep(i, 4) rep(j, 4) chmax(mx, d.a[i][j]); ans.push_back(mx); }else{ int x;cin>>x; x--; sg.apply(l, r, x); } } for(auto v : ans) cout<<v<<endl; }