# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419648 | VladM | Senior Postmen (BOI14_postmen) | C++14 | 548 ms | 125056 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;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
int u, v, n, m;
vector<int> par, vis;
vector<set<int> > vec;
void dfs(int v)
{
vis[v]=1;
for(auto to : vec[v])
{
if(to==par[v]) continue;
if(vis[to]==1)
{
vec[v].erase(to);
vec[to].erase(v);
while(v!=to)
{
int p=par[v];
printf("%d ", v);
vec[v].erase(p);
vec[p].erase(v);
vis[v]=0;
par[v]=0;
v=p;
}
printf("%d\n", v);
if(!vec[v].empty()) dfs(v);
}
else
{
par[to]=v;
dfs(to);
}
break;
}
return;
}
int main()
{
scanf("%d%d", &n, &m);
vec.resize(n+1);
par.resize(n+1);
vis.resize(n+1);
for(int i=1; i<=m; i++)
{
scanf("%d%d", &u, &v);
if(vec[v].find(u)!=vec[v].end())
{
printf("%d %d\n", u, v);
vec[u].erase(v);
vec[v].erase(u);
}
else
{
vec[u].insert(v);
vec[v].insert(u);
}
}
for(int i=1; i<=n; i++)
{
if(vec[i].size()!=0)
{
dfs(i);
}
}
return 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... |