Code Submission Evaluation System Login

NOI 2019 Open

Start:N/A
End:N/A
 

Tasks | Scoreboard | Statistics


CSES - NOI 2019 Open - Results
History
0:32:19100
Task:Distance Code
Sender:pustaczek
Submission time:2019-03-10 12:30:55
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32

Test results

testverdicttime (s)group
#1ACCEPTED0.01 / 1.001, 2, 3details
#2ACCEPTED0.02 / 1.001, 2, 3details
#3ACCEPTED0.01 / 1.001, 2, 3details
#4ACCEPTED0.03 / 1.001, 2, 3details
#5ACCEPTED0.02 / 1.001, 2, 3details
#6ACCEPTED0.02 / 1.001, 2, 3details
#7ACCEPTED0.02 / 1.001, 2, 3details
#8ACCEPTED0.02 / 1.001, 2, 3details
#9ACCEPTED0.02 / 1.001, 2, 3details
#10ACCEPTED0.01 / 1.001, 2, 3details
#11ACCEPTED0.01 / 1.001, 2, 3details
#12ACCEPTED0.03 / 1.002, 3details
#13ACCEPTED0.03 / 1.002, 3details
#14ACCEPTED0.03 / 1.002, 3details
#15ACCEPTED0.02 / 1.002, 3details
#16ACCEPTED0.05 / 1.003details
#17ACCEPTED0.06 / 1.003details
#18ACCEPTED0.07 / 1.003details
#19ACCEPTED0.04 / 1.003details
#20ACCEPTED0.02 / 1.001, 2, 3details

Code

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

template <typename T> T load() { T r; cin >> r; return r; }
template <typename T> vector<T> loadMany(int n) { vector<T> rs(n); generate(rs.begin(), rs.end(), &load<T>); return rs; }

struct Dummyf { template <typename... Ts> void operator()(Ts&&...){} };

struct Graph {
	Graph(int n):edges(n){}
	void addEdge1(int a, int b) { edges[a].push_back(b); }
	void addEdge2(int a, int b) { addEdge1(a, b); addEdge1(b, a); }
	int size() const { return (int)edges.size(); }
	template <typename Pre=Dummyf, typename Post=Dummyf, typename PreE=Dummyf, typename PostE=Dummyf, typename FailE=Dummyf> void DFS(int source, Pre pre, Post post, PreE pree, PostE poste, FailE faile) const {
		auto visit = vector<bool>(size(), false);
		implDFS(source, visit, pre, post, pree, poste, faile);
	}
	template <typename Pre=Dummyf, typename Post=Dummyf, typename PreE=Dummyf, typename PostE=Dummyf, typename FailE=Dummyf> void implDFS(int v, vector<bool>& visit, Pre pre, Post post, PreE pree, PostE poste, FailE faile) const {
		visit[v] = true;
		pre(v);
		for (auto u : edges[v])
			if (not visit[u])
				pree(v, u), implDFS(u, visit, pre, post, pree, poste, faile), poste(v, u);
			else
				faile(v, u);
		post(v);
	}
	vector<vector<int>> edges;
};

Graph loadEdges(int n, int m) {
	auto g = Graph(n);
	while (m --> 0)
		g.addEdge2(load<int>()-1, load<int>()-1);
	return g;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	auto t = load<int>();
	if (t == 1) {
		auto n = load<int>();
		auto tree = loadEdges(n, n-1);
		tree.DFS(0, {}, [&](int v){
			cout << v+1 << ' ';
		}, {}, {}, {});
		cout << '\n';
	} else {
		auto n = load<int>();
		auto dists = loadMany<int>(n-1);
		auto used = 1;
		auto parent = vector<int>(n, -1);
		auto up = [&](int v){
			if (parent[v] == -1)
				parent[v] = used++;
			return parent[v];
		};
		auto down = [&](int v){
			auto u = used++;
			parent[u] = v;
			return u;
		};
		auto v = 0;
		for (auto d : dists) {
			v = up(v);
			for (auto i=0; i<d-1; ++i)
				v = down(v);
		}
		for (auto v=0; v<n; ++v)
			if (parent[v] != -1)
				cout << v+1 << ' ' << parent[v]+1 << '\n';
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1

view   save

correct output
(empty)

user output
1 2

view   save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1

view   save

correct output
(empty)

user output
1 2
3 2

view   save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1
view   save

correct output
(empty)

user output
1 2
2 3
4 3

view   save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3
view   save

correct output
(empty)

user output
1 2
2 4
3 2

view   save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 5
4 1
1 3
...
view   save

correct output
(empty)

user output
1 2
2 3
4 3
5 4

view   save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 2
3 4
5 1
...
view   save

correct output
(empty)

user output
1 2
3 2
4 3
5 3

view   save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
4 3
1 4
4 2
...
view   save

correct output
(empty)

user output
1 2
2 5
3 2
4 2

view   save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 3
8 9
2 9
...
view   save

correct output
(empty)

user output
1 2
2 10
3 2
4 2
5 2
...
view   save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 2
5 8
7 1
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
10 4
9 1
4 7
...
view   save

correct output
(empty)

user output
1 2
3 2
4 3
5 2
6 5
...
view   save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
2 6
4 3
3 5
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
1
500
10 6
6 255
6 428
...
view   save

correct output
(empty)

user output
1 2
2 500
3 2
4 2
5 2
...
view   save

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
1
500
152 466
451 313
158 479
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
1
500
109 440
330 190
443 161
...
view   save

correct output
(empty)

user output
1 2
3 2
4 3
5 4
6 4
...
view   save

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
1
500
144 373
257 233
341 318
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 16

Group: 3

Verdict: ACCEPTED

input
1
100000
54983 75172
93807 75172
44082 75172
...
view   save

correct output
(empty)

user output
1 2
2 100000
3 2
4 2
5 2
...
view   save

Test 17

Group: 3

Verdict: ACCEPTED

input
1
100000
88863 19059
86423 76688
98536 95984
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 18

Group: 3

Verdict: ACCEPTED

input
1
100000
59979 6389
19097 24999
27846 82330
...
view   save

correct output
(empty)

user output
1 2
3 2
4 3
5 4
6 4
...
view   save

Test 19

Group: 3

Verdict: ACCEPTED

input
1
100000
58761 66001
25102 51081
98625 67861
...
view   save

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 6
...
view   save

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
6
2 1
3 2
4 2
...
view   save

correct output
(empty)

user output
1 2
2 4
3 2
4 6
5 4
view   save