# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44655 | bogdan10bos | One-Way Streets (CEOI17_oneway) | C++14 | 251 ms | 57428 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>
using namespace std;
//#define FILE_IO
typedef pair<int, int> pii;
pii edge[100005];
int N, M, K;
int node[100005];
char r[100005];
namespace BiconnexGraph
{
int h[100005], low[100005], f[100005];
bool vis[100005], crit[100005];
vector<int> edg[100005];
void addEdge(int id)
{
int x = edge[id].first, y = edge[id].second;
edg[x].push_back(id);
edg[y].push_back(id);
}
int F(int x)
{
if(f[x] == x) return x;
return f[x] = F(f[x]);
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... |