# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408953 | Tc14 | Split the Attractions (IOI19_split) | C++17 | 134 ms | 24880 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.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "split.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;
int n, cnt;
bool found, sol;
pii x, y, z;
tuple<int, int, int> bottom, top;
ve<int> Num, Low, Size;
ve<bool> B;
ve<ve<int>> G, C;
void dfs(int u, int p) {
cnt++;
Num[u] = cnt;
Low[u] = cnt;
Size[u] = 1;
bool valid = true;
for (int v : G[u]) {
if (Num[v] == 0) {
dfs(v, u);
Low[u] = min(Low[u], Low[v]);
# | 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... |