Pagini recente » Cod sursa (job #1229592) | Cod sursa (job #2563496) | Cod sursa (job #348735) | Cod sursa (job #920032) | Cod sursa (job #125977)
Cod sursa(job #125977)
#include <stdio.h>
#include <vector>
using namespace std;
#define in "inundatii.in"
#define out "inundatii.out"
#define dim 50001
int N;
int X[dim], Y[dim], Z[dim];
inline int Abs(int A, int B) {
if ( A < B ) return B - A;
return A - B;
}
int main()
{
int Cn1 = 0, Cn2 = 0, Cn3 = 0, Total = 0;
freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d", &N);
for ( int i = 1; i <= N; i++ )
{
scanf("%d%d%d", &X[i], &Y[i], &Z[i]);
Cn1 += X[i], Cn2 += Y[i], Cn3 += Z[i];
}
if ( N == 1 )
{
printf("0");
return 0;
}
Cn1 /= N, Cn2 /= N, Cn3 /= N;
Cn1 -= 1;
Cn2 -= 1;
Cn3 -= 1;
//Cn1 = (X[1]+X[N]) / 2;
//Cn2 = (Y[1]+Y[N]) / 2;
//Cn3 = (Z[1]+Z[N]) / 2;
for ( int i = 1; i <= N; i++ )
{
Total += Abs(X[i],Cn1);
Total += Abs(Y[i],Cn2);
Total += Abs(Z[i],Cn3);
X[i] = Cn1, Y[i] = Cn2, Z[i] = Cn3;
++Cn1, ++Cn2, ++Cn3;
}
// for ( int i = 1; i <= N; i++ )
// printf("%d %d %d\n", X[i], Y[i], Z[i]);
printf("%d", Total);
return 0;
}