# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67057 | moonrabbit2 | Roller Coaster Railroad (IOI16_railroad) | C++17 | 1730 ms | 225276 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 "railroad.h"
#include <bits/stdc++.h>
#define N 500005
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct edge{ll c;int u,v;};
int n,c,group[N],c_g,p[N],en,x;
ll ans,sum[N],from[N];
map<int,int> mp,to;
vector<int> g1[N];
edge g2[N];
int fi(int x)
{
if(p[x]==x)
return x;
return p[x]=fi(p[x]);
}
void un(int x,int y)
{
x=fi(x),y=fi(y);
if(x==y)
return;
p[y]=x;
}
void dfs(int curr)
{
group[curr]=c_g;
# | 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... |