# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292225 | davooddkareshki | Senior Postmen (BOI14_postmen) | C++17 | 163 ms | 262148 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;
//#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define mpr make_pair
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("O4")
#pragma GCC optimize("O5")
#pragma GCC optimize("O6")
#pragma GCC optimize("O7")
#pragma GCC optimize("O8")
#pragma GCC optimize("O9")
#pragma GCC optimize("Ofast")
typedef long long ll;
const int maxn = 5e5+1;
const int mod = 1e9+7;
int n, m, k;
bitset<maxn> mark_E;
queue<pii> g[maxn];
bitset<maxn> mark;
int stk[maxn], lst;
void DO(int v)
{
if(mark[v])
{
while(stk[lst] != v)
{
int u = stk[lst];
mark[u] = 0;
printf("%d ", u);
--lst;
}
mark[v] = 0;
printf("%d\n", v);
--lst;
}
mark[v] = 1;
stk[++lst] = v;
}
void dfs(int v)
{
while(!g[v].empty())
{
pii e = g[v].front(); g[v].pop();
int u = e.F, id = e.S;
if(!mark_E[id])
{
mark_E[id] = 1;
dfs(u);
}
}
DO(v);
}
signed main()
{
//ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
scanf("%d%d", &n, &m);
for(int i = 1, u, v; i <= m; ++i)
{
scanf("%d%d", &u, &v);
g[u].push({v,i});
g[v].push({u,i});
}
dfs(1);
}
/*
10 15
1 3
5 1
2 3
9 2
3 4
6 3
4 5
7 4
4 8
5 7
8 5
6 7
7 8
8 10
10 9
*/
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... |