# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
912889 | 2024-01-20T04:02:48 Z | 1075508020060209tc | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 73400 KB |
//#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; //#define int long long #define X first #define Y second #define SZ(x) (int)(x).size() int n;int m; int ar[500005]; int br[500005]; vector<int>e[500005]; int eit[500005]; bool vis[500005]; bool visv[500005]; vector<int>ans; void dfs(int nw){ for(;eit[nw]<e[nw].size();eit[nw]++){ int id=e[nw][eit[nw]]; if(vis[id]){continue;} vis[id]=1; int v=ar[id]^br[id]^nw; dfs(v); } ans.push_back(nw); } vector<vector<int>>fans; signed main(){ cin.tie(0); ios_base::sync_with_stdio(0); cin>>n>>m; for(int i=1;i<=m;i++){ cin>>ar[i]>>br[i]; e[ar[i]].push_back(i); e[br[i]].push_back(i); } dfs(1); stack<int>stk; for(int i=0;i<ans.size();i++){ //vector<int>vc; int v=ans[i]; if(visv[v]){ while(1){ // vc.push_back(stk.back()); cout<<stk.top()<<" "; if(stk.top()==v){cout<<"\n";break;} visv[stk.top()]=0; stk.pop(); } // fans.push_back(vc); }else{ visv[v]=1; stk.push(v); } }return 0; for(int i=0;i<fans.size();i++){ for(int j=0;j<fans[i].size();j++){ cout<<fans[i][j]<<" "; }cout<<"\n"; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 14680 KB | Output is correct |
2 | Correct | 5 ms | 14684 KB | Output is correct |
3 | Correct | 5 ms | 14836 KB | Output is correct |
4 | Correct | 6 ms | 15096 KB | Output is correct |
5 | Correct | 5 ms | 14936 KB | Output is correct |
6 | Correct | 5 ms | 15192 KB | Output is correct |
7 | Correct | 10 ms | 16472 KB | Output is correct |
8 | Correct | 5 ms | 14940 KB | Output is correct |
9 | Correct | 38 ms | 23248 KB | Output is correct |
10 | Correct | 7 ms | 14936 KB | Output is correct |
11 | Correct | 5 ms | 15192 KB | Output is correct |
12 | Correct | 33 ms | 23500 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 14792 KB | Output is correct |
2 | Correct | 3 ms | 14684 KB | Output is correct |
3 | Correct | 5 ms | 14840 KB | Output is correct |
4 | Correct | 5 ms | 14940 KB | Output is correct |
5 | Correct | 4 ms | 14940 KB | Output is correct |
6 | Correct | 4 ms | 15192 KB | Output is correct |
7 | Correct | 9 ms | 16220 KB | Output is correct |
8 | Correct | 7 ms | 15096 KB | Output is correct |
9 | Correct | 40 ms | 23284 KB | Output is correct |
10 | Correct | 5 ms | 14940 KB | Output is correct |
11 | Correct | 6 ms | 15044 KB | Output is correct |
12 | Correct | 40 ms | 23496 KB | Output is correct |
13 | Correct | 49 ms | 26396 KB | Output is correct |
14 | Correct | 86 ms | 22220 KB | Output is correct |
15 | Correct | 64 ms | 25252 KB | Output is correct |
16 | Correct | 42 ms | 26576 KB | Output is correct |
17 | Correct | 60 ms | 19764 KB | Output is correct |
18 | Correct | 72 ms | 23660 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 14680 KB | Output is correct |
2 | Correct | 6 ms | 14684 KB | Output is correct |
3 | Correct | 5 ms | 14680 KB | Output is correct |
4 | Correct | 5 ms | 15040 KB | Output is correct |
5 | Correct | 4 ms | 14936 KB | Output is correct |
6 | Correct | 6 ms | 15196 KB | Output is correct |
7 | Correct | 10 ms | 16216 KB | Output is correct |
8 | Correct | 5 ms | 14940 KB | Output is correct |
9 | Correct | 33 ms | 23364 KB | Output is correct |
10 | Correct | 6 ms | 15024 KB | Output is correct |
11 | Correct | 6 ms | 14940 KB | Output is correct |
12 | Correct | 38 ms | 23568 KB | Output is correct |
13 | Correct | 77 ms | 26448 KB | Output is correct |
14 | Correct | 50 ms | 22316 KB | Output is correct |
15 | Correct | 44 ms | 25160 KB | Output is correct |
16 | Correct | 71 ms | 26568 KB | Output is correct |
17 | Correct | 55 ms | 19704 KB | Output is correct |
18 | Correct | 47 ms | 23708 KB | Output is correct |
19 | Execution timed out | 574 ms | 73400 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |