# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115991 | 2019-06-10T06:44:35 Z | ckodser | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 55672 KB |
#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()){ if(!vis[ger[a][l[a]]]){ ll e=ger[a][l[a]]; vis[e]=1; dfs(s[e]^t[e]^a); } l[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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12160 KB | Output is correct |
3 | Correct | 13 ms | 12160 KB | Output is correct |
4 | Correct | 13 ms | 12288 KB | Output is correct |
5 | Correct | 13 ms | 12208 KB | Output is correct |
6 | Correct | 13 ms | 12288 KB | Output is correct |
7 | Correct | 21 ms | 13056 KB | Output is correct |
8 | Correct | 12 ms | 12288 KB | Output is correct |
9 | Correct | 53 ms | 17404 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 13 ms | 12320 KB | Output is correct |
12 | Correct | 58 ms | 17752 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12032 KB | Output is correct |
4 | Correct | 13 ms | 12288 KB | Output is correct |
5 | Correct | 13 ms | 12132 KB | Output is correct |
6 | Correct | 14 ms | 12288 KB | Output is correct |
7 | Correct | 17 ms | 13032 KB | Output is correct |
8 | Correct | 12 ms | 12288 KB | Output is correct |
9 | Correct | 53 ms | 17528 KB | Output is correct |
10 | Correct | 14 ms | 12288 KB | Output is correct |
11 | Correct | 15 ms | 12288 KB | Output is correct |
12 | Correct | 64 ms | 17656 KB | Output is correct |
13 | Correct | 114 ms | 20752 KB | Output is correct |
14 | Correct | 88 ms | 18016 KB | Output is correct |
15 | Correct | 86 ms | 19312 KB | Output is correct |
16 | Correct | 92 ms | 20708 KB | Output is correct |
17 | Correct | 101 ms | 16480 KB | Output is correct |
18 | Correct | 102 ms | 18788 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12128 KB | Output is correct |
3 | Correct | 15 ms | 12032 KB | Output is correct |
4 | Correct | 16 ms | 12288 KB | Output is correct |
5 | Correct | 14 ms | 12160 KB | Output is correct |
6 | Correct | 14 ms | 12392 KB | Output is correct |
7 | Correct | 18 ms | 12928 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 61 ms | 17500 KB | Output is correct |
10 | Correct | 16 ms | 12288 KB | Output is correct |
11 | Correct | 15 ms | 12288 KB | Output is correct |
12 | Correct | 68 ms | 17748 KB | Output is correct |
13 | Correct | 98 ms | 20704 KB | Output is correct |
14 | Correct | 93 ms | 18012 KB | Output is correct |
15 | Correct | 90 ms | 19312 KB | Output is correct |
16 | Correct | 123 ms | 20728 KB | Output is correct |
17 | Correct | 98 ms | 16504 KB | Output is correct |
18 | Correct | 104 ms | 18680 KB | Output is correct |
19 | Execution timed out | 585 ms | 55672 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |