結果
問題 | No.833 かっこいい電車 |
ユーザー |
|
提出日時 | 2019-05-24 22:14:33 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,033 bytes |
コンパイル時間 | 1,721 ms |
コンパイル使用メモリ | 179,788 KB |
実行使用メモリ | 10,624 KB |
最終ジャッジ日時 | 2024-07-02 03:42:35 |
合計ジャッジ時間 | 4,773 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 19 WA * 11 |
ソースコード
// includes#include <bits/stdc++.h>// macros#define ll long long int#define pb emplace_back#define mk make_pair#define pq priority_queue#define FOR(i, a, b) for(int i=(a);i<(b);++i)#define rep(i, n) FOR(i, 0, n)#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)#define vrep(v, i) for(int i = 0; i < (v).size(); i++)#define all(x) (x).begin(),(x).end()#define sz(x) ((int)(x).size())#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())#define FI first#define SE second#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];#define bit(n) (1LL<<(n))#define INT(n) int n; cin >> n;#define LL(n) ll n; cin >> n;#define DOUBLE(n) double n; cin >> n;using namespace std;// typestypedef pair<int, int> P;typedef pair<ll, int> Pl;typedef pair<ll, ll> Pll;typedef pair<double, double> Pd;typedef complex<double> cd;// constantsconst int inf = 1e9;const ll linf = 1LL << 50;const double EPS = 1e-10;const int mod = 1e9 + 7;const int dx[4] = {-1, 0, 1, 0};const int dy[4] = {0, -1, 0, 1};// solvetemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr =itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr;auto titr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; autotitr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os <<*itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os <<itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end();++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}template<typename T>struct BIT_{int n;vector<T> bit;BIT_(int n_){n = n_;bit = vector<T>(n+1, 0);}void add(int a, T w){for(int x = a; x < n; x |= (x + 1)){bit[x] += w;}}T sum(int a){T res = 0;for(int x = a; x >= 0; x = (x & (x + 1)) - 1){res += bit[x];}return res;}};typedef struct BIT_<int> BITI;typedef struct BIT_<long long> BITL;struct ran{int l, r;ll w;ran(int l, int r, ll w): l(l), r(r), w(w){}bool operator<(const ran& R) const{return r < R.r;}};int main(int argc, char const* argv[]){ios_base::sync_with_stdio(false);cin.tie(0);INT(n);INT(q);vector<ll> a(n);cin >> a;set<ran> st;rep(i, n)st.insert(ran(i, i+1, a[i]));BITI bt(n);rep(i, n)bt.add(i, a[i]);rep(i, q){int c, x;cin >> c >> x, x--;if(c == 1){auto itr = st.upper_bound(ran(-1, x, 0));int l = (*itr).l;ll w1 = (*itr).w;if((*itr).r > x + 1)continue;itr = st.erase(itr);int r = (*itr).r;ll w2 = (*itr).w;itr = st.erase(itr);st.insert(ran(l, r, w1+w2));}else if(c == 2){auto itr = st.upper_bound(ran(-1, x, 0));if((*itr).r <= x + 1)continue;int l = (*itr).l;int r = (*itr).r;itr = st.erase(itr);st.insert(ran(l, x + 1, bt.sum(x) - bt.sum(l-1)));st.insert(ran(x+1, r, bt.sum(r-1) - bt.sum(x)));}else if(c == 3){bt.add(x, 1);auto itr = st.upper_bound(ran(-1, x, 0));int l = (*itr).l;int r = (*itr).r;ll w = (*itr).w;itr = st.erase(itr);st.insert(ran(l, r, w + 1));}else{auto itr = st.upper_bound(ran(-1, x, 0));cout << (*itr).w << endl;}}return 0;}