Code Submission Evaluation System Login

NOI 2019 Open

Start:N/A
End:N/A
 

Tasks | Scoreboard | Statistics


CSES - NOI 2019 Open - Results
History
1:49:47100
1:43:280
Task:Distance Code
Sender:jakob_nogler
Submission time:2019-03-09 20:50:16
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32

Test results

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

Code

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

const int N = 100005;

vi t[N], r1;
vpii r2;
bool found;
int seq[N];

void dfs1(int v, int f){
    for(auto u : t[v])
        if(u != f)
            dfs1(u, v);
    r1.pb(v);
}

void dfs2(int v, int f, int d, int td, int new_v){
    if(td == d){
        found = true;
        r2.pb({v, new_v});
        t[v].pb(new_v);
        t[new_v].pb(v);
        return;
    }

    for(auto u : t[v]){
        if(u == v) continue;
        dfs2(u, v, d + 1, td, new_v);
        if(f) return;
    }
}

int main(){
    int k, n, a, b;
    cin >> k >> n;
    if(k == 1){
        for(int i = 0; i < n - 1; i++){
            cin >> a >> b;
            t[a].pb(b);
            t[b].pb(a);
        }
        dfs1(1, 0);
        for(auto u : r1) cout << u << " ";
        cout << endl;
        return 0;
    }

    for(int i = 0; i < n - 1; i++) cin >> seq[i];
    
    int cnt = 0;
    for(int i = n - 1; i >= 0; i--){
        found = false;
        dfs2(cnt, 0, 1, seq[i], cnt + 1);
        cnt++;
        
        
        //for(auto u : r2) cout << u.fi << " " << u.se << "\n";  
        //cout << "ok" << endl;
    }

    for(auto u : r2) cout << u.fi << " " << u.se << "\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: ACCEPTED

input
1
3
3 1
2 1

view   save

correct output
(empty)

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

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

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