— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Olli Järviniemi
Submission time:2019-03-06 16:30:56 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#20.02 s1, 2, 3details
#30.02 s1, 2, 3details
#40.02 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#60.02 s1, 2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#100.01 s1, 2, 3details
#110.02 s1, 2, 3details
#120.02 s2, 3details
#13ACCEPTED0.01 s2, 3details
#140.01 s2, 3details
#150.02 s2, 3details
#160.07 s3details
#17ACCEPTED0.07 s3details
#180.08 s3details
#190.08 s3details
#200.02 s1, 2, 3details

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:72: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);
	}
	reverse(v.begin(), v.end());
	int cu = 1;
	
	for(int i = 1; i < n; ++i) {
		int d = v[i];
		for(int j = 1; j < d; ++j) {
			cu = p[cu];
		}
		g[cu].push_back(i+1);
		g[i+1].push_back(cu);
		cu = i+1;
		p[i+1] = cu;
	}

	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:

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
2 3
view save

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
2 3
3 4
view save

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
1 2
2 3
3 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:

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

correct output
(empty)

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

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

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

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

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

Test 10

Group: 1, 2, 3

Verdict:

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:

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:

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

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 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:

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:

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:

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

correct output
(empty)

user output
1 2
2 3
3 4
4 5
5 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:

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:

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:

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

correct output
(empty)

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

Tasks

A Distance Code-B Thieves and Prisons-C Graph Ordering-

Submissions (Olli Järviniemi)

2019-03-06 16:52:11 1002019-03-06 16:30:56 0