Code Submission Evaluation System Login

NOI 2019 Open

Start:N/A
End:N/A
 

Tasks | Scoreboard | Statistics


CSES - NOI 2019 Open - Results
History
After contest21
2:17:590
2:02:450
1:55:550
1:45:280
1:21:580
0:41:460
Task:Distance Code
Sender:erimm
Submission time:2019-03-09 16:16:01
Language:C++
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2WRONG ANSWER0
#3WRONG ANSWER0

Test results

testverdicttime (s)group
#1ACCEPTED0.02 / 1.001, 2, 3details
#2ACCEPTED0.03 / 1.001, 2, 3details
#3ACCEPTED0.02 / 1.001, 2, 3details
#4ACCEPTED0.02 / 1.001, 2, 3details
#5ACCEPTED0.02 / 1.001, 2, 3details
#6ACCEPTED0.01 / 1.001, 2, 3details
#7ACCEPTED0.01 / 1.001, 2, 3details
#8ACCEPTED0.01 / 1.001, 2, 3details
#9ACCEPTED0.02 / 1.001, 2, 3details
#10WRONG ANSWER0.01 / 1.001, 2, 3details
#11ACCEPTED0.02 / 1.001, 2, 3details
#12ACCEPTED0.02 / 1.002, 3details
#13ACCEPTED0.02 / 1.002, 3details
#14WRONG ANSWER0.02 / 1.002, 3details
#15WRONG ANSWER0.03 / 1.002, 3details
#16TIME LIMIT EXCEEDED-- / 1.003details
#17TIME LIMIT EXCEEDED-- / 1.003details
#18TIME LIMIT EXCEEDED-- / 1.003details
#19TIME LIMIT EXCEEDED-- / 1.003details
#20ACCEPTED0.01 / 1.001, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:94:46: warning: 'parent' may be used uninitialized in this function [-Wmaybe-uninitialized]
     distances[j][current]=distances[j][parent]+1;
                                              ^

Code

/*
 * src.cpp
 *
 *  Created on: 9. mar. 2019
 *      Author: mingj
 */
#include <bits/stdc++.h>
#include <climits>

using namespace std;

struct node {
	vector<int> edge;
	int total;
};

int main () {
	int t;
	cin>>t;
	if(t==1) {
		int n;
		cin>>n;
		vector<node> tree(n);
		vector<bool> leaf(n,true);
		for(int i=0; i<n; i++){
			tree[i].total=0;
		}
		int a,b;
		for(int i=0; i<n-1; i++){
			cin>>a>>b;
			a=a-1;
			b=b-1;
			tree[a].edge.push_back(b);
			tree[b].edge.push_back(a);
			if(tree[a].edge.size()>1)
				leaf[a]=false;
			if(tree[b].edge.size()>1)
				leaf[b]=false;
			tree[a].total++;
			tree[b].total++;
		}
		bool flag=true;
		while(flag){
			int i;
			flag=false;
			for(i=0; i<n; i++)
				if(leaf[i]){
					flag=true;
					break;
				}
			if(!flag)
				break;
			cout<<i+1<<endl;
			leaf[i]=false;
			tree[i].total=0;
			for(auto it=tree[i].edge.begin(); it!=tree[i].edge.end(); it++){
				tree[*it].total--;
				if(tree[*it].total==1)
					leaf[*it]=true;
			}
		}
	}

	if(t==2) {
		int n;
		cin>>n;
		vector<int> free;
		vector<vector<int>> distances;
		for(int i=0; i<n; i++){
			free.push_back(i+1);
			vector<int> temp(n, INT_MAX);
			temp[i]=0;
			distances.push_back(temp);
		}
		free.erase(free.end()-1);
		vector<int> record;
		for(int i=0; i<n-1; i++){
			int k;
			cin>>k;
			record.push_back(k);
		}
		int current=0;
		for(int i=n-2; i>=0; i--){
			int parent;
			for(int j=0; j<n; j++){
				if(distances[current][j]==record[i]-1){
					parent=j;
					break;
				}
			}
			current=*free.rbegin();
			free.erase(free.end()-1);
			for(int j=0; j<n; j++){
				distances[j][current]=distances[j][parent]+1;
				distances[current][j]=distances[j][current];
			}
			distances[current][current]=0;
		}
		for(int i=0; i<n; i++){
			for(int j=i; j<n; j++){
				if(distances[i][j]==1)
					cout<<i+1<<' '<<j+1<<endl;
			}
		}
	}
}



Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1
view   save

correct output
(no output)
view   save

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
(no output)
view   save

user output
1 3
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
(no output)
view   save

user output
1 4
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
(no output)
view   save

