oj.uz

답안 #212371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212371 2020-03-22T19:32:17 Z dolphingarlic 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 457 ms 47096 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
using namespace std;
 
vector<pair<int, int>> graph[500001];
bool visited[500001], used[500001];
int nxt[500001];
 
void dfs(int node) {
	if (visited[node]) {
		while (visited[node]) {
			visited[node] = false;
			cout << node << ' ';
			node = nxt[node];
		}
		cout << '\n';
	}
	while (graph[node].size()) {
		int c, idx;
		tie(c, idx) = graph[node].back();
		graph[node].pop_back();
		if (!used[idx]) {
			used[idx] = true;
			visited[node] = true;
			nxt[node] = c;
			dfs(c);
		}
	}
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		graph[a].push_back({b, i});
		graph[b].push_back({a, i});
	}
	
	dfs(1);
	return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 12 ms 12288 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 39 ms 17144 KB Output is correct
10 Correct 12 ms 12160 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 44 ms 17528 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 12 ms 12288 KB Output is correct
7 Correct 16 ms 12928 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 39 ms 17144 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 45 ms 17528 KB Output is correct
13 Correct 66 ms 19064 KB Output is correct
14 Correct 61 ms 17400 KB Output is correct
15 Correct 78 ms 18284 KB Output is correct
16 Correct 64 ms 19064 KB Output is correct
17 Correct 64 ms 16120 KB Output is correct
18 Correct 61 ms 18040 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 15 ms 12928 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 41 ms 17144 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 44 ms 17528 KB Output is correct
13 Correct 65 ms 18936 KB Output is correct
14 Correct 61 ms 17400 KB Output is correct
15 Correct 59 ms 18284 KB Output is correct
16 Correct 64 ms 19064 KB Output is correct
17 Correct 87 ms 16120 KB Output is correct
18 Correct 61 ms 18040 KB Output is correct
19 Correct 439 ms 47096 KB Output is correct
20 Correct 414 ms 38776 KB Output is correct
21 Correct 391 ms 43100 KB Output is correct
22 Correct 434 ms 47096 KB Output is correct
23 Correct 167 ms 36228 KB Output is correct
24 Correct 457 ms 32632 KB Output is correct
25 Correct 440 ms 41976 KB Output is correct