Code Submission Evaluation System Login

NOI 2019 Open

Start:N/A
End:N/A
 

Tasks | Scoreboard | Statistics


CSES - NOI 2019 Open - Results
History
0:27:00100
Task:Distance Code
Sender:return_my_2007
Submission time:2019-03-10 15:27:34
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.02 / 1.001, 2, 3details
#4ACCEPTED0.03 / 1.001, 2, 3details
#5ACCEPTED0.02 / 1.001, 2, 3details
#6ACCEPTED0.02 / 1.001, 2, 3details
#7ACCEPTED0.02 / 1.001, 2, 3details
#8ACCEPTED0.02 / 1.001, 2, 3details
#9ACCEPTED0.02 / 1.001, 2, 3details
#10ACCEPTED0.01 / 1.001, 2, 3details
#11ACCEPTED0.03 / 1.001, 2, 3details
#12ACCEPTED0.02 / 1.002, 3details
#13ACCEPTED0.03 / 1.002, 3details
#14ACCEPTED0.01 / 1.002, 3details
#15ACCEPTED0.02 / 1.002, 3details
#16ACCEPTED0.05 / 1.003details
#17ACCEPTED0.06 / 1.003details
#18ACCEPTED0.05 / 1.003details
#19ACCEPTED0.05 / 1.003details
#20ACCEPTED0.02 / 1.001, 2, 3details

Code

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n;
vector <int> g[N];
vector <int> top;
void dfs(int u, int p) {
    for (int v : g[u]) {
        if (v != p) dfs(v, u);
    }   
    top.push_back(u);
}   
void coder() {
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        --u; --v;
        g[u].push_back(v); g[v].push_back(u);
    }   
    dfs(0, 0);
    for (int e : top) cout << e + 1 << ' ';
    cout << '\n';
}
int ptr = 1;
int par[N];
void encoder() {
    cin >> n;
    for (int i = 0; i < n; ++i) par[i] = -1;
    int u = 0;
    for (int i = 0; i < n - 1; ++i) {
        int d; cin >> d;
        if (d == 1) {
            if (par[u] == -1) {
                par[u] = ptr++;
                cout << u + 1 << ' ' << par[u] + 1 << '\n';
            }
            u = par[u];   
        }
        else {
            if (par[u] == -1) {
                par[u] = ptr++;
                cout << u + 1 << ' ' << par[u] + 1 << '\n';
            }   
            u = par[u];
            for (int j = 0; j < d - 1; ++j) {
                cout << u + 1 << ' ' << ptr + 1 << '\n';
                par[ptr] = u;
                u = ptr;
                ++ptr;
            }   
        }   
    }   
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int t;
    cin >> t;
    if (t == 1) {
        coder();
    }
    else {
        encoder();
    }   
}

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