답안 #485254

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485254	2021-11-06T17:56:29 Z	SirCovidThe19th	어르신 집배원 (BOI14_postmen)	C++17	100 / 100	370 ms	64100 KB

postmen

#include <bits/stdc++.h>
using namespace std;

const int mx = 5e5 + 5;

int n, m, pth[mx]; bool vis[mx], useEdg[mx]; vector<pair<int, int>> adj[mx]; 

void dfs(int cur){
    if (vis[cur]){
        int cyc = cur;
        while (vis[cyc]){
            cout<<cyc<<" ";
            vis[cyc] = 0; cyc = pth[cyc];
        }
        cout<<"\n";
    }
    while (adj[cur].size()){
        int nxt, ind; 
        tie(nxt, ind) = adj[cur].back(); adj[cur].pop_back();
        if (!useEdg[ind]){
            useEdg[ind] = vis[cur] = 1;
            pth[cur] = nxt;
            dfs(nxt);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        int a, b; cin >> a >> b;
        adj[a].push_back({b, i}); adj[b].push_back({a, i});
    }
    dfs(1);
}

Subtask #1

38.0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	11980 KB	Output is correct
2	Correct	7 ms	11980 KB	Output is correct
3	Correct	6 ms	11980 KB	Output is correct
4	Correct	7 ms	12236 KB	Output is correct
5	Correct	8 ms	12096 KB	Output is correct
6	Correct	8 ms	12364 KB	Output is correct
7	Correct	11 ms	13244 KB	Output is correct
8	Correct	7 ms	12236 KB	Output is correct
9	Correct	35 ms	19180 KB	Output is correct
10	Correct	7 ms	12236 KB	Output is correct
11	Correct	7 ms	12236 KB	Output is correct
12	Correct	37 ms	19496 KB	Output is correct

Subtask #2

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	11980 KB	Output is correct
2	Correct	6 ms	11980 KB	Output is correct
3	Correct	6 ms	11980 KB	Output is correct
4	Correct	7 ms	12236 KB	Output is correct
5	Correct	7 ms	12108 KB	Output is correct
6	Correct	8 ms	12432 KB	Output is correct
7	Correct	10 ms	13264 KB	Output is correct
8	Correct	7 ms	12236 KB	Output is correct
9	Correct	31 ms	19208 KB	Output is correct
10	Correct	7 ms	12236 KB	Output is correct
11	Correct	7 ms	12240 KB	Output is correct
12	Correct	36 ms	19652 KB	Output is correct
13	Correct	47 ms	20932 KB	Output is correct
14	Correct	50 ms	18348 KB	Output is correct
15	Correct	49 ms	20276 KB	Output is correct
16	Correct	53 ms	20932 KB	Output is correct
17	Correct	53 ms	16224 KB	Output is correct
18	Correct	53 ms	19500 KB	Output is correct

Subtask #3

45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	11952 KB	Output is correct
2	Correct	6 ms	11980 KB	Output is correct
3	Correct	6 ms	12008 KB	Output is correct
4	Correct	7 ms	12236 KB	Output is correct
5	Correct	6 ms	12108 KB	Output is correct
6	Correct	7 ms	12364 KB	Output is correct
7	Correct	11 ms	13260 KB	Output is correct
8	Correct	7 ms	12236 KB	Output is correct
9	Correct	32 ms	19200 KB	Output is correct
10	Correct	7 ms	12128 KB	Output is correct
11	Correct	7 ms	12236 KB	Output is correct
12	Correct	36 ms	19560 KB	Output is correct
13	Correct	49 ms	20976 KB	Output is correct
14	Correct	46 ms	18244 KB	Output is correct
15	Correct	44 ms	20252 KB	Output is correct
16	Correct	53 ms	20972 KB	Output is correct
17	Correct	48 ms	16200 KB	Output is correct
18	Correct	48 ms	19468 KB	Output is correct
19	Correct	350 ms	57724 KB	Output is correct
20	Correct	343 ms	50548 KB	Output is correct
21	Correct	306 ms	58440 KB	Output is correct
22	Correct	354 ms	64100 KB	Output is correct
23	Correct	137 ms	50468 KB	Output is correct
24	Correct	370 ms	39752 KB	Output is correct
25	Correct	361 ms	56132 KB	Output is correct