Submission #76721

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#define REP(i,m) for(int i=0;i<m;++i)
#define REPN(i,m,in) for(int i=in;i<m;++i)
#define ALL(t) (t).begin(),(t).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
using namespace std;
static const int INF =500000000; 
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
typedef long long int lint;
typedef pair<int,int> pi;
int n;
pi p[20005];
int dp[2][2][2005];
inline void chmin(int& a,int b){
	if(a>b) a=b;
}

int main(){
	scanf("%d",&n);
	REP(i,n) scanf("%d%d",&p[i].fr,&p[i].sc);
	REP(i,2005) REP(j,2) dp[0][j][i]=INF;
	dp[0][0][1000]=abs(p[0].sc);
	dp[0][1][1000]=abs(p[0].fr);
	REP(i,n) p[i]=mp(p[i].fr+1000,p[i].sc+1000);
	int cur=0,nxt=1;
	REP(i,n-1){
		int dif1=abs(p[i+1].sc-p[i].sc),dif2=abs(p[i+1].fr-p[i].fr);
		REP(j,2005){
			dp[nxt][0][j]=dp[cur][0][j]+dif1;
			dp[nxt][1][j]=dp[cur][1][j]+dif2;
		}
		REP(j,2005){
			if(dp[cur][0][j]+abs(p[i+1].fr-j)<dp[nxt][1][p[i].sc])
				dp[nxt][1][p[i].sc]=dp[cur][0][j]+abs(p[i+1].fr-j);
		}
		REP(j,2005){
			if(dp[cur][1][j]+abs(p[i+1].sc-j)<dp[nxt][0][p[i].fr])
				dp[nxt][0][p[i].fr]=dp[cur][1][j]+abs(p[i+1].sc-j);
		}
		swap(cur,nxt);
	}
	int res=INF;
	REP(i,2005) chmin(res,min(dp[cur][0][i],dp[cur][1][i]));
	printf("%d\n",res);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:29:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result