Pagini recente » Cod sursa (job #197605) | Cod sursa (job #2527691) | Cod sursa (job #1950295) | Cod sursa (job #344780) | Cod sursa (job #125341)
Cod sursa(job #125341)
#include <stdio.h>
#include <stdlib.h>
#define maxn 50010
#define ll long long
ll sol;
int n;
int x[maxn],y[maxn],z[maxn];
ll solve(int a[])
{
int i, x = n/2 + (n&1);
ll rez = 0;
for (i=1;i<=n;i++)
rez += abs(a[i] - a[x]) + abs(i - x);
return rez;
}
int main()
{
freopen("inundatii.in","r",stdin);
freopen("inundatii.out","w",stdout);
scanf("%d ",&n);
int i;
for (i=1;i<=n;i++) scanf("%d %d %d ",&x[i],&y[i],&z[i]);
sol = solve(x);
sol += solve(y);
sol += solve(z);
printf("%lld\n",sol);
return 0;
}