# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437652 | Pajaraja | Fountain Parks (IOI21_parks) | C++17 | 696 ms | 44124 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 "parks.h"
#include <bits/stdc++.h>
#define MAXN 200007
using namespace std;
map<pair<int,int>,int> ind;
std::vector<int> u, v, a, b, x, y, nd;
int dsu[MAXN];
int root(int u)
{
while(dsu[u]!=u)
{
dsu[u]=dsu[dsu[u]];
u=dsu[u];
}
return u;
}
void connect(int u,int v)
{
int a=root(u),b=root(v);
if(a==b) return;
dsu[a]=b;
}
bool cmp(int p,int q) {return x[p]+y[p]>x[q]+y[q];}
void addroad(int p,int q)
{
int x1=x[p],y1=y[p],x2=x[q],y2=y[q];
u.push_back(p); v.push_back(q);
connect(p,q);
if(x1==x2)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |