CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Olli Järviniemi
Submission time:	2019-03-06 16:52:11 +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.03 s	1, 2, 3	details
#3	ACCEPTED	0.02 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.02 s	1, 2, 3	details
#7	ACCEPTED	0.02 s	1, 2, 3	details
#8	ACCEPTED	0.02 s	1, 2, 3	details
#9	ACCEPTED	0.01 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.03 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.08 s	3	details
#17	ACCEPTED	0.08 s	3	details
#18	ACCEPTED	0.09 s	3	details
#19	ACCEPTED	0.07 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'void dfs(int)':
input/code.cpp:17:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < g[i].size(); ++j) {
                 ~~^~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:94:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < g[i].size(); ++j) {
                  ~~^~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5;

vector<int> g[N];
vector<int> ans;

bool z[N];

void dfs(int i) {
	if(z[i]) return;
	z[i] = true;
	for(int j = 0; j < g[i].size(); ++j) {
		dfs(g[i][j]);
	}
	ans.push_back(i);
}


void dfs2(int i) {

}

int p[N];

int main() {
	int t;
	cin >> t;
	if(t == 1) {
		int n;
		cin >> n;
		for(int i = 1; i < n; ++i) {
			int a, b;
			cin >> a >> b;
			g[a].push_back(b);
			g[b].push_back(a);
		}

		dfs(1);
		for(int i = 0; i < n; ++i) {
			cout << ans[i] << " ";
		}
		cout << "\n";
		return 0;
	}

	int n;
	cin >> n;
	vector<int> v;
	for(int i = 1; i <  n; ++i) {
		int a; cin >> a; v.push_back(a);
	}
	cout << "\n";

	vector<int> ind;

	for(int i = n; i >= 1; --i) {
		ind.push_back(i);
	}
	int cu = 1;
	ind.pop_back();
	for(int i = 0; i < n; ++i) {
		int d = v[i];
	//	cout << "cu is now " << cu << "\n";
		if(p[cu] == 0) {
			int k = ind[ind.size() - 1];
			ind.pop_back();
			p[cu] = k;
			g[k].push_back(cu);
			g[cu].push_back(k);
			cu = k;
	//		cout << "here " << cu << "\n";
		} else {
			cu = p[cu];
	//		cout << "Here " << cu << "\n";
		}
		for(int j = 1; j < d; ++j) {
			int k = ind[ind.size() - 1];
			ind.pop_back();
			p[k] = cu;
			g[k].push_back(cu);
			g[cu].push_back(k);
			cu = k;
	//		cout << "h " << cu << "\n";
		}

	}

	for(int i = 1; i <= n; ++i) {
		for(int j = 0; j < g[i].size(); ++j) {
			int k = g[i][j];
			if(k > i) {
				cout << i << " " << k << "\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 2 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 2 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 3 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 3 4 3 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 ...` 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 ...` 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 2 5 3 4 ...` 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 ...` 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 ...` Truncated

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 ...` Truncated

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 3 495 ...` Truncated

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 ...` Truncated

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 ...` Truncated

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 ...` Truncated

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 ...` Truncated

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 ...` 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
`1 2 2 3 2 4 4 5 ...` 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 (Olli Järviniemi)