Code Submission Evaluation System Login

NOI 2019 Open

Start:N/A
End:N/A
 

Tasks | Scoreboard | Statistics


CSES - NOI 2019 Open - Results
History
1:29:11100
Task:Distance Code
Sender:koosaga
Submission time:2019-03-10 06:22:03
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32

Test results

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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int t; scanf("%d",&t);
         ~~~~~^~~~~~~~~
input/code.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
input/code.cpp:27:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int s, e; scanf("%d %d",&s,&e);
              ~~~~~^~~~~~~~~~~~~~~
input/code.cpp:41:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int x; scanf("%d",&x);
           ~~~~~^~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 100005;

int n;
vector<int> gph[MAXN];
int par[MAXN];

void dfs(int x, int p){
	for(auto &i : gph[x]){
		if(i != p) dfs(i, x);
	}
	printf("%d ", x);
}

int main(){
	int t; scanf("%d",&t);
	scanf("%d",&n);
		if(n == 2){
			puts("1 2");
			return 0;
		}
	if(t == 1){
		for(int i=0; i<n-1; i++){
			int s, e; scanf("%d %d",&s,&e);
			gph[s].push_back(e);
			gph[e].push_back(s);
		}
		for(int i=1; i<=n; i++){
			if(gph[i].size() > 1){
				dfs(i, -1);
				return 0;
			}
		}
	}
	else{
		int cnode = 1, piv = 1;
		for(int i=1; i<n; i++){
			int x; scanf("%d",&x);
			if(!par[cnode]) par[cnode] = ++piv;
			cnode = par[cnode];
			if(x > 1){
				for(int j=0; j<x-1; j++){
					++piv;
					par[piv] = cnode;
					cnode = piv;
				}
			}
		}
		for(int i=1; i<=n; i++){
			if(par[i]) printf("%d %d\n", i, par[i]);
		}
	}
}

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
3 2

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
4 3

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
3 2
4 2

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
4 3
5 4

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
3 2
4 3
5 3

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
3 2
4 2
5 2

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
3 2
4 2
5 2
6 2
...
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: ACCEPTED

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

correct output
(empty)

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

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

correct output
(empty)

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

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
5 6
...
view   save

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

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

correct output
(empty)

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

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
5 6
...
view   save

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