9.19 ICPC网络赛 Problem D. Edge of Taixuan

Problem D. Edge of Taixuan

区间赋值问题。
每次操作的费用是(r-l+1)*(r-l) / 2，先求出操作需要的总费用，再减去每个点所需要的最小值，得到的结果就是答案。
优先考虑用线段树（但我不会 ）。维护一个优先队列也可以解决这个问题。

#include<bits/stdc++.h>
#define eps 1e-9
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
//	clock_t c1 = clock();
//	std::cerr << "Time:" << clock() - c1 << "ms";
//	freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);

typedef long double llb;
typedef long long ll;
const int maxn = 1e5+10;
const int mod = 1e9+7;

vector<ll> a1[maxn], a2[maxn];
ll arr[maxn];
void solve(int _t){
	memset(a1,0,sizeof(a1));
	memset(a2,0,sizeof(a2));
	memset(arr,0,sizeof(arr));
	ll n, m, l, r, v;
	cin >> n >> m;
	llb ans = 0;
	for(int i = 1; i<=m; i++){
		cin >> l >> r >> v;
		a1[l+1].push_back(v);
		a2[r+1].push_back(v);
		ans += (r-l+1)*(r-l)/2*v;
	}
	ll c = 0; 
	priority_queue<int, vector<int>, greater<int> > que1, que2;
	for(int i = 2; i<=n; i++){
		for(int j = 0; j<a1[i].size(); j++) que1.push(a1[i][j]);
		for(int j = 0; j<a2[i].size(); j++) que2.push(a2[i][j]);
		while(que1.size() > 0 && que2.size()>0 && que1.top() == que2.top()){
			que1.pop(); que2.pop();
		}
		if(que1.size()>0) c++, arr[i] = que1.top();
	}
	printf("Case #%d: ", _t);
	if(c!=n-1){
		printf("Gotta prepare a lesson\n");
	}else{
		for(int i = 2; i<=n; i++) ans -= arr[i];
		printf("%.0Lf\n", ans);
	}
}

int main(){
	io;
	int t;
	cin >> t;
	for(int i = 1; i<=t; i++) solve(i);
}