# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31550 | 2017-08-29T08:11:51 Z | Kanvie | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 16504 KB |
#include<bits/stdc++.h> using namespace std; #define fi first #define se second typedef pair<int,int> pii; int n,m,vv,u,cnt,lol; vector<pii>v[500001]; bool visit[500001],fi,edge[500001]; vector<int>ans; stack<int>s,ss; inline bool chk(int x) { if(!edge[x]){edge[x]=true;return true;} else return false; } void push_db(int x) { if(!visit[x]) { ss.push(x); visit[x]=true; return; } else { if(fi)printf("\n"); else fi=true; while(1) { lol=ss.top(); if(lol!=x)printf("%d ",lol); else printf("%d",lol); if(lol!=x){visit[lol]=false;ss.pop();} else break; } } } int x,y; int main() { scanf("%d%d",&n,&m); for(int i=1;i<=m;++i) { scanf("%d%d",&x,&y); ++cnt; v[x].push_back({y,cnt}); v[y].push_back({x,cnt}); } s.push(1); fi=false; while(!s.empty()) { u=s.top(); for(int i=0;i<v[u].size();++i) { vv=v[u][i].fi; if(chk(v[u][i].se))break; if(i==v[u].size()-1)vv=-1; } if(vv!=-1)s.push(vv); else {s.pop();push_db(u);} } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 11 ms | 12032 KB | Output is correct |
4 | Correct | 25 ms | 12160 KB | Output is correct |
5 | Correct | 15 ms | 12160 KB | Output is correct |
6 | Correct | 17 ms | 12288 KB | Output is correct |
7 | Correct | 21 ms | 12672 KB | Output is correct |
8 | Correct | 13 ms | 12136 KB | Output is correct |
9 | Correct | 182 ms | 14808 KB | Output is correct |
10 | Correct | 14 ms | 12160 KB | Output is correct |
11 | Correct | 15 ms | 12160 KB | Output is correct |
12 | Correct | 78 ms | 15208 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 38 ms | 12000 KB | Output is correct |
2 | Correct | 15 ms | 12032 KB | Output is correct |
3 | Correct | 14 ms | 12160 KB | Output is correct |
4 | Correct | 16 ms | 12160 KB | Output is correct |
5 | Correct | 14 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12160 KB | Output is correct |
7 | Correct | 28 ms | 12672 KB | Output is correct |
8 | Correct | 12 ms | 12160 KB | Output is correct |
9 | Correct | 160 ms | 14840 KB | Output is correct |
10 | Correct | 13 ms | 12160 KB | Output is correct |
11 | Correct | 15 ms | 12160 KB | Output is correct |
12 | Correct | 81 ms | 15096 KB | Output is correct |
13 | Correct | 96 ms | 16480 KB | Output is correct |
14 | Correct | 85 ms | 16120 KB | Output is correct |
15 | Execution timed out | 1082 ms | 15248 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 12160 KB | Output is correct |
2 | Correct | 18 ms | 12032 KB | Output is correct |
3 | Correct | 12 ms | 12032 KB | Output is correct |
4 | Correct | 15 ms | 12260 KB | Output is correct |
5 | Correct | 12 ms | 12136 KB | Output is correct |
6 | Correct | 14 ms | 12160 KB | Output is correct |
7 | Correct | 23 ms | 12672 KB | Output is correct |
8 | Correct | 15 ms | 12160 KB | Output is correct |
9 | Correct | 149 ms | 14852 KB | Output is correct |
10 | Correct | 14 ms | 12160 KB | Output is correct |
11 | Correct | 14 ms | 12160 KB | Output is correct |
12 | Correct | 80 ms | 15096 KB | Output is correct |
13 | Correct | 95 ms | 16504 KB | Output is correct |
14 | Correct | 94 ms | 16096 KB | Output is correct |
15 | Execution timed out | 1076 ms | 15272 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |