| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 523291 | MilosMilutinovic | Ideal city (IOI12_city) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//todo
#include <bits/stdc++.h>
using namespace std;
const int N = 100050;
int hP[N];
int vP[N];
int szH[N];
int szV[N];
int DistanceSum(int n int *X, int *Y) {
map<int, vector<pair<int, int>> x;
map<int, vector<pair<int, int>> y;
for (int i = 0; i < n; i++) {
x[X[i]].push_back({y[i], i});
y[Y[i]].push_back({x[i], i});
}
vector<int> V;
vector<int> H;
for (auto v : x) {
auto vec = v.second;
sort(vec.begin(), vec.end());
int sz = (int)vec.size();
for (int i = 0; i < sz; i++) {
H.push_back(vec[i].second);
int ptr = i;
while(ptr + 1 < sz && vec[ptr + 1].first == vec[ptr].first + 1) {
ptr += 1;
}
for (int j = i; j <= ptr; j++) {
hP[vec[j].second] = vec[i].second;
szH[i] += 1;
}
i = ptr;
}
}
for (auto v : y) {
auto vec = v.second;
sort(vec.begin(), vec.end());
int sz = (int)vec.size();
for (int i = 0; i < sz; i++) {
V.push_back(vec[i].second);
int ptr = i;
while(ptr + 1 < sz && vec[ptr + 1].first == vec[ptr].first + 1) {
ptr += 1;
}
for (int j = i; j <= ptr; j++) {
vP[vec[j].second] = vec[i].second;
szV[i] += 1;
}
i = ptr;
}
}
}
int main()
{
return 0;
}