CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Gustav Kalander
Submission time:	2019-03-06 11:40:53 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	47
#3	ACCEPTED	32

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.02 s	1, 2, 3	details
#3	ACCEPTED	0.02 s	1, 2, 3	details
#4	ACCEPTED	0.02 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.03 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.02 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.05 s	3	details
#17	ACCEPTED	0.06 s	3	details
#18	ACCEPTED	0.06 s	3	details
#19	ACCEPTED	0.05 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
const int inf = 0x3f3f3f3f;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
#define debug(x) cerr << #x << " = " << x << endl

int n;
vvi adj;

void edfs(int node, int par){
    for(auto x : adj[node]){
        if(x != par) edfs(x, node);
    }
    cout << node+1;
    if(node != 0) cout << " ";
}

void encoder(){
    adj = vvi(n);
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin >> a >> b;
        a--,b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    edfs(0, -1);
    cout << "\n";
}


struct node{
    node* parent = 0;
    vector<node*> children;
    int id;
};

int nodeid = 1;
void ddfs(node* n){
    n->id = nodeid;
    nodeid++;
    for(auto x : n->children){
        ddfs(x);
    }
    if(n->parent){
        cout << n->parent->id << " " << n->id << "\n";
    }
}

void decoder(){
    vi a(n-1);
    for(int i = 0; i < n-1; i++) cin >> a[i];
    node* c = new node();
    for(int i = 0; i < n-1; i++){
        if(!c->parent){
            c->parent = new node();
            c->parent->children.push_back(c);
        }
        c = c->parent;
        for(int j = 0; j < a[i]-1; j++){
            c->children.push_back(new node());
            c->children[c->children.size()-1]->parent = c;
            c = c->children[c->children.size()-1];
        }
    }
    ddfs(c);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t >> n;
    if(t == 1) encoder();
    else decoder();
}

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
`2 3 1 2 1 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
`2 3 2 4 1 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
`2 3 1 2 4 5 1 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 4 3 5 1 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
`2 3 2 4 2 5 1 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
`2 3 2 4 2 5 2 6 2 7 ...` 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
`6 7 5 6 4 5 3 4 2 3 ...` 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 4 1 3 5 6 9 10 ...` 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
`5 6 4 5 3 4 2 3 1 2 ...` 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
`2 3 2 4 2 5 2 6 2 7 ...` 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
`350 351 349 350 348 349 347 348 346 347 ...` 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 4 5 7 8 10 11 9 10 ...` 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
`6 7 5 6 4 5 3 4 2 3 ...` view save

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 3 2 4 2 5 2 6 2 7 ...` view save

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`34232 34233 34231 34232 34230 34231 34229 34230 34228 34229 ...` 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 4 5 6 7 8 9 6 8 ...` view save

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`26 27 25 26 24 25 23 24 22 23 ...` 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
`3 4 3 5 2 3 2 6 1 2` view save

NOI 2019

Distance Code

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Gustav Kalander)