# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44554 | MatheusLealV | One-Way Streets (CEOI17_oneway) | C++17 | 404 ms | 34992 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 100050
#define logn 20
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
int q, n, m, dfsnum[N], dfslow[N], cnt, pai[N];
int dp[N], ans[N];
int solved[N];
vector<int> pontes;
map<pii, int> ccnt;
vector<pii> G[N], A, grafo[N];
void dfs(int x)
{
dfsnum[x] = dfslow[x] = ++cnt;
for(int i = 0; i< G[x].size(); i++)
{
int v = G[x][i].f, id = G[x][i].s;
if(!dfsnum[v])
{
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... |