# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73287 | Sa1378 | Simurgh (IOI17_simurgh) | C++17 | 218 ms | 7092 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 "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define N ((int)510)
#define M ((int)151*1000)
int n,m;
pair <int,int> ed[M];
vector <int> e[N],edges,ed_id;
bool ans[M],mark[N];
void dfs(int x,int v)
{
mark[x]=1;
for(auto u:e[v])
if(ed[u].first+ed[u].second-v==x)
{
ed_id.push_back(u);
break;
}
for(auto u:e[x])
{
int p=ed[u].first+ed[u].second-x;
if(!mark[p])
{
edges.push_back(u);
dfs(p,v);
}
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |