Submission #1177355

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const int mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int n;
int l[400],r[400];
int dp[2][401][401];

int main(){
    cin >> n;
    if (n>400) return 0;
    rep(i,n) cin >> l[i] >> r[i];
    rep(i,2)rep(j,401)rep(k,401) dp[i][j][k]=INF;
    rep2(j,1,401){
        int w=r[0]-l[0];
        if (j+w>400) break;
        dp[1][j][j+w]=abs(l[0]-j);
    }
    rep2(i,1,n){
        rep(j,401)rep(k,401){
            dp[(i+1)%2][j][k]=INF;
        }
        rep(j,401)rep(k,401){
            int w=r[i]-l[i];
            if (k<l[i]){
                dp[(i+1)%2][k][k+w]=min(dp[(i+1)%2][k][k+w],dp[i%2][j][k]+l[i]-k);
            }
            else if (r[i]<j){
                dp[(i+1)%2][j-w][j]=min(dp[(i+1)%2][j-w][j],dp[i%2][j][k]+j-r[i]);
            }
            else{
                dp[(i+1)%2][j][k]=min(dp[(i+1)%2][j][k],dp[i%2][j][k]);
            }
        }
    }
    int ans=INF;
    int w=r[n-1]-l[n-1];
    rep(j,400){
        if (j+w>400) break;
        ans=min(ans,dp[n%2][j][j+w]);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result