Submission #3557196

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int N, L[100009], R[100009];
ll dp[1009][1009];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>N;
    if(N>400) return 0;
    rep(i,N){ cin>>L[i]>>R[i]; if(L[i]>400||R[i]>400) return 0;}
    
    rep(i,401) dp[0][i] = abs(i-L[0]);
    rep1(i,N-1){
        rep(j,401){
            ll mn=LLINF;
            for(int k=max(0,j-(R[i-1]-L[i-1]));k<=min(400,j+(R[i]-L[i]));k++){
                mn = min(mn,dp[i-1][k]);
            }
            dp[i][j] = abs(j-L[i]) + mn;
        }
    }
    
    ll ans=LLINF;
    rep(i,401){
        ans = min(ans,dp[N-1][i]);
    }
    cout1(ans);
}

Submission Info

Judge Result