# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303940 | peuch | One-Way Streets (CEOI17_oneway) | C++17 | 6 ms | 9728 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;
const int MAXN = 100010;
int n, m, p;
int low[MAXN], pre[MAXN];
int cnt;
int bridge[MAXN];
pair<int, int> edge[MAXN];
int rep[MAXN], tam[MAXN];
int auxSum[MAXN];
int ans[MAXN];
vector<int> ar[MAXN], id[MAXN];
vector<int> tree[MAXN], treeID[MAXN];
void dfs(int cur, int pai);
void uni(int a, int b);
int find(int a);
void endCalc(int cur, int pai);
int main(){
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++) rep[i] = i, tam[i] = 1;
for(int i = 1; i <= m; i++){
int a, b;
scanf("%d %d", &a, &b);
ar[a].push_back(b);
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... |