# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115992 | ckodser | Senior Postmen (BOI14_postmen) | C++11 | 612 ms | 55656 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>
#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=5e5+500;
const ll inf=1e9+900;
vector<ll> ger[maxn];
ll s[maxn];
ll t[maxn];
bool vis[maxn];
ll l[maxn];
stack<ll> ans;
bool inAns[maxn];
void dfs(ll a){
while(l[a]<ger[a].size()){
ll e=ger[a][l[a]];
l[a]++;
if(!vis[e]){
vis[e]=1;
dfs(s[e]^t[e]^a);
}
}
if(inAns[a]){
while(ans.top()!=a){
printf("%d ",ans.top());
inAns[ans.top()]=0;
ans.pop();
}
printf("%d\n",a);
}else{
ans.push(a);
inAns[a]=1;
}
}
int main(){
ll n,m;
scanf("%d%d",&n,&m);
for(ll i=0;i<m;i++){
scanf("%d%d",&s[i],&t[i]);
ger[s[i]].pb(i);
ger[t[i]].pb(i);
}
dfs(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... |