CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Niklas Sandén
Submission time:	2019-03-12 21:55:27 +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.01 s	1, 2, 3	details
#2	ACCEPTED	0.02 s	1, 2, 3	details
#3	ACCEPTED	0.02 s	1, 2, 3	details
#4	ACCEPTED	0.02 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.02 s	1, 2, 3	details
#8	ACCEPTED	0.01 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.01 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.03 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.05 s	3	details
#17	ACCEPTED	0.06 s	3	details
#18	ACCEPTED	0.05 s	3	details
#19	ACCEPTED	0.05 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

Code

#include <bits/stdc++.h>
using namespace std;
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define allP(x) x->begin(), x->end()
#define sz(x) (int)(x).size()
 
// #define int ll
 
typedef long long ll;
 
const int inf = 0x3f3f3f3f;
const long long mod = 1000000007;
 
void Recursive(const vector<vector<int>>& paths, int index, vector<bool>& hasVisited)
{
	for (auto& path : paths[index])
	{
		if (hasVisited[path])
		{
			continue;
		}
 
		hasVisited[path] = true;
 
		Recursive(paths, path, hasVisited);
	}
 
	cout << index + 1 << ' ';
}
 
void Encoder()
{
	int n; cin >> n;
 
	vector<vector<int>> paths(n);
	for (int i = 0; i < n - 1; i++)
	{
		int a, b; cin >> a >> b;
		a--; b--;
 
		paths[a].push_back(b);
		paths[b].push_back(a);
	}
 
	vector<bool> hasVisited(n, false);
	hasVisited[0] = true;
 
	Recursive(paths, 0, hasVisited);
}
 
void Decoder()
{
	int n; cin >> n;
 
	vector<int> distances(n - 1);
 
	for (int i = n - 2; i >= 0; i--)
	{
		cin >> distances[i];
	}
 
	vector<int> parents(n, -1);
	for (int i = 0; i < n - 1; i++)
	{
		int index = i;
 
		for (int j = 0; j < distances[i] - 1; j++)
		{
			index = parents[index];
		}
 
		parents[i + 1] = index;
 
		cout << i + 2 << ' ' << index + 1 << "\n";
	}
}
 
int main()
{
	cin.sync_with_stdio(false);
	cin.tie(NULL);
	// cin.exceptions(cin.failbit);
	// cout << setprecision(10);
	// cout << fixed;
 
	int t; cin >> t;
 
	if (t == 1)
	{
		Encoder();
	}
	else
	{
		Decoder();
	}
 
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2 2 1` view save

correct output
(empty)

user output
`2 1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`2 1 3 1` 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
`2 1 3 1 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
`2 1 3 2 4 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
`2 1 3 2 4 1 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
`2 1 3 2 4 2 5 1` 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
`2 1 3 2 4 2 5 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
`2 1 3 2 4 2 5 2 6 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
`2 1 3 2 4 3 5 1 6 5 ...` 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
`2 1 3 2 4 3 5 4 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
`2 1 3 2 4 2 5 4 6 1 ...` 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
`2 1 3 2 4 2 5 2 6 2 ...` Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 2 5 2 6 2 ...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 1 3 2 4 3 5 4 6 5 ...` Truncated

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

NOI 2019

Distance Code

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 (Niklas Sandén)