Submission #85261

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<list>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<climits>
#include<ctime>
#include<sstream>
#define mp       make_pair
#define pb       push_back
#define st       first
#define nd       second
#define wait     system("pause");
#define lint     long long int
#define KARE(a)	 ( (a)*(a) )
#define MAX(a,b) ( (a)>(b) ? (a) : (b) )
#define MIN(a,b) ( (a)<(b) ? (a) : (b) )
#define INF		   INT_MAX
#define ii       pair<int,int>
#define EPS      (1e-7)
#define ZERO(k)  ( abs(k)<(EPS) )
#define mxn       20005
using namespace std;

int N;
ii dp[2][2005],K[mxn];

void read(){

  scanf( "%d" , &N );

  for( int i=1 ; i<=N ; i++ )
      scanf( "%d %d" , &K[i].st , &K[i].nd ),
      K[i].st += 1000,
      K[i].nd += 1000;
}

void fill(){

  K[0].st = K[0].nd += 1000;

  for( int i=0 ; i<2001 ; i++ )
    dp[0][i].st = dp[0][i].nd = abs( 1000 - i );
}

void solve(){
  int i,a,b,j,res=INF;

  fill();

  for( i=1 ; i<=N ; i++ ){
    a = i&1;
    b = !a;
    for( j=0 ; j<2001 ; j++ ){

      dp[a][j].st = MIN( dp[b][j].st + abs( K[i-1].st - K[i].st ) , dp[b][ K[i].st ].nd + abs( K[i-1].nd - j ) );
      dp[a][j].nd = MIN( dp[b][j].nd + abs( K[i-1].nd - K[i].nd ) , dp[b][ K[i].nd ].st + abs( K[i-1].st - j ) );

    }
  }

  a = N&1;

  for( i=0 ; i<2001 ; i++ )
    res = MIN( res , MIN( dp[a][i].st , dp[a][i].nd ) );
  cout<<res<<endl;

}

int main(){
	read();
	solve();
}

Submission Info

Compile Error

./Main.cpp: In function ‘void read()’:
./Main.cpp:39:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:44:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result