結果
問題 |
No.3265 地元に帰れば天才扱い!
|
ユーザー |
![]() |
提出日時 | 2025-09-06 13:31:19 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 505 ms / 2,500 ms |
コード長 | 8,352 bytes |
コンパイル時間 | 4,095 ms |
コンパイル使用メモリ | 287,944 KB |
実行使用メモリ | 12,872 KB |
最終ジャッジ日時 | 2025-09-06 13:31:44 |
合計ジャッジ時間 | 17,749 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 21 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" #line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << std::min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(std::vector<T> &v){ std::sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp" #line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp" namespace noya2{ template <class T> struct fenwick_tree { public: fenwick_tree() : _n(0) {} explicit fenwick_tree(int n_) : _n(n_), data(n_) {} void add(int p, T x) { assert(0 <= p && p < _n); p++; while (p <= _n) { data[p - 1] += x; p += p & -p; } } T sum(int l, int r) { assert(0 <= l && l <= r && r <= _n); return sum(r) - sum(l); } private: int _n; vector<T> data; T sum(int r) { T s = 0; while (r > 0) { s += data[r - 1]; r -= r & -r; } return s; } }; } // namespace noya2 #line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/dual_segment_tree.hpp" // https://ebi-fly13.github.io/Library/data_structure/dual_segtree.hpp #include <bit> #line 7 "/Users/noya2/Desktop/Noya2_library/data_structure/dual_segment_tree.hpp" #include <ranges> #line 9 "/Users/noya2/Desktop/Noya2_library/data_structure/dual_segment_tree.hpp" namespace noya2 { template <class F, auto composition, auto id> struct dual_segtree { private: void all_apply(int i, F f) { d[i] = composition(f, d[i]); } void push(int i) { assert(i < sz); all_apply(2 * i, d[i]); all_apply(2 * i + 1, d[i]); d[i] = id(); } public: dual_segtree(int _n) : dual_segtree(std::vector<F>(_n, id())) {} dual_segtree(const std::vector<F> &a) : n(a.size()), sz(std::bit_ceil(a.size())) { lg2 = std::countr_zero<unsigned int>(sz); d.assign(2 * sz, id()); for (int i : std::views::iota(sz, sz + n)) { d[i] = a[i - sz]; } } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= n); if (l == r) return; l += sz; r += sz; for (int i : std::views::iota(1, lg2 + 1) | std::views::reverse) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } } F get(int p) { assert(0 <= p && p < n); p += sz; for (int i : std::views::iota(1, lg2 + 1) | std::views::reverse) { push(p >> i); } return d[p]; } void set(int p, F f){ assert(0 <= p && p < n); p += sz; for (int i : std::views::iota(1, lg2 + 1) | std::views::reverse) { push(p >> i); } d[p] = f; } private: int n, sz, lg2; std::vector<F> d; }; } // namespace noya2 #line 5 "c.cpp" ll composition(ll f, ll g){ return f + g; } ll ident(){ return 0; } void solve(){ int n, m; in(n,m); vector<ll> a(n); vector<int> xs(n), ls(n), rs(n); ll asum = 0; dual_segtree<ll,composition,ident> seg(m); fenwick_tree<ll> fen(m); rep(i,n){ in(a[i],ls[i],rs[i]); ls[i]--; asum += a[i] * (rs[i] - ls[i]); seg.apply(ls[i],rs[i],1); xs[i] = i; fen.add(xs[i],a[i]); } ll bsum = 0; rep(i,n){ bsum += fen.sum(ls[i],rs[i]); } int q; in(q); while (q--){ int i; in(i); i--; int x; in(x); x--; int l, r; in(l,r); l--; asum -= a[i] * (rs[i] - ls[i]); bsum -= fen.sum(ls[i],rs[i]); seg.apply(ls[i],rs[i],-1); bsum -= seg.get(xs[i]) * a[i]; fen.add(xs[i],-a[i]); ls[i] = l; rs[i] = r; xs[i] = x; fen.add(xs[i],a[i]); bsum += seg.get(xs[i]) * a[i]; seg.apply(ls[i],rs[i],1); bsum += fen.sum(ls[i],rs[i]); asum += a[i] * (rs[i] - ls[i]); ll ans = asum - bsum; out(ans); } } int main(){ int t = 1; //in(t); while (t--) { solve(); } }