# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260764 | test2 | One-Way Streets (CEOI17_oneway) | C++14 | 175 ms | 21364 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 I inline void
using namespace std ;
using ll = long long ;
using ld = long double ;
const int N = 1e5 + 7 ;
int n , m;
string ans ;
std::vector<pair<int , int > > adj[N];
int tim[N] ;
int t , tmr ;
int fat[N] , par[N] , fate[N] , h[N] ;
int st[N] , en[N] , a[N] , dir[N] ;
int up[N][18] ;
int cols[N] , col ;
bool upper(int u , int v){
return st[v] >= st[u] && en[v] <=en[u] ;
}
int fin(int x){
if(x == fat[x])return x ;
return fat[x] = fin(fat[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... |