# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115964 | Mahdi_Jfri | Senior Postmen (BOI14_postmen) | C++14 | 157 ms | 262148 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 pb push_back
const int maxn = 5e5 + 20;
vector<int> path;
stack<int> adj[maxn];
int from[maxn] , to[maxn];
bool visited[maxn];
void dfs(int v)
{
while(!adj[v].empty())
{
int e = adj[v].top() , u = from[e] ^ to[e] ^ v;
adj[v].pop();
if(visited[e])
continue;
visited[e] = 1;
dfs(u);
}
path.pb(v);
}
int main()
{
int n , m;
scanf("%d%d", &n, &m);
for(int i = 0; i < m; i++)
{
int a , b;
scanf("%d%d", &a, &b);
a-- , b--;
adj[a].push(i);
adj[b].push(i);
from[i] = a , to[i] = b;
}
dfs(0);
vector<int> tmp;
memset(visited , 0 , sizeof visited);
for(auto v : path)
{
if(visited[v])
{
while(tmp.back() != v)
{
printf("%d ", tmp.back() + 1);
visited[tmp.back()] = 0;
tmp.pop_back();
}
tmp.pop_back();
printf("%d\n", v + 1);
}
tmp.pb(v);
visited[v] = 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... |