— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:jakob_nogler
Submission time:2019-03-09 20:43:57 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.02 s1, 2, 3details
#30.02 s1, 2, 3details
#40.01 s1, 2, 3details
#50.03 s1, 2, 3details
#60.03 s1, 2, 3details
#70.03 s1, 2, 3details
#80.02 s1, 2, 3details
#90.01 s1, 2, 3details
#100.02 s1, 2, 3details
#110.02 s1, 2, 3details
#120.03 s2, 3details
#130.02 s2, 3details
#140.02 s2, 3details
#150.03 s2, 3details
#160.05 s3details
#170.07 s3details
#180.07 s3details
#190.07 s3details
#200.01 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:62:36: warning: operation on 'cnt' may be undefined [-Wsequence-point]
         dfs2(cnt, 0, 1, seq[i], cnt++);
                                 ~~~^~

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 = 1;
    for(int i = n - 1; i >= 0; i--){
        found = false;
        dfs2(cnt, 0, 1, seq[i], cnt++);
    }

    for(auto u : r2) cout << u.fi << " " << u.se << "\n";   
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
1
2
2 1
view save

correct output
(empty)

user output
3 2
view save

Test 2

Group: 1, 2, 3

Verdict:

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
3 2
view save

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
3 2
5 4
view save

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
3 2
4 3
view save

Test 5

Group: 1, 2, 3

Verdict:

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
3 2
4 3
6 5
view save

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
view save

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
view save

Test 8

Group: 1, 2, 3

Verdict:

input
1
10
9 3
8 9
2 9
...
view save

correct output
(empty)

user output
3 2
4 3
view save

Test 9

Group: 1, 2, 3

Verdict:

input
1
10
9 2
5 8
7 1
...
view save

correct output
(empty)

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

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

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

Test 12

Group: 2, 3

Verdict:

input
1
500
10 6
6 255
6 428
...
view save

correct output
(empty)

user output
3 2
4 3
view save

Test 13

Group: 2, 3

Verdict:

input
1
500
152 466
451 313
158 479
...
view save

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
view save

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 19

Group: 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
5 4
6 5
7 6
...
Truncated

Test 20

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
3 2
4 3
6 5
view save

Tasks

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

Submissions (jakob_nogler)

1:49:47 1001:43:28 0