# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152720 | Mercenary | One-Way Streets (CEOI17_oneway) | C++14 | 297 ms | 23260 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 taskname "A"
#define pb push_back
#define mp make_pair
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long double ld;
typedef long long ll;
typedef pair<int,int> ii;
const int maxn = 1e5 + 5;
int n, m , p;
struct edge{
int used , u , v , col;
}e[maxn];
vector<int> adj[maxn];
int num[maxn] , low[maxn];
static int nTime = 0 , nGroup = 0;
void DFS(int u){
low[u] = num[u] = ++nTime;
for(int c : adj[u]){
if(e[c].used)continue;
e[c].used = 1;
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... |