# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
912884 | 2024-01-20T03:58:27 Z | 1075508020060209tc | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 75408 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); vector<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()); if(stk.back()==v){break;} visv[stk.back()]=0; stk.pop_back(); } fans.push_back(vc); }else{ visv[v]=1; stk.push_back(v); } } 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 | 5 ms | 14684 KB | Output is correct |
2 | Correct | 5 ms | 14684 KB | Output is correct |
3 | Correct | 5 ms | 14684 KB | Output is correct |
4 | Correct | 6 ms | 15192 KB | Output is correct |
5 | Correct | 5 ms | 14936 KB | Output is correct |
6 | Correct | 6 ms | 15448 KB | Output is correct |
7 | Correct | 10 ms | 16220 KB | Output is correct |
8 | Correct | 7 ms | 15192 KB | Output is correct |
9 | Correct | 32 ms | 23840 KB | Output is correct |
10 | Correct | 6 ms | 15092 KB | Output is correct |
11 | Correct | 5 ms | 14940 KB | Output is correct |
12 | Correct | 40 ms | 24072 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14684 KB | Output is correct |
2 | Correct | 5 ms | 14680 KB | Output is correct |
3 | Correct | 5 ms | 14796 KB | Output is correct |
4 | Correct | 6 ms | 15192 KB | Output is correct |
5 | Correct | 6 ms | 14936 KB | Output is correct |
6 | Correct | 6 ms | 15196 KB | Output is correct |
7 | Correct | 10 ms | 16072 KB | Output is correct |
8 | Correct | 6 ms | 14944 KB | Output is correct |
9 | Correct | 30 ms | 24012 KB | Output is correct |
10 | Correct | 7 ms | 14940 KB | Output is correct |
11 | Correct | 6 ms | 14936 KB | Output is correct |
12 | Correct | 33 ms | 24020 KB | Output is correct |
13 | Correct | 72 ms | 27036 KB | Output is correct |
14 | Correct | 62 ms | 23520 KB | Output is correct |
15 | Correct | 51 ms | 27000 KB | Output is correct |
16 | Correct | 50 ms | 27028 KB | Output is correct |
17 | Correct | 60 ms | 21624 KB | Output is correct |
18 | Correct | 48 ms | 25280 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 14680 KB | Output is correct |
2 | Correct | 5 ms | 14680 KB | Output is correct |
3 | Correct | 4 ms | 14680 KB | Output is correct |
4 | Correct | 6 ms | 15348 KB | Output is correct |
5 | Correct | 5 ms | 14940 KB | Output is correct |
6 | Correct | 6 ms | 15192 KB | Output is correct |
7 | Correct | 9 ms | 16216 KB | Output is correct |
8 | Correct | 5 ms | 14940 KB | Output is correct |
9 | Correct | 31 ms | 23916 KB | Output is correct |
10 | Correct | 5 ms | 14936 KB | Output is correct |
11 | Correct | 6 ms | 14940 KB | Output is correct |
12 | Correct | 37 ms | 24012 KB | Output is correct |
13 | Correct | 56 ms | 27060 KB | Output is correct |
14 | Correct | 52 ms | 23620 KB | Output is correct |
15 | Correct | 66 ms | 27044 KB | Output is correct |
16 | Correct | 43 ms | 26952 KB | Output is correct |
17 | Correct | 71 ms | 21548 KB | Output is correct |
18 | Correct | 50 ms | 25432 KB | Output is correct |
19 | Execution timed out | 583 ms | 75408 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |