結果
問題 | No.833 かっこいい電車 |
ユーザー | 👑 hitonanode |
提出日時 | 2019-05-24 21:53:43 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 74 ms / 2,000 ms |
コード長 | 4,284 bytes |
コンパイル時間 | 1,548 ms |
コンパイル使用メモリ | 174,068 KB |
実行使用メモリ | 8,744 KB |
最終ジャッジ日時 | 2023-09-14 20:50:39 |
合計ジャッジ時間 | 4,109 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
5,844 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 53 ms
6,016 KB |
testcase_11 | AC | 74 ms
7,472 KB |
testcase_12 | AC | 23 ms
5,032 KB |
testcase_13 | AC | 14 ms
4,384 KB |
testcase_14 | AC | 65 ms
7,536 KB |
testcase_15 | AC | 32 ms
5,828 KB |
testcase_16 | AC | 31 ms
6,508 KB |
testcase_17 | AC | 15 ms
4,376 KB |
testcase_18 | AC | 63 ms
6,176 KB |
testcase_19 | AC | 28 ms
6,268 KB |
testcase_20 | AC | 8 ms
4,428 KB |
testcase_21 | AC | 45 ms
4,992 KB |
testcase_22 | AC | 50 ms
8,280 KB |
testcase_23 | AC | 31 ms
6,420 KB |
testcase_24 | AC | 48 ms
7,844 KB |
testcase_25 | AC | 59 ms
6,068 KB |
testcase_26 | AC | 34 ms
6,852 KB |
testcase_27 | AC | 45 ms
6,128 KB |
testcase_28 | AC | 29 ms
4,656 KB |
testcase_29 | AC | 38 ms
5,500 KB |
testcase_30 | AC | 59 ms
8,744 KB |
testcase_31 | AC | 41 ms
5,848 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long int; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) 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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; #define FI first #define SE second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) // 1-indexed BIT (i : [1, len]) template<typename T> struct BIT { int len; vector<T> val; BIT(int num) : len(num), val(num + 1) {} BIT() : BIT(0) {} void reset() { fill(val.begin(), val.end(), 0); } void add(int pos, T v) { while (pos > 0 and pos <= len) val[pos] += v, pos += pos & -pos; } T sum(int pos) const // (0, pos] { T res = 0; while (pos > 0) res += val[pos], pos -= pos & -pos; return res; } }; template<typename T> ostream &operator<<(ostream &os, const BIT<T> &b){ T prv = 0; os << "["; REP(i, b.len) { T nxt = b.sum(i + 1); os << nxt - prv << ","; prv = nxt; } os << "]"; return os; } int N, Q; int main() { cin >> N >> Q; BIT<lint> bit(N + 1); REP(i, N) { lint A; cin >> A; bit.add(i + 1, A); } set<int> cut; REP(i, N + 2) cut.insert(i); REP(_, Q) { int q; lint x; cin >> q >> x; if (q == 3) bit.add(x, 1); if (q == 1) cut.erase(x); if (q == 2) cut.insert(x); if (q == 4) { auto itr = cut.lower_bound(x); auto r = *itr; auto l = *prev(itr); printf("%lld\n", bit.sum(r) - bit.sum(l)); } } }