結果
問題 | No.789 範囲の合計 |
ユーザー | Konton7 |
提出日時 | 2020-05-07 13:26:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 98 ms / 1,000 ms |
コード長 | 5,715 bytes |
コンパイル時間 | 2,331 ms |
コンパイル使用メモリ | 218,644 KB |
実行使用メモリ | 7,304 KB |
最終ジャッジ日時 | 2024-07-03 09:24:00 |
合計ジャッジ時間 | 4,442 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 86 ms
7,228 KB |
testcase_03 | AC | 48 ms
6,944 KB |
testcase_04 | AC | 79 ms
7,200 KB |
testcase_05 | AC | 69 ms
7,240 KB |
testcase_06 | AC | 70 ms
7,232 KB |
testcase_07 | AC | 36 ms
6,940 KB |
testcase_08 | AC | 51 ms
6,944 KB |
testcase_09 | AC | 46 ms
6,944 KB |
testcase_10 | AC | 98 ms
7,304 KB |
testcase_11 | AC | 76 ms
7,208 KB |
testcase_12 | AC | 76 ms
7,204 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<int>; using VL = vector<ll>; using VS = vector<string>; using VVI = vector<VI>; using VVL = vector<VL>; using PII = std::pair<int, int>; using PLL = std::pair<ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template <typename T> void show1dvec(const vector<T> &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template <typename T> void show2dvec(const vector<vector<T>> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template <typename T, typename S> void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template <typename T> void maxvec(vector<T> &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template <typename T, typename S> bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } template <typename T> vector<T> cumsum(const vector<T> &v) { T s = 0; vector<T> ret; rep(i, v.size()) { s += v[i]; s %= mod; ret.emplace_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } string removezero(string &s) { string ret; for (auto z : s) if (z != '0') ret += z; return ret; } ll sumdigit(ll x) { ll ans{0}; while (x > 0) { ans += x % 10; x /= 10; } return ans; } template <typename T, typename S, typename R> ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } class RangeMinorMaxorSumQuery // 0-index { int const intmax = 2147483647; int const intmin = 0; vector<int> sgt; int n; int k; public: RangeMinorMaxorSumQuery(int n1, int f = -1) { if (f == -1) f = intmax; else if (f == 0) f = intmin; int na = 1; int ka = 0; while (na < n1) { na *= 2; ka++; } for (int i = 0; i < 2 * na; i++) sgt.push_back(f); n = na; k = ka; } void add_sum(int i, int x) { i += n; sgt[i] += x; while (i > 1) { i /= 2; sgt[i] = sgt[2 * i] + sgt[2 * i + 1]; } } int getsum(int a, int b, int k = 1, int l = 0, int r = -1) //閉区間 l <= x < r とする { if (r == -1) r = n; if (r <= a || b <= l) return intmin; if (a == l && b == r) return sgt[k]; else return getsum(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2) + getsum(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r); } void printsegtree() { for (int i = 0; i < 2 * n; i++) { cout << sgt[i] << " "; } cout << endl; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif int n, op, l, r, x, y, m; cin >> n; ll ans{0}; PII p; vector<pair<int, PII>> query(n); VI coordinate; coordinate.emplace_back(0); coordinate.emplace_back(1e9 + 1); rep(i, n) { cin >> op >> x >> y; query[i] = make_pair(op, make_pair(x, y)); coordinate.emplace_back(x); if (op == 1) coordinate.emplace_back(y); } sort(allpt(coordinate)); coordinate.erase(unique(allpt(coordinate)), coordinate.end()); m = coordinate.size(); RangeMinorMaxorSumQuery sgt(m, 0); rep(i, n) { op = query[i].first, p = query[i].second; if (op == 0) { x = p.first, y = p.second; x = lower_bound(allpt_c(coordinate), x) - coordinate.cbegin(); sgt.add_sum(x, y); } if (op == 1) { l = p.first, r = p.second; l = lower_bound(allpt_c(coordinate), l) - coordinate.cbegin(); r = lower_bound(allpt_c(coordinate), r) - coordinate.cbegin(); ans += sgt.getsum(l, r + 1); } } cout << ans << rt; return 0; }