oj.uz

Submission #936177

# Submission time Handle Problem Language Result Execution time Memory
936177 2024-03-01T10:19:36 Z THXuan Senior Postmen (BOI14_postmen) C++14
100 / 100
 375 ms 65824 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

vector<pair<int,int>>adj[500005];
bool visited[500005];
vector<int>path;
int seen[500005];

void dfs(int s) {
	while (adj[s].size()) {
		int u = adj[s].back().first; int idx = adj[s].back().second;
		adj[s].pop_back();
		if (visited[idx])continue;
		visited[idx] = true;
		dfs(u);
	}
	path.push_back(s);
	seen[s]++;
	if (seen[s] == 2) {
		cout << s << " ";
		path.pop_back();
		while (path.back() != s) {
			cout << path.back() << " ";
			seen[path.back()]--;
			path.pop_back();
		}
		cout << "\n";
		seen[s]--;
	}
}

void solve()
{
	int n, m; cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int x, y; cin >> x >> y;
		adj[x].push_back({ y, i });
		adj[y].push_back({ x, i });
	}
	dfs(1);
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14472 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 3 ms 14424 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 14428 KB Output is correct
6 Correct 4 ms 14684 KB Output is correct
7 Correct 9 ms 15708 KB Output is correct
8 Correct 5 ms 14932 KB Output is correct
9 Correct 34 ms 22084 KB Output is correct
10 Correct 4 ms 14428 KB Output is correct
11 Correct 4 ms 14684 KB Output is correct
12 Correct 28 ms 22576 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 4 ms 14428 KB Output is correct
4 Correct 6 ms 14936 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 5 ms 14684 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 4 ms 14424 KB Output is correct
9 Correct 26 ms 22104 KB Output is correct
10 Correct 4 ms 14680 KB Output is correct
11 Correct 4 ms 14680 KB Output is correct
12 Correct 31 ms 22660 KB Output is correct
13 Correct 39 ms 24524 KB Output is correct
14 Correct 49 ms 21708 KB Output is correct
15 Correct 38 ms 23212 KB Output is correct
16 Correct 38 ms 24532 KB Output is correct
17 Correct 37 ms 19264 KB Output is correct
18 Correct 38 ms 22864 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14424 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 4 ms 14680 KB Output is correct
7 Correct 7 ms 15804 KB Output is correct
8 Correct 4 ms 14428 KB Output is correct
9 Correct 26 ms 22108 KB Output is correct
10 Correct 4 ms 14676 KB Output is correct
11 Correct 4 ms 14684 KB Output is correct
12 Correct 31 ms 22620 KB Output is correct
13 Correct 38 ms 24520 KB Output is correct
14 Correct 37 ms 21712 KB Output is correct
15 Correct 36 ms 23496 KB Output is correct
16 Correct 37 ms 24520 KB Output is correct
17 Correct 35 ms 19280 KB Output is correct
18 Correct 38 ms 22860 KB Output is correct
19 Correct 316 ms 65824 KB Output is correct
20 Correct 282 ms 51848 KB Output is correct
21 Correct 328 ms 60320 KB Output is correct
22 Correct 314 ms 65752 KB Output is correct
23 Correct 158 ms 52496 KB Output is correct
24 Correct 375 ms 40084 KB Output is correct
25 Correct 346 ms 57040 KB Output is correct