답안 #866327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866327 2023-10-25T22:08:23 Z BBart888 어르신 집배원 (BOI14_postmen) C++14
100 / 100
358 ms 69320 KB
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)a.size()
#define pb push_back
const int mxN = (int)5e5+10;
int n, m, vis[mxN], vis1[mxN], nx[mxN];
vector<pair<int,int>> v, adj[mxN];
int SZ[mxN];
 
void dfs(int s){
	if(vis[s]){ int p = s;
		while(vis[p]) cout<<p<<" ", vis[p]=0, p = nx[p];
		cout << "\n";
	} 
	while(SZ[s]){
		auto [u,e] = adj[s][SZ[s]-1]; SZ[s]--;
		if(!vis1[e]) vis1[e]=vis[s]=1, nx[s]=u, dfs(u);
	}
}
 
int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		int a, b; cin >> a >> b;
		adj[a].pb({b,i}); adj[b].pb({a,i});
	}
	for(int i = 1; i <= n; i++) SZ[i] = sz(adj[i]);
	dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:16:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   16 |   auto [u,e] = adj[s][SZ[s]-1]; SZ[s]--;
      |        ^
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 6 ms 16220 KB Output is correct
8 Correct 5 ms 14936 KB Output is correct
9 Correct 29 ms 22864 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 29 ms 23376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 6 ms 16220 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 34 ms 22876 KB Output is correct
10 Correct 4 ms 14840 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 28 ms 23380 KB Output is correct
13 Correct 47 ms 25168 KB Output is correct
14 Correct 36 ms 22616 KB Output is correct
15 Correct 38 ms 24276 KB Output is correct
16 Correct 40 ms 25168 KB Output is correct
17 Correct 38 ms 20304 KB Output is correct
18 Correct 38 ms 23596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14784 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 7 ms 16204 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 32 ms 22892 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 30 ms 23384 KB Output is correct
13 Correct 59 ms 25172 KB Output is correct
14 Correct 41 ms 22532 KB Output is correct
15 Correct 38 ms 24264 KB Output is correct
16 Correct 36 ms 25136 KB Output is correct
17 Correct 49 ms 20308 KB Output is correct
18 Correct 46 ms 23596 KB Output is correct
19 Correct 351 ms 69320 KB Output is correct
20 Correct 308 ms 55140 KB Output is correct
21 Correct 278 ms 62932 KB Output is correct
22 Correct 331 ms 68948 KB Output is correct
23 Correct 145 ms 54712 KB Output is correct
24 Correct 283 ms 44224 KB Output is correct
25 Correct 358 ms 61280 KB Output is correct