Pagini recente » Cod sursa (job #2787970) | Cod sursa (job #3216144) | Cod sursa (job #236561) | Cod sursa (job #558421) | Cod sursa (job #3128152)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("tribute.in") ;
ofstream fout ("tribute.out") ;
long long n , test , Minf = 50000000 , dx , dy , v[50003][2] , MaxX , MinX , MaxY , MinY , Mint , Min1 ;
long i , j , k ;
int main()
{
fin >> n ;
fin >> dx >> dy ;
for ( i = 1 ; i <= n ; i ++ )
{
fin >> v[i][1] >> v[i][2] ;
MaxX = max( MaxX , v[i][1] ) ;
MinX = min( MinX , v[i][1] ) ;
MaxY = max( MaxY , v[i][2] ) ;
MinY = min( MinY , v[i][2] ) ;
}
for ( i = MinY ; i <= MaxY - dy; i ++ )
{
for ( j = MinX ; j <= MaxX - dx ; j ++ )
{
for ( k = 0 ; k <= n ; k ++ ){
Min1 = 0 ;
test = v[k][1] - i + v[k][2] - j ;
if ( test > 0 ) Min1 = test;
test = v[k][1] - i + dy + v[k][2] - j ;
if ( test < Min1 && test > 0 )
Min1 = test;
test = v[k][1] - i + v[k][2] - j + dx ;
if ( test < Min1 && test > 0 )
Min1 = test;
test = v[k][1] - i + v[k][2] - j + dx + dy ;
if ( test < Min1 && test > 0 )
Min1 = test;
Mint = Min1 + Mint ;
cout << Mint << " " ;
}
cout << '\n' ;
if ( Mint < Minf ) Minf = Mint ;
}
}
fout << Minf ;
return 0;
}