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 mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define fox(k, x) for (int k=0; k<x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define pc(x) putchar_unlocked(x);
inline void out(int n)
{
int N = n, rev, count = 0;
rev = N;
if (N == 0) { pc('0'); pc('\n'); return ;}
while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s
rev = 0;
while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;} //store reverse of N in rev
while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}
while (count--) pc('0');
}
int n, m, a, b, t, p[500005];
bool u[500005], u2[500005];
vector<pii> v[500005];
vector<int> s, ans;
void dfs(int N){
if (u[N]){
t=-1;
ans=vector<int>();
while(t!=N){
ans.pb(t=s.back()); s.pop_back();
u[t]=0;
}
fox(l, ans.size()){
out(ans[l]);
if (l!=ans.size()-1) putchar_unlocked(' ');
} putchar_unlocked('\n');
}
for(; p[N]<v[N].size(); ++p[N]){
if (!u2[v[N][p[N]].y]){
u[N]=1;
s.pb(N);
u2[v[N][p[N]].y]=1;
dfs(v[N][p[N]].x);
}
}
}
int main(){
scan(n); scan(m);
fox(l, m){
scan(a); scan(b);
v[a].pb(mp(b, l));
v[b].pb(mp(a, l));
}
dfs(1);
return 0;
}
Compilation message (stderr)
postmen.cpp: In function 'void dfs(int)':
postmen.cpp:9:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fox(k, x) for (int k=0; k<x; ++k)
postmen.cpp:37:13:
fox(l, ans.size()){
~~~~~~~~~~~~~
postmen.cpp:37:9: note: in expansion of macro 'fox'
fox(l, ans.size()){
^~~
postmen.cpp:39:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (l!=ans.size()-1) putchar_unlocked(' ');
~^~~~~~~~~~~~~~
postmen.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(; p[N]<v[N].size(); ++p[N]){
~~~~^~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |