# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119748 | dorijanlendvaj | Roller Coaster Railroad (IOI16_railroad) | C++14 | 1958 ms | 72016 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 x first
#define y second
#define pii pair<int,int>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int MOD=1000000007,N=400010;
const char en='\n';
const ll LLINF=1ll<<60;
int par[N];
ll ans;
unordered_map<int,int> ma;
int fin(int a)
{
if (a==par[a]) return a;
return par[a]=fin(par[a]);
}
void merge(int a,int b,int c)
{
a=fin(a);
b=fin(b);
if (a==b) return;
ans+=c;
par[a]=b;
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... |