# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128611 | faustaadp | One-Way Streets (CEOI17_oneway) | C++17 | 301 ms | 44408 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>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,m,p,i,x[101010],y[101010],X[101010],Y[101010],j,te,JK;
vector<ll> v[101010],w[101010],V[101010],isi[101010],W[101010];
ll b[101010];
ll nm[101010];
ll Z[101010];
ll br[101010];
ll wk[101010];
ll mi[101010];
ll bes[101010];
string s;
pair<ll,ll> P[101010];
void dfs(ll aa,ll bb)
{
te++;
wk[aa]=te;
mi[aa]=te;
b[aa]=1;
ll ii;
for(ii=0;ii<v[aa].size();ii++)
{
if(abs(w[aa][ii])==bb)continue;
if(b[v[aa][ii]]==0)
{
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... |