# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
115984 | 2019-06-10T06:33:02 Z | ckodser | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 71436 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){ cout<<ans.back()<<' '; inAns[ans.back()]=0; ans.pop_back(); } cout<<a<<endl; }else{ ans.pb(a); inAns[a]=1; } } int main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); ll n,m; cin>>n>>m; for(ll i=0;i<m;i++){ cin>>s[i]>>t[i]; ger[s[i]].pb(i); ger[t[i]].pb(i); } dfs(1); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 12160 KB | Output is correct |
2 | Correct | 12 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12168 KB | Output is correct |
4 | Correct | 23 ms | 12416 KB | Output is correct |
5 | Correct | 12 ms | 12288 KB | Output is correct |
6 | Correct | 15 ms | 12544 KB | Output is correct |
7 | Correct | 20 ms | 13488 KB | Output is correct |
8 | Correct | 13 ms | 12416 KB | Output is correct |
9 | Correct | 55 ms | 20600 KB | Output is correct |
10 | Correct | 16 ms | 12288 KB | Output is correct |
11 | Correct | 14 ms | 12544 KB | Output is correct |
12 | Correct | 75 ms | 20856 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12136 KB | Output is correct |
2 | Correct | 14 ms | 12160 KB | Output is correct |
3 | Correct | 13 ms | 12208 KB | Output is correct |
4 | Correct | 15 ms | 12360 KB | Output is correct |
5 | Correct | 13 ms | 12288 KB | Output is correct |
6 | Correct | 13 ms | 12544 KB | Output is correct |
7 | Correct | 23 ms | 13440 KB | Output is correct |
8 | Correct | 16 ms | 12416 KB | Output is correct |
9 | Correct | 63 ms | 20676 KB | Output is correct |
10 | Correct | 15 ms | 12288 KB | Output is correct |
11 | Correct | 16 ms | 12416 KB | Output is correct |
12 | Correct | 63 ms | 20832 KB | Output is correct |
13 | Correct | 101 ms | 24052 KB | Output is correct |
14 | Correct | 138 ms | 19804 KB | Output is correct |
15 | Correct | 186 ms | 22452 KB | Output is correct |
16 | Correct | 107 ms | 24024 KB | Output is correct |
17 | Correct | 166 ms | 16864 KB | Output is correct |
18 | Correct | 152 ms | 21216 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12160 KB | Output is correct |
2 | Correct | 12 ms | 12136 KB | Output is correct |
3 | Correct | 16 ms | 12136 KB | Output is correct |
4 | Correct | 19 ms | 12416 KB | Output is correct |
5 | Correct | 12 ms | 12308 KB | Output is correct |
6 | Correct | 14 ms | 12544 KB | Output is correct |
7 | Correct | 31 ms | 13440 KB | Output is correct |
8 | Correct | 12 ms | 12416 KB | Output is correct |
9 | Correct | 55 ms | 20600 KB | Output is correct |
10 | Correct | 16 ms | 12264 KB | Output is correct |
11 | Correct | 14 ms | 12416 KB | Output is correct |
12 | Correct | 100 ms | 20780 KB | Output is correct |
13 | Correct | 92 ms | 24048 KB | Output is correct |
14 | Correct | 130 ms | 19792 KB | Output is correct |
15 | Correct | 152 ms | 22388 KB | Output is correct |
16 | Correct | 111 ms | 24048 KB | Output is correct |
17 | Correct | 160 ms | 16888 KB | Output is correct |
18 | Correct | 139 ms | 21368 KB | Output is correct |
19 | Execution timed out | 592 ms | 71436 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |