結果
問題 | No.2809 Sort Query |
ユーザー | siganai |
提出日時 | 2024-07-12 23:08:07 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 808 ms / 2,000 ms |
コード長 | 7,985 bytes |
コンパイル時間 | 2,815 ms |
コンパイル使用メモリ | 222,380 KB |
実行使用メモリ | 37,236 KB |
最終ジャッジ日時 | 2024-07-12 23:08:55 |
合計ジャッジ時間 | 46,846 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 71 |
ソースコード
#line 1 "test.cpp" #include<bits/stdc++.h> //#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll,ll>; using pii = pair<int,int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vul = vector<ull>; using vpii = vector<pii>; using vvpii = vector<vpii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T,vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __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, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;} void Yes() {cout << "Yes\n";return;} void No() {cout << "No\n";return;} void YES() {cout << "YES\n";return;} void NO() {cout << "NO\n";return;} template <typename T> T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);} template <typename T> T ceil(T x, T y) {return floor(x + y - 1, y);} template <typename T> T bmod(T x, T y) {return x - y * floor(x, y);} template <typename T> pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack constexpr long double PI = 3.141592653589793238462643383279L; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; constexpr int mod = 998244353; //constexpr int mod = 1000000007; #line 2 "library/data-structure/FenwickTree.hpp" template <typename T> struct FenwickTree{ int N; T total = 0; vector<T> data; FenwickTree() = default; FenwickTree(int size) {init(size);} FenwickTree(vector<T> &v) { N = v.size() + 2; data.reserve(N + 1); data.emplace_back(0); for(auto &e:v) { total += e; data.emplace_back(e); } data.emplace_back(0); data.emplace_back(0); for (int i = 1; i < N - 1; ++i) { int j = i + (i & -i); if (j < N - 1) data[j] = data[i] + data[j]; } } void init(int size) { N = size + 2; data.assign(N + 1,{}); } // get sum of [0,k] T prod(int k) const { if (k < 0) return T{}; T ret{}; for (++k;k > 0;k -= k & -k) ret += data[k]; return ret; } // get sum of [l,r) inline T prod(int l,int r) const {return prod(r - 1) - prod(l - 1);} // get value of k inline T get(int k) const {return prod(k) - prod(k - 1); } T all_prod() const {return total;} void add(int k, T x) { total += x; for(++k;k < N;k += k & -k) data[k] += x; } // minimize i s.t. sum(i) >= w int lower_bound(T w) { if (w <= 0) return 0; int x = 0; for(int k = 1 <<__lg(N);k;k >>= 1) { if (x + k <= N - 1 && data[x + k] < w) { w -= data[x + k]; x += k; } } return x; } // minimize i s.t. sum(i) > w int upper_bound(T w) { if (w < 0) return 0; int x = 0; for(int k = 1 <<__lg(N);k;k >>= 1) { if (x + k <= N - 1 && data[x + k] <= w) { w -= data[x + k]; x += k; } } return x; } }; #line 100 "test.cpp" int main() { INT(n,q); VEC(ll,a,n); vi las(n,-1); vi cmd(q),ids(q); vl val(q); vl V = a; rep(i,q) { cin >> cmd[i]; if(cmd[i] == 1) { cin >> ids[i] >> val[i]; ids[i]--; V.emplace_back(val[i]); } else if(cmd[i] == 3) { cin >> ids[i]; ids[i]--; } } sort(all(V)); V.erase(unique(all(V)),V.end()); FenwickTree<int> fw(V.size()); int lassort = -2; set<pair<ll,int>> lazy; rep(i,n) lazy.insert(make_pair(a[i],i)); vi del; rep(i,q) { if(cmd[i] == 1) { if(las[ids[i]] > lassort) { lazy.erase(make_pair(a[ids[i]],ids[i])); lazy.insert(make_pair(val[i],ids[i])); } else { int id = fw.lower_bound(ids[i] + 1); del.emplace_back(id); lazy.insert(make_pair(val[i],ids[i])); } a[ids[i]] = val[i]; las[ids[i]] = i; } else if(cmd[i] == 2) { for(auto &id:del) fw.add(id,-1); del.clear(); for(auto &[x,_]:lazy) { int id = lower_bound(all(V),x) - V.begin(); fw.add(id,1); } lazy.clear(); lassort = i; } else { if(las[ids[i]] > lassort) { cout << a[ids[i]] << '\n'; } else { int id = fw.lower_bound(ids[i]+1); cout << V[id] << '\n'; } } } }