Submission #743404

# Submission time Handle Problem Language Result Execution time Memory
743404 2023-05-17T11:22:37 Z Dan4Life Senior Postmen (BOI14_postmen) C++17
100 / 100
442 ms 68944 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);
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 12048 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 8 ms 12116 KB Output is correct
6 Correct 8 ms 12372 KB Output is correct
7 Correct 10 ms 13268 KB Output is correct
8 Correct 7 ms 12244 KB Output is correct
9 Correct 35 ms 19492 KB Output is correct
10 Correct 7 ms 12244 KB Output is correct
11 Correct 8 ms 12216 KB Output is correct
12 Correct 40 ms 19892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12088 KB Output is correct
3 Correct 9 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 6 ms 12168 KB Output is correct
6 Correct 8 ms 12372 KB Output is correct
7 Correct 10 ms 13268 KB Output is correct
8 Correct 7 ms 12232 KB Output is correct
9 Correct 34 ms 19456 KB Output is correct
10 Correct 7 ms 12244 KB Output is correct
11 Correct 7 ms 12244 KB Output is correct
12 Correct 38 ms 19876 KB Output is correct
13 Correct 57 ms 21956 KB Output is correct
14 Correct 55 ms 19148 KB Output is correct
15 Correct 71 ms 21044 KB Output is correct
16 Correct 61 ms 22052 KB Output is correct
17 Correct 54 ms 16972 KB Output is correct
18 Correct 52 ms 20264 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12088 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 8 ms 12372 KB Output is correct
7 Correct 14 ms 13268 KB Output is correct
8 Correct 8 ms 12244 KB Output is correct
9 Correct 33 ms 19532 KB Output is correct
10 Correct 7 ms 12244 KB Output is correct
11 Correct 8 ms 12244 KB Output is correct
12 Correct 35 ms 19804 KB Output is correct
13 Correct 52 ms 21964 KB Output is correct
14 Correct 76 ms 19060 KB Output is correct
15 Correct 48 ms 20996 KB Output is correct
16 Correct 56 ms 22020 KB Output is correct
17 Correct 55 ms 16988 KB Output is correct
18 Correct 51 ms 20232 KB Output is correct
19 Correct 381 ms 62344 KB Output is correct
20 Correct 373 ms 54476 KB Output is correct
21 Correct 353 ms 62212 KB Output is correct
22 Correct 410 ms 68944 KB Output is correct
23 Correct 162 ms 52172 KB Output is correct
24 Correct 442 ms 43368 KB Output is correct
25 Correct 418 ms 60064 KB Output is correct