# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255695 | tincamatei | Parachute rings (IOI12_rings) | C++14 | 1552 ms | 219592 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>
const int MAX_N = 1000000;
struct DSU {
int N;
int sef[MAX_N], grad[MAX_N], rank[MAX_N], size[MAX_N];
bool ignore[MAX_N];
enum ProblemState {
ONLY_CYCLES, // Am doar lanturi sau ciclii, tb doar sa vedem daca avem un singur ciclu
CRITICAL_NODES, // Am noduri de grade mai mari sau egale cu 3
// vedem ce se intampla daca excludem cate un nod critic, sa nu avem cicluri
// sau alte noduri cu grad mai mare ca 3
NOTHING // Raspunsul va fi 0 pentru totdeauna
} state;
int sizeCycle, cntCycle, gg3;
std::vector<std::pair<int*, int> > history;
std::vector<int> criticalNodes;
std::vector<std::pair<int, int> > edges;
std::vector<int> graph[MAX_N];
void setSize(int _N) {
state = ONLY_CYCLES;
N = _N;
reset();
}
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... |