# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137189 | owoovo | Roller Coaster Railroad (IOI16_railroad) | C++20 | 192 ms | 20680 KiB |
#include "railroad.h"
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
using namespace std;
const int maxn=1e9+10;
int dsu[4000010];
vector<int> s,t;
int f(int a){
if(dsu[a]==a)return a;
dsu[a]=f(dsu[a]);
return dsu[a];
}
bool onion(int a,int b){
a=f(a);
b=f(b);
if(a==b)return 0;
dsu[a]=b;
return 1;
}
ll plan_roller_coaster(vector<int> S, vector<int> T) {
int n = (int) S.size();
ll ans=0;
s=S,t=T;
vector<int> use;
s.push_back(maxn);
t.push_back(0);
for(int i=0;i<=n;i++){
use.push_back(t[i]);
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... |