CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Filip Björnåsen
Submission time:	2019-03-06 12:52:23 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	47
#3	ACCEPTED	32

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.03 s	1, 2, 3	details
#3	ACCEPTED	0.03 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.02 s	1, 2, 3	details
#6	ACCEPTED	0.03 s	1, 2, 3	details
#7	ACCEPTED	0.03 s	1, 2, 3	details
#8	ACCEPTED	0.02 s	1, 2, 3	details
#9	ACCEPTED	0.02 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.02 s	1, 2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.04 s	2, 3	details
#16	ACCEPTED	0.13 s	3	details
#17	ACCEPTED	0.14 s	3	details
#18	ACCEPTED	0.14 s	3	details
#19	ACCEPTED	0.12 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

Compiler report

input/code.cpp:5:0: warning: ignoring #pragma region Libraries [-Wunknown-pragmas]
 #pragma region Libraries
 
input/code.cpp:21:0: warning: ignoring #pragma endregion  [-Wunknown-pragmas]
 #pragma endregion

Code


using namespace std;

#pragma region Libraries

#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cstring>
#include <iomanip>

#pragma endregion

#define MP make_pair
#define all(v) v.begin(), v.end()
#define trav(it,v) for (auto it = v.begin(); it != v.end(); it++)
#define rep(index, from, to) for (int index = from; index < to; index++)
#define ll long long
#define pi pair<int,int>

vector<int> v[(int)1e5 + 5];
vector<int> di;

void encode(int u, int e) {
	trav(it, v[u]) {
		if (*it == e) {
			continue;
		}
		encode(*it, u);
	}
	cout << u + 1 << " ";
}

int cur = 0;
int ne = 1;
int n;
void decode(int u) {
	if (cur == n - 1) return;
	while (di[cur] == 1) {
		cur++;
		cout << u + 1 << " " << ne + 1 << endl;
		if (cur == n - 1) return;
		ne++;
		decode(ne - 1);
		if (cur == n - 1) return;
	}
	if (cur == n - 1) return;
	di[cur]--;
}

int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int t;
	cin >> t >> n;
	if (t == 1) {
		for (int i = 0; i < n - 1; i++)
		{
			int f, to;
			cin >> f >> to;
			f--, to--;
			v[f].push_back(to);
			v[to].push_back(f);
		}
		encode(0, -1);
	}
	else {
		di.resize(n - 1);
		for (int i = 0; i < n - 1; i++)
		{
			cin >> di[i];
		}
		reverse(all(di));
		decode(0);
	}



#ifdef _DEBUG
	system("pause");
#endif // _DEBUG
	return 0;
}

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 1 3` 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 1 3 3 4` 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 3 2 4` 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 1 4 4 5` 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 2 3 2 4 1 5` 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 3 2 4 2 5` 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 3 2 4 2 5 2 6 ...` 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 1 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 2 3 3 4 4 5 5 6 ...` 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 2 4 4 5 1 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 3 2 4 2 5 2 6 ...` 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 2 3 3 4 4 5 5 6 ...` 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 3 2 4 2 5 2 6 ...` 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 2 3 3 4 4 5 5 6 ...` 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 3 2 4 4 5 4 6` view save

NOI 2019

Distance Code

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Filip Björnåsen)