# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226516 | MKopchev | Senior Postmen (BOI14_postmen) | C++14 | 503 ms | 63812 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;
const int nmax=5e5+42;
int n,m;
vector< pair<int,int> > adj[nmax];
int pointer[nmax];
vector<int> outp;
bool blocked[nmax];
void tour(int node)
{
for(;pointer[node]<adj[node].size();pointer[node]++)
if(blocked[adj[node][pointer[node]].second]==0)
{
blocked[adj[node][pointer[node]].second]=1;
tour(adj[node][pointer[node]].first);
}
outp.push_back(node);
}
vector<int> current;
int lst_seen[nmax];
void add(int val)
{
lst_seen[val]=current.size();
current.push_back(val);
}
int main()
{
scanf("%i%i",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%i%i",&u,&v);
adj[u].push_back({v,i});
adj[v].push_back({u,i});
}
tour(1);
memset(lst_seen,-1,sizeof(lst_seen));
/*
cout<<outp.size()<<endl;
for(auto k:outp)cout<<k<<" ";cout<<endl;
*/
for(int i=0;i<outp.size();i++)
{
if(lst_seen[outp[i]]==-1)
{
add(outp[i]);
continue;
}
vector<int> help={};
int pos=i;
while(current.back()!=outp[i])
{
help.push_back(current.back());
lst_seen[current.back()]=-1;
current.pop_back();
}
help.push_back(current.back());
lst_seen[current.back()]=-1;
current.pop_back();
//cout<<"i= "<<i<<" -> ";
for(auto k:help)
printf("%i ",k);
printf("\n");
add(outp[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... |