CSES - NOI 2019 Open

CSES - NOI 2019 Open - Results

Submission details
Task:	Distance Code
Sender:	erimm
Submission time:	2019-03-09 16:33:18 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 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.02 s	1, 2, 3	details
#5	ACCEPTED	0.02 s	1, 2, 3	details
#6	ACCEPTED	0.01 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.01 s	1, 2, 3	details
#10	WRONG ANSWER	0.01 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	WRONG ANSWER	0.02 s	2, 3	details
#15	WRONG ANSWER	0.02 s	2, 3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	ACCEPTED	0.01 s	1, 2, 3	details

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<<' ';
			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
(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 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
(empty)

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
(empty)

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 ...` view save

correct output
(empty)

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 ...` view save

correct output
(empty)

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 ...` view save

correct output
(empty)

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 ...` view save

correct output
(empty)

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

Test 10

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 10 4 9 1 4 7 ...` view save

correct output
(empty)

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

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`1 500 2 11 3 28 4 9 5 44 ...` view save

Test 15

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`1 389 1 500 2 226 3 4 4 31 ...` view save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

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

NOI 2019 Open

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 (erimm)