# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24233 | Hiasat | Ideal city (IOI12_city) | C++14 | 99 ms | 9244 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;
typedef pair<int,int> pii;
pii p[100001],mv[4] = {make_pair(0,-1),make_pair(0,1),make_pair(-1,0),make_pair(1,0)};
int dsu[100001],n,sz[100001],dp[100001];
map< pii , int > mp,edge;
vector<int> adj[100001];
ll fn = 0;
int find(int u){
return u == dsu[u] ? u : dsu[u] = find(dsu[u]);
}
void pre(int u , int p){
dp[u] = sz[u];
for (int i = 0; i < adj[u].size(); ++i){
int v = adj[u][i];
if(v == p)
continue;
pre(v,u);
dp[u] += dp[v];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |