# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165461 | AlgorithmWarrior | One-Way Streets (CEOI17_oneway) | C++20 | 133 ms | 28928 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=1e5+5;
int const LOG=20;
int n,m;
struct edge{
int u,v;
}edges[MAX];
struct muchie{
int vec,id;
};
vector<muchie>tree[MAX];
int h[MAX],low[MAX];
vector<int>critical_edges;
bool viz[MAX];
stack<int>stv;
int grp[MAX];
int total_nodes;
vector<muchie>comp_tree[MAX];
int lift[MAX][LOG];
int up[MAX],down[MAX];
char ans[MAX];
void read(){
cin>>n>>m;
int i;
for(i=1;i<=m;++i){
int u,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... |