user output
1 4
2 4
3 4
view   save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(no output)
view   save

user output
1 5
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
1 3
view   save

correct output
(no output)
view   save

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

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(no output)
view   save

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

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 3
8 9
2 9
1 9
10 9
9 7
9 6
9 5
9 4
view   save

correct output
(no output)
view   save

user output
1 10
2 10
3 10
4 10
5 10
6 10
7 10
8 10
9 10
view   save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 2
5 8
7 1
6 8
4 10
9 7
10 3
3 2
1 6
view   save

correct output
(no output)
view   save

user output
1 2
1 10
3 4
4 5
5 6
6 7
7 8
8 9
9 10
view   save

Test 10

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
1
10
10 4
9 1
4 7
3 8
8 1
7 6
4 1
6 2
2 5
view   save

correct output
(no output)
view   save

user output
1 10
2 7
3 4
4 5
5 6
6 8
7 9
8 9
9 10
view   save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
2 6
4 3
3 5
10 6
9 2
7 5
1 8
7 8
1 2
view   save

correct output
(no output)
view   save

user output
1 10
2 3
3 4
4 5
5 6
6 7
7 9
8 9
9 10
view   save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
1
500
10 6
6 255
6 428
7 6
65 6
157 6
326 6
6 108
273 6
6 238
485 6
217 6
390 6
6 437
356 6
6 433
6 290
6 50
...
view   save

correct output
(no output)
view   save

user output
1 500
2 500
3 500
4 500
5 500
6 500
7 500
8 500
9 500
10 500
11 500
12 500
13 500
14 500
15 500
16 500
17 500
18 500
19 500
20 500
...
view   save

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
1
500
152 466
451 313
158 479
445 87
403 273
328 192
464 107
126 87
291 290
333 70
405 480
433 170
316 387
462 144
123 322
35 319
434 249
120 264
...
view   save

correct output
(no output)
view   save

user output
1 274
1 500
2 3
3 6
4 5
5 13
6 7
7 8
8 9
9 10
10 11
11 12
12 20
13 14
14 15
15 16
16 17
17 18
18 19
19 28
...
view   save

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

input
1
500
109 440
330 190
443 161
206 81
236 23
390 191
262 270
385 130
287 137
267 278
107 412
244 392
425 214
348 262
312 210
229 156
351 387
338 112
...
view   save

correct output
(no output)
view   save

user output
1 500
2 11
3 28
4 9
5 44
6 34
7 32
8 18
9 23
10 28
11 15
12 119
13 130
14 165
15 16
16 23
17 19
18 37
19 23
20 24
...
view   save

Test 15

Group: 2, 3

Verdict: WRONG ANSWER

input
1
500
144 373
257 233
341 318
156 159
185 13
53 470
432 16
308 263
94 302
136 297
197 323
294 347
168 268
41 455
32 330
380 276
266 91
269 187
...
view   save

correct output
(no output)
view   save

user output
1 389
1 500
2 226
3 4
4 31
5 28
6 20
7 10
8 415
9 14
10 68
11 167
12 46
13 49
14 301
15 97
16 257
17 77
18 65
19 20
...
view   save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
1
100000
54983 75172
93807 75172
44082 75172
75172 84824
75172 98997
79024 75172
55343 75172
57592 75172
75172 29633
11325 75172
75172 41154
75172 51632
75172 24616
23798 75172
84117 75172
97734 75172
26832 75172
75172 95396
...
view   save

correct output
(no output)
view   save

user output
(no output)
view   save

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
1
100000
88863 19059
86423 76688
98536 95984
96118 70092
42041 95469
79370 3245
54063 27564
50178 11587
37240 64983
68667 83518
62102 80017
74605 76124
78320 45225
17958 95419
89371 83327
85319 7806
80909 43525
22342 32749
...
view   save

correct output
(no output)
view   save

user output
(no output)
view   save

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
1
100000
59979 6389
19097 24999
27846 82330
55283 21756
29532 76920
36672 78591
29233 30968
57832 78477
12306 933
80589 51575
39875 33992
73514 87981
87593 82747
84257 40591
14068 71832
42219 46584
67446 46486
17079 27619
...
view   save

correct output
(no output)
view   save

user output
(no output)
view   save

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
1
100000
58761 66001
25102 51081
98625 67861
39627 96609
42728 51847
40036 50769
80361 62871
83736 23954
90511 8565
43281 75921
10718 47821
82970 98999
95998 88339
55110 1439
77175 25851
55051 6725
78592 78169
20243 17805
...
view   save

correct output
(no output)
view   save

user output
(no output)
view   save

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(no output)
view   save

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