| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 566772 | benjaminkleyn | Ideal city (IOI12_city) | C++17 | 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.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<int,int>, bool> exists;
map<pair<int,int>, int> node_of;
int size[100000];
int sub_size[100000] = {0};
bool vis[100000];
int dfs(pair<int,int> u)
{
vis[node_of[u]] = true;
int cur_x = u.first;
sub_size[node_of[u]] = size[node_of[u]];
while (exists[{++cur_x, u.second}]);
while (exists[{--cur_x, u.second}])
{
if (exists[{cur_x, u.second - 1}])
if (!vis[node_of[{cur_x, u.second - 1}]])
sub_size[node_of[u]] += dfs({cur_x, u.second - 1});
if (exists[{cur_x, u.second + 1}])
if (!vis[node_of[{cur_x, u.second + 1}]])
sub_size[node_of[u]] += dfs({cur_x, u.second + 1});
}
return sub_size[node_of[u]];
}
int solve(int N, int *X, int *Y)
{
exists.clear();
node_of.clear();
for (int i = 0; i < N; i++)
exists[{X[i], Y[i]}] = true;
int node = -1;
for (int i = 0; i < N; i++)
{
if (node_of[{X[i], Y[i]}] != 0) continue;
node_of[{X[i], Y[i]}] = ++node;
int cur_x = X[i];
while (exists[{--cur_x, Y[i]}])
node_of[{cur_x, Y[i]}] = node;
cur_x = X[i];
while (exists[{++cur_x, Y[i]}])
node_of[{cur_x, Y[i]}] = node;
}
memset(size, 0, node);
memset(sub_size, 0, node);
memset(vis, false, node);
for (int i = 0; i < N; i++)
size[node_of[{X[i], Y[i]}]]++;
dfs({X[0], Y[0]});
ll res = 0;
for (int i = 0; i < node; i++)
res += sub_size[i] * (N - sub_size[i]);
return res;
}
int DistanceSum(int N, int *X, int *Y)
{
return solve(N, X, Y) + solve(N, Y, X);
}