Pagini recente » Cod sursa (job #286239) | Cod sursa (job #1122959) | Cod sursa (job #1699015) | Cod sursa (job #1083109) | Cod sursa (job #126313)
Cod sursa(job #126313)
#include <cstdio>
const int maxn = 50001;
FILE *in = fopen("inundatii.in","r"), *out = fopen("inundatii.out","w");
int n;
int x[maxn], y[maxn], z[maxn];
int p[maxn], q[maxn], r[maxn];
void read()
{
fscanf(in, "%d", &n);
for ( int i = 1; i <= n; ++i )
fscanf(in, "%d %d %d", &x[i], &y[i], &z[i]);
}
void go(int a[], int b[])
{
for ( int i = 1; i <= n; ++i )
b[i] = a[i] - i;
int m = n % 2 == 0 ? (a[n/2] + a[n/2+1]) / 2 : a[n/2+1];
//int m = b[n/2];
for ( int i = 1; i <= n; ++i )
b[i] = m + i;
}
int myabs(int x)
{
return x < 0 ? -x : x;
}
int main()
{
read();
go(x, p);
go(y, q);
go(z, r);
int s = 0;
for ( int i = 1; i <= n; ++i )
s = s + myabs(x[i] - p[i]) + myabs(y[i] - q[i]) + myabs(z[i] - r[i]);
fprintf(out, "%d\n", s);
return 0;
}