# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984329 | michified | Split the Attractions (IOI19_split) | C++17 | 178 ms | 50848 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>
#define ll long long
using namespace std;
struct node_t {
int ord, low, ss, par;
vector<int> adj, childs;
unordered_set<int> used;
};
vector<node_t> nodes;
vector<int> thing, ord2id, ans;
int lo, t = 0, n, remain;
bool good = true;
pair<int, int> found = {-1, -1};
void dfs(int cur, int par) {
if (not good) return;
node_t& u = nodes[cur];
u.par = par;
t++;
u.ord = u.low = t;
u.ss = 1;
ord2id[t] = cur;
for (int v : u.adj) {
if (not nodes[v].ord) {
dfs(v, cur);
u.low = min(u.low, nodes[v].low);
u.used.insert(v);
nodes[v].used.insert(cur);
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... |