Submission #1163342

#TimeUsernameProblemLanguageResultExecution timeMemory
1163342HappyCapybaraIdeal city (IOI12_city)C++20
0 / 100
18 ms1096 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long int DistanceSum(int N, int *X, int *Y){ map<int,int> rows, cols; for (int i=0; i<N; i++){ rows[X[i]]++; cols[Y[i]]++; } ll res = 0; int cur = 0, cl = 0; for (auto [r, x] : rows){ cur += x*(r-rows.begin()->first); cl += x; } for (auto [r, x] : rows){ res += x*cur; cl -= x; cur -= cl; } cur = 0; cl = 0; for (auto [c, x] : cols){ cur += x*(c-cols.begin()->first); cl += x; } for (auto [c, x] : cols){ res += x*cur; cl -= x; cur -= cl; } return res % 1000000000; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...