# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
11589 | gs14004 | Senior Postmen (BOI14_postmen) | C++98 | 1092 ms | 7792 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 <cstdio>
#include <vector>
#include <cstring>
using namespace std;
int n,m;
int st[1000005], con[1000005], link[1000005], v[500005], sz;
vector<int> cyc, temp;
void add_edge(int s, int e){
sz++;
link[sz] = e; con[sz] = st[s]; st[s] = sz;
sz++;
link[sz] = s; con[sz] = st[e]; st[e] = sz;
}
void f(int x){
int p = st[x];
while (p) {
int pos = link[p];
int q = (p+1)/2;
st[x] = p = con[p];
if(!v[q]){
v[q]=1;
f(pos);
}
}
cyc.push_back(x);
}
int vis[500005];
int main(){
scanf("%d %d",&n,&m);
for (int i=0; i<m; i++) {
int s,e;
scanf("%d %d",&s,&e);
add_edge(s,e);
}
f(1);
for (int i=0; i<cyc.size(); i++) {
temp.push_back(cyc[i]);
if(vis[cyc[i]]){
printf("%d",temp.back());
temp.pop_back();
while(temp.back() != cyc[i]){
printf(" %d",temp.back());
vis[temp.back()] = 0;
temp.pop_back();
if(temp.back() == cyc[i]) printf("\n");
}
}
else vis[cyc[i]] = 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... |