# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115985 | 2019-06-10T06:35:24 Z | ckodser | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 55756 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]; vector<ll> ans; bool inAns[maxn]; void dfs(ll a){ while(l[a]<ger[a].size()){ if(vis[ger[a][l[a]]]){ l[a]++; }else{ ll e=ger[a][l[a]]; vis[e]=1; dfs(s[e]^t[e]^a); } } if(inAns[a]){ while(ans.back()!=a){ printf("%d ",ans.back()); inAns[ans.back()]=0; ans.pop_back(); } printf("%d\n",a); }else{ ans.pb(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 | 13 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 15 ms | 12032 KB | Output is correct |
4 | Correct | 15 ms | 12308 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 17 ms | 12288 KB | Output is correct |
7 | Correct | 18 ms | 13056 KB | Output is correct |
8 | Correct | 15 ms | 12288 KB | Output is correct |
9 | Correct | 54 ms | 17400 KB | Output is correct |
10 | Correct | 16 ms | 12288 KB | Output is correct |
11 | Correct | 14 ms | 12340 KB | Output is correct |
12 | Correct | 59 ms | 17684 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12160 KB | Output is correct |
3 | Correct | 12 ms | 12032 KB | Output is correct |
4 | Correct | 16 ms | 12288 KB | Output is correct |
5 | Correct | 11 ms | 12160 KB | Output is correct |
6 | Correct | 14 ms | 12416 KB | Output is correct |
7 | Correct | 24 ms | 12928 KB | Output is correct |
8 | Correct | 15 ms | 12288 KB | Output is correct |
9 | Correct | 52 ms | 17400 KB | Output is correct |
10 | Correct | 14 ms | 12288 KB | Output is correct |
11 | Correct | 15 ms | 12288 KB | Output is correct |
12 | Correct | 58 ms | 17724 KB | Output is correct |
13 | Correct | 97 ms | 20852 KB | Output is correct |
14 | Correct | 102 ms | 18168 KB | Output is correct |
15 | Correct | 89 ms | 19312 KB | Output is correct |
16 | Correct | 127 ms | 20852 KB | Output is correct |
17 | Correct | 115 ms | 16516 KB | Output is correct |
18 | Correct | 93 ms | 18808 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12032 KB | Output is correct |
2 | Correct | 12 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12160 KB | Output is correct |
4 | Correct | 13 ms | 12288 KB | Output is correct |
5 | Correct | 17 ms | 12136 KB | Output is correct |
6 | Correct | 14 ms | 12288 KB | Output is correct |
7 | Correct | 17 ms | 12928 KB | Output is correct |
8 | Correct | 12 ms | 12288 KB | Output is correct |
9 | Correct | 52 ms | 17528 KB | Output is correct |
10 | Correct | 14 ms | 12288 KB | Output is correct |
11 | Correct | 13 ms | 12288 KB | Output is correct |
12 | Correct | 58 ms | 17656 KB | Output is correct |
13 | Correct | 108 ms | 20852 KB | Output is correct |
14 | Correct | 94 ms | 18168 KB | Output is correct |
15 | Correct | 92 ms | 19288 KB | Output is correct |
16 | Correct | 99 ms | 20852 KB | Output is correct |
17 | Correct | 102 ms | 16580 KB | Output is correct |
18 | Correct | 90 ms | 18912 KB | Output is correct |
19 | Execution timed out | 579 ms | 55756 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |