結果
問題 | No.1705 Mode of long array |
ユーザー |
![]() |
提出日時 | 2021-10-09 13:47:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 96 ms / 3,000 ms |
コード長 | 3,674 bytes |
コンパイル時間 | 6,470 ms |
コンパイル使用メモリ | 304,604 KB |
最終ジャッジ日時 | 2025-01-24 23:52:46 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
ソースコード
#pragma region Macros// #pragma GCC target("avx2")#pragma GCC optimize("O3")#include <bits/stdc++.h>#include <atcoder/all>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;template <typename T>using ordered_set =tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;#define REP(i,n) for(ll i=0;i<ll(n);i++)#define REPD(i,n) for(ll i=n-1;i>=0;i--)#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)#define overload4(_1,_2,_3,_4,name,...) name#define overload3(_1,_2,_3,name,...) name#define rep1(n) for(ll i=0;i<n;++i)#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;i--;)#define rrep2(i,n) for(ll i=n;i--;)#define rrep3(i,a,b) for(ll i=b;i-->(a);)#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 ALL(v) v.begin(), v.end()#define endl "\n"#define fi first#define se second#define popcount(bit) __builtin_popcount(bit)#define popcountll(bit) __builtin_popcountll(bit)#define pb push_back#define eb emplace_back#define sz(x) ((ll)(x).size())using namespace atcoder;using P = pair<int, int>;using PL = pair<long long, long long>;using Graph = vector<vector<int>>;typedef long long ll;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; }inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }inline void OKNG(bool b = true) { cout << (b ? "OK" : "NG") << '\n'; }const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};const int fx[8] = {0, 1, 1, 1, 0, -1, -1, -1};const int fy[8] = {1, 1, 0, -1, -1, -1, 0, 1};template <typename T>const auto INF = numeric_limits<T>::max()/2;template <typename T>vector<T> compress(vector<T> &X) {// ソートした結果を vals にvector<T> vals = X;sort(vals.begin(), vals.end());// 隣り合う重複を削除(unique), 末端のゴミを削除(erase)vals.erase(unique(vals.begin(), vals.end()), vals.end());// 各要素ごとに二分探索で位置を求めるfor (int i = 0; i < (int)X.size(); i++) {X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();}return vals;}ll op(ll a, ll b){return max(a, b);}ll e(){return -1;}ll target = -1;bool f(ll v){return v < target;}int main() {ll n, m;cin >> n >> m;vector<ll> A(m);vector<ll> tmp(m);rep(i, m){cin >> A[i];tmp[i] = i + 1;}int q;cin >> q;vector<tuple<ll, ll, ll>> query;rep(i, q){ll t, x, y;cin >> t >> x >> y;tmp.pb(x);query.pb(make_tuple(t, x, y));}vector<ll> res = compress(tmp);vector<ll> rest(res.size());rep(i, m){rest[tmp[i]] = A[i];}segtree<ll, op, e> seg(rest);int g = res.size();rep(i, q){auto [a, b, c] = query[i];if(a == 1){ll d = tmp[m + i];ll h = seg.get(d);h += c;seg.set(d, h);}else if(a == 2){ll d = tmp[m+ i];ll h = seg.get(d);h -= c;seg.set(d, h);}else{target = seg.all_prod();cout << res[seg.min_left<f>(g) - 1] << endl;}}}