Submission #1025551

---

Source Code Expand

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;

ll solve(vector<pii> ps){
  int n=ps.size();
  int sum=0;
  ll re=0;
  rep(i,n-1){
    sum+=ps[i].Y;
    re+=1ll*abs(ps[i].X-ps[i+1].X)*abs(sum);
  }
  //cout<<re<<ps;
  return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n,l;
  cin>>n>>l;
  vector<pii> ps;
  rep(i,n){
    int x,y,z;
    cin>>x>>y>>z;
    if(y!=z) ps.eb(x,y-z);
  }
  //cout<<ps;
  n=ps.size();

  ll re=1e15;
  rep(ind,n){
    vector<pii> vs;
    reps(i,ind,n) vs.pb(ps[i]);
    rep(i,ind) vs.eb(ps[i].X+l,ps[i].Y);
    MN(re,solve(vs));
  }
  cout<<re<<endl;
  return 0;
}

Submission Info

Judge Result