# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
405683 | Hazem | One-Way Streets (CEOI17_oneway) | C++14 | 559 ms | 58520 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 LL long long
#define F first
#define S second
#define pii pair<int,int>
#define piii pair<pair<int,int>,int>
const int N = 3e5+10;
const int M = 3e2+10;
const LL INF = 1e9;
const LL LINF = 2e18;
const LL MOD = 1e9+7;
const double PI = 3.141592653589793;
map<pair<int,int>,char>mp;
map<pii,int>mp2;
vector<int>adj[N],adj2[N];
vector<pii>edges;
int val[N],vis[N],dp[N];
void dfs(int i,int pre){
for(auto x:adj[i]){
if(vis[x]){
if(x!=pre)
mp[{i,x}] = mp[{x,i}] = '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... |