Submission #2072294

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define INF 1e+18
using namespace std;

signed main(){
	int n,l,a[5000],b[5000],c[5000],mi = INF;
	cin >> n >> l;
	if(n > 5000) return 0;
	for(int i = 0;i < n;i++) cin >> a[i] >> b[i] >> c[i];
	for(int i = 0;i < n;i++){
		int ans = 0,tmp = 0;
		for(int j = 0;j < n;j++){
			int d = a[(i + j + 1) % n] - a[(i + j) % n];
			if(d < 0) d += l;
			tmp += b[(i + j) % n] - c[(i + j) % n];
			ans += abs(tmp) * d;
		}
		mi = min(mi,ans);
	}
	cout << mi << endl;
	return 0;
}

Submission Info

Judge Result