Submission #1026633

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>

#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class A, size_t N, class T> void Fill(A (&a)[N], const T &v){ fill( (T*)a, (T*)(a+N), v ); }

const ll INF = 0x3fffffff;


int main(){
	//ios_base::sync_with_stdio(0);
	ll N, L, ans=1e18;
	ll a[200005], b[200005], c[200005];

	cin >> N >> L;
	rep(i,N) cin >> a[i] >> b[i] >> c[i];
	rep(i,N+2){
		a[i+N] = a[i] + L;
		b[i+N] = b[i];
		c[i+N] = c[i];
	}

	vector<ll> num(200005), len(200005);
	multimap<ll,ll> mp;
//	rep(k,N){
//		ll sum=0;
	ll k = 0;
		rep(i,N){
			len[i+1] = a[k+i+1] - a[k+i];
			num[i+1] = num[i] + (b[k+i] - c[k+i]);
//			sum += abs(num[i+1] * len[i+1]);
			mp.emplace( num[i+1], len[i+1] );
		}
//		chmin(ans, sum);
//	}

	ll bnum = mp.begin()->first;
	ll sum=0, sum_lenR = 0, sum_lenL = 0;
	for(auto p: mp){
		//cout << "mp " << p.first << " " << p.second << endl;
		sum += abs( (p.first - bnum) * p.second );
		sum_lenR += p.second;
	}
	//cout << sum << endl;
	chmin(ans, sum);
	for(auto p: mp){
		ll d = p.first - bnum;
		bnum = p.first;
		sum += d * (sum_lenL - sum_lenR);
		chmin(ans, sum);
		sum_lenR -= p.second;
		sum_lenL += p.second;
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result