Submission #85271


Source Code Expand

#include <cstdio>
#include <iostream>
#define FOR(i,a,b) for(i=a; i<=b; i++)
#define FOR2(i,n) FOR(i,0,n-1)
#define TFOR(i,a,b) for(i=a; i>=b; i--)
#define MIN(a,b) ( (a) < (b) ? (a) : (b) )
#define x first
#define y second
#define MAXN 20005
#define MAXK 2005
using namespace std;
typedef pair < int , int > pii;
inline int Abs( int a ) { return a > 0 ? a : -a; }
inline int Min( int a , int b ) { return a < b ? a : b; }
pii P[MAXN];
int X[2][MAXK] , Y[2][MAXK];
void solve()
{
	int N,i,j,k,cur(0),pre(1);
	scanf("%d",&N);
	FOR(i,0,2000) X[cur][i] = Y[cur][i] = Abs(1000 - i);

	P[0] = make_pair(1000,1000);

	FOR(i,1,N)
	{
		pre = !pre;
		cur = !cur;
		scanf("%d %d",&P[i].x,&P[i].y);
		P[i].x += 1000;
		P[i].y += 1000;

		FOR(j,0,2000)
				X[cur][j] = Min( X[pre][j] + Abs(P[i].x - P[i-1].x) , Y[pre][ P[i].x ] + Abs(P[i-1].y - j) );
		FOR(j,0,2000)
				Y[cur][j] = Min( Y[pre][j] + Abs(P[i].y - P[i-1].y) , X[pre][ P[i].y ] + Abs(P[i-1].x - j) );

	}

	int res(1000000000);

	FOR(i,0,2000)
		res = MIN( res , X[cur][i] );

	FOR(i,0,2000)
		res = MIN( res , Y[cur][i] );

	printf("%d\n" , res );


}
int main()
{
	solve();
	return 0;
}

Submission Info

Submission Time
Task 1 - Hermes
User harungunaydin
Language C++ (G++ 4.6.4)
Score 100
Code Size 1195 Byte
Status AC
Exec Time 227 ms
Memory 992 KB

Compile Error

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

Judge Result

Set Name Set01 Set02 Set03 Set04 Set05 Set06 Set07 Set08 Set09 Set10 Set11 Set12 Set13 Set14 Set15 Set16 Set17 Set18 Set19 Set20
Score / Max Score 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5 5 / 5
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
Set01 01
Set02 02
Set03 03
Set04 04
Set05 05
Set06 06
Set07 07
Set08 08
Set09 09
Set10 10
Set11 11
Set12 12
Set13 13
Set14 14
Set15 15
Set16 16
Set17 17
Set18 18
Set19 19
Set20 20
Case Name Status Exec Time Memory
01 AC 21 ms 908 KB
02 AC 21 ms 912 KB
03 AC 21 ms 924 KB
04 AC 21 ms 908 KB
05 AC 20 ms 908 KB
06 AC 20 ms 904 KB
07 AC 21 ms 912 KB
08 AC 20 ms 900 KB
09 AC 21 ms 992 KB
10 AC 21 ms 908 KB
11 AC 22 ms 904 KB
12 AC 24 ms 828 KB
13 AC 22 ms 908 KB
14 AC 23 ms 908 KB
15 AC 23 ms 896 KB
16 AC 30 ms 912 KB
17 AC 122 ms 912 KB
18 AC 172 ms 904 KB
19 AC 227 ms 912 KB
20 AC 69 ms 912 KB