# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439200 | FSYo | Fountain Parks (IOI21_parks) | C++17 | 803 ms | 138480 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>
#include "parks.h"
#define cs const
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pi;
cs int N = 4e5 + 5;
int n, fa[N];
map<int, int> c[N], e[N];
vector<pi> E;
int fnd(int x) {
if(x == fa[x]) return x;
return fa[x] = fnd(fa[x]);
}
void mer(int a, int b) {
if(a < 0) return;
if(fnd(a) == fnd(b)) return;
E.pb(pi(a, b));
e[a][b] = e[b][a] = E.size() - 1;
fa[fnd(a)] = fnd(b);
}
vector<int> G[N];
int dfn[N], low[N], tim;
int s[N], top, in[N], blk[N], m;
void dfs(int x) {
dfn[x] = low[x] = ++ tim;
s[++top] = x, in[x] = 1;
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... |