結果

問題 No.3078 Difference Sum Query
ユーザー 👑 binap
提出日時 2025-02-24 06:53:16
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 544 ms / 2,000 ms
コード長 3,200 bytes
コンパイル時間 4,599 ms
コンパイル使用メモリ 265,900 KB
実行使用メモリ 32,284 KB
最終ジャッジ日時 2025-03-26 18:49:47
合計ジャッジ時間 15,178 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using S = long long;
S op(S a, S b){
	return a + b;
}
S e(){
	return 0LL;
}

int main(){
	int n, q;
	cin >> n >> q;
	vector<long long> a(n);
	cin >> a;
	
	map<long long, vector<pair<int, int>>> event;
	rep(i, n) event[a[i]].emplace_back(1, i);
	
	vector<tuple<int, int, long long>> Query;
	rep(i, q){
		int l, r;
		long long x;
		cin >> l >> r >> x;
		l--; r--;
		Query.emplace_back(l, r, x);
		event[x].emplace_back(2, i);
	}
	
	segtree<S, op, e> seg1(n);
	segtree<S, op, e> seg2(n);
	
	rep(i, n) seg1.set(i, a[i]);
	rep(i, n) seg2.set(i, +1LL);
	
	vector<long long> ans(q);
	for(auto [dummy, vec] : event){
		for(auto [type, i] : vec){
			if(type == 1){
				seg1.set(i, -a[i]);
				seg2.set(i, -1LL);
			}
			if(type == 2){
				auto [l, r, x] = Query[i];
				long long val = 0;
				val += seg1.prod(l, r + 1);
				val -= seg2.prod(l, r + 1) * x;
				ans[i] = val;
			}
		}
	}
	rep(i, q) cout << ans[i] << "\n";
	
	return 0;
}
0