Submission #1087371


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define X first
#define Y second
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,itit )  for( typeof(gg.begin()) itit=gg.begin();itit!=gg.end();itit++ )
#define mp make_pair
#define pb push_back
#define all(s) s.begin(),s.end()
#define present(c,x) ((c).find(x) != (c).end())
const double EPS = 1e-8;
const int mod = 1e9+7;
const int N = 1e6+10;
const ll INF = 1e18;

//#define DEBUG
ll power(ll x,ll y){
  ll t=1;
  while(y>0){
    if(y%2) y-=1,t=t*x%mod;
    else y/=2,x=x*x%mod;
  }
  return t;
}
#ifdef DEBUG
#define dprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#else
#define dprintf(fmt,...)
#endif

vector<pii> arr;
int cmp(pii a,pii b){
  return a.Y-a.X<b.Y-b.X;
}
ll dp[5005][5005];
int main(){
  int n; scanf("%d",&n); 
  if(n==1){
    printf("0\n"); exit(0);
  }
  REP(i,n){
    pii z; scanf("%d%d",&z.X,&z.Y); z.X=-z.X; arr.pb(z);
  }
  sort(all(arr),cmp);
  reverse(all(arr));
  int fl=1;
  REP(i,n-1) if(arr[i].X-arr[i].Y!=arr[i+1].X-arr[i+1].Y) fl=0;
  if(fl){
    assert(0);
    sort(all(arr));
    swap(arr[n/2],arr[n-1]);
  } 
  REP(i,n+1) REP(j,n+1)  dp[i][j]=INF;
  dp[0][0]=0;
  ll lk = -arr[n-1].X,rk=arr[n-1].Y;
  ll ans=INF;
  REP(i,n){
    ll ls = arr[i].X,rs=arr[i].Y;
    ll dis = rs-ls;
    
   // printf("%lld %lld\n",lk,rk);
    REP(j,i+1)if(dp[i][j]<INF){
    //  printf("%d %d %lld\n",i,j,dp[i][j]);
      dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(i-j)*dis+lk+rs);
      dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+j*dis+rk-ls);
    }
  }
  REP(i,n) ans=min(ans,dp[n-1][i]);
  printf("%lld\n",ans);
  return 0;
}

Submission Info

Submission Time
Task F - Intervals
User alecsyde
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1853 Byte
Status WA
Exec Time 263 ms
Memory 195968 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int n; scanf("%d",&n); 
                        ^
./Main.cpp:48:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     pii z; scanf("%d%d",&z.X,&z.Y); z.X=-z.X; arr.pb(z);
                                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 43
WA × 1
RE × 1
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 262 ms 195840 KB
001.txt AC 59 ms 43264 KB
002.txt AC 262 ms 195840 KB
003.txt WA 218 ms 164352 KB
004.txt AC 261 ms 195840 KB
005.txt AC 114 ms 84352 KB
006.txt AC 261 ms 195840 KB
007.txt AC 144 ms 107904 KB
008.txt AC 261 ms 195840 KB
009.txt AC 32 ms 23296 KB
010.txt AC 261 ms 195840 KB
011.txt AC 125 ms 93440 KB
012.txt AC 262 ms 195840 KB
013.txt AC 28 ms 19584 KB
014.txt AC 261 ms 195840 KB
015.txt AC 60 ms 43776 KB
016.txt AC 261 ms 195840 KB
017.txt AC 213 ms 161280 KB
018.txt AC 262 ms 195840 KB
019.txt AC 137 ms 102656 KB
020.txt AC 3 ms 256 KB
021.txt AC 2 ms 384 KB
022.txt RE 140 ms 384 KB
023.txt AC 260 ms 195840 KB
024.txt AC 262 ms 195968 KB
025.txt AC 261 ms 195840 KB
026.txt AC 261 ms 195840 KB
027.txt AC 262 ms 195840 KB
028.txt AC 263 ms 195840 KB
029.txt AC 260 ms 195840 KB
030.txt AC 261 ms 195840 KB
031.txt AC 262 ms 195840 KB
032.txt AC 261 ms 195840 KB
033.txt AC 262 ms 195840 KB
034.txt AC 260 ms 195840 KB
035.txt AC 261 ms 195840 KB
036.txt AC 261 ms 195840 KB
037.txt AC 261 ms 195840 KB
038.txt AC 261 ms 195840 KB
039.txt AC 262 ms 195840 KB
040.txt AC 262 ms 195840 KB
041.txt AC 261 ms 195840 KB
042.txt AC 261 ms 195840 KB
example0.txt AC 3 ms 256 KB
example1.txt AC 3 ms 384 KB