# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386357 | FatihSolak | Pipes (CEOI15_pipes) | C++17 | 1377 ms | 65536 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 N 100005
using namespace std;
int par[N][2];
int find(int a,int val){
if(par[a][val] == a)return a;
return par[a][val] = find(par[a][val],val);
}
vector<int> adj[N];
bool merge(int a,int b,int val){
int tmp1 = a,tmp2 = b;
a = find(a,val);
b = find(b,val);
if(a == b)return 0;
par[a][val] = b;
adj[tmp1].push_back(tmp2);
adj[tmp2].push_back(tmp1);
return 1;
}
int n;
vector<bool> visited(N);
vector<int> tin(N), low(N);
int timer;
void IS_BRIDGE(int v,int a){
cout << v << " " << a << endl;
}
void dfs(int v, int p = -1) {
visited[v] = true;
tin[v] = low[v] = timer++;
for (int to : adj[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... |
# | 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... |