mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

verify/yukicoder/3078.test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Problem: https://yukicoder.me/problems/no/3078

Depends on

• merge-sort tree (data_structure/merge_sort_tree.hpp)
• template/template.hpp

Code

#define PROBLEM "https://yukicoder.me/problems/no/3078"

#include "./../../template/template.hpp"
#include "./../../data_structure/merge_sort_tree.hpp"

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<ll> a(n);
	for(auto &x : a)cin >> x;
	merge_sort_tree<ll> mst(a);
	while(q--){
		int l, r;
		ll x;
		cin >> l >> r >> x;
		l--;
		ll cl = mst.count_less(l, r, x);
		ll sl = mst.sum_less(l, r, x);
		ll cr = mst.count_leq(l, r, x);
		ll sr = mst.sum_leq(l, r, x);
		cout << (sr-cr*x) + (cl*x-sl) << '\n';
	}
}

#line 1 "verify/yukicoder/3078.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/3078"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "data_structure/merge_sort_tree.hpp"

#line 5 "data_structure/merge_sort_tree.hpp"

template<typename T>
struct merge_sort_tree {
	int n;
	std::vector<std::vector<T>> x, cs;
	merge_sort_tree(const std::vector<T> &v) : n(std::ssize(v)) {
		x.resize(n*2);
		cs.resize(n*2);
		for(int i = 0;i < n;i++)x[n+i] = {v[i]}, cs[n+i] = {0, v[i]};
		for(int i = n-1;i > 0;i--){
			std::merge(x[i*2].begin(), x[i*2].end(), x[i*2 + 1].begin(), x[i*2 + 1].end(), std::back_inserter(x[i]));
			cs[i].resize(std::ssize(x[i]) + 1);
			for(int j = 0;j < std::ssize(x[i]);j++){
				cs[i][j+1] += cs[i][j] + x[i][j];
			}
		}
	}
	int count_less(int l, int r, T q) {
		l += n, r += n;
		int ret = 0;
		while(l < r) {
			if(l & 1){
				ret += std::lower_bound(x[l].begin(), x[l].end(), q) - x[l].begin();
				l++;
			}
			if(r & 1){
				r--;
				ret += std::lower_bound(x[r].begin(), x[r].end(), q) - x[r].begin();
			}
			l >>= 1, r >>= 1;
		}
		return ret;
	}

	int count_leq(int l, int r, T q) {
		l += n, r += n;
		int ret = 0;
		while(l < r) {
			if(l & 1){
				ret += x[l].end() - std::lower_bound(x[l].begin(), x[l].end(), q);
				l++;
			}
			if(r & 1){
				r--;
				ret += x[r].end() - std::lower_bound(x[r].begin(), x[r].end(), q);
			}
			l >>= 1, r >>= 1;
		}
		return ret;
	}

	T sum_less(int l, int r, T q) {
		l += n, r += n;
		T ret = 0;
		while(l < r) {
			if(l & 1){
				ret += cs[l][std::lower_bound(x[l].begin(), x[l].end(), q) - x[l].begin()];
				l++;
			}
			if(r & 1){
				r--;
				ret += cs[r][std::lower_bound(x[r].begin(), x[r].end(), q) - x[r].begin()];
			}
			l >>= 1, r >>= 1;
		}
		return ret;
	}

	T sum_leq(int l, int r, T q) {
		l += n, r += n;
		T ret = 0;
		while(l < r) {
			if(l & 1){
				ret += cs[l].back() - cs[l][std::lower_bound(x[l].begin(), x[l].end(), q) - x[l].begin()];
				l++;
			}
			if(r & 1){
				r--;
				ret += cs[r].back() - cs[r][std::lower_bound(x[r].begin(), x[r].end(), q) - x[r].begin()];
			}
			l >>= 1, r >>= 1;
		}
		return ret;
	}
};
#line 5 "verify/yukicoder/3078.test.cpp"

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<ll> a(n);
	for(auto &x : a)cin >> x;
	merge_sort_tree<ll> mst(a);
	while(q--){
		int l, r;
		ll x;
		cin >> l >> r >> x;
		l--;
		ll cl = mst.count_less(l, r, x);
		ll sl = mst.sum_less(l, r, x);
		ll cr = mst.count_leq(l, r, x);
		ll sr = mst.sum_leq(l, r, x);
		cout << (sr-cr*x) + (cl*x-sl) << '\n';
	}
}

Back to top page