— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
Submission details
Task:Distance Code
Sender:erimm
Submission time:2019-03-09 16:48:32 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.03 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.03 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#100.01 s1, 2, 3details
#11ACCEPTED0.03 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#140.03 s2, 3details
#150.02 s2, 3details
#16--3details
#17--3details
#18--3details
#19--3details
#20ACCEPTED0.02 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:90: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<vector<int>> distances;
		for(int i=0; i<n; i++){
			vector<int> temp(n, -n-1);
			temp[i]=0;
			distances.push_back(temp);
		}
		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=i+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:

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
...
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 274
1 500
2 3
3 6
4 5
...
Truncated

Test 14

Group: 2, 3

Verdict:

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

Test 15

Group: 2, 3

Verdict:

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

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict:

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

Tasks

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

Submissions (erimm)

2019-03-10 14:35:33 212:17:59 02:02:45 01:55:55 01:45:28 01:21:58 00:41:46 0