Cod sursa(job #1357301)
Utilizator | Paula Nicoleta Gradu Pauey | Data | 23 februarie 2015 21:09:22 |
---|---|---|---|
Problema | Inundatii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <cmath>
#include <fstream>
#include <iostream>
using namespace std;
const int MAXN = 50005;
int X[MAXN], Y[MAXN], Z[MAXN];
int main()
{
ifstream cin("inundatii.in");
ofstream cout("inundatii.out");
int N;
long long ans = 0;
cin >> N;
for(int i = 1; i <= N; ++i)
cin >> X[i] >> Y[i] >> Z[i];
for(int i = 1; i <= N; ++i) {
ans += abs(X[i] - (X[N / 2] - N / 2 + i));
ans += abs(Y[i] - (Y[N / 2] - N / 2 + i));
ans += abs(Z[i] - (Z[N / 2] - N / 2 + i));
}
cout << ans;
return 0;
}