— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Fredrik Ekholm
Submission time:2019-03-06 11:35:17 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#11ACCEPTED0.03 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.01 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.03 s2, 3details
#16ACCEPTED0.14 s3details
#17ACCEPTED0.15 s3details
#18ACCEPTED0.14 s3details
#19ACCEPTED0.14 s3details
#20ACCEPTED0.01 s1, 2, 3details

Compiler report

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from input/code.cpp:1:
input/code.cpp: In function 'void decode()':
input/code.cpp:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(p.size()==n);
            ~~~~~~~~^~~

Code

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(ll i = a; i < ll(b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;

ll n;
vector<vi> e;


void getPostorder(ll v, ll l){
    rep(i,0,e[v].size())
        if(e[v][i]!=l) getPostorder(e[v][i],v);
    cout<<v+1<<" ";
}

void encode(){
    e.resize(n);
    rep(i,0,n-1){
        ll a,b;
        cin>>a>>b;
        --a; --b;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    getPostorder(0,-1);
    cout<<endl;
}

vi p;
vector<vi> c;

ll parent(ll v){
    if(p[v]==-1){
        p[v] = p.size();
        p.push_back(-1);
        c.push_back(vi(1,v));
    }
    return p[v];
}

ll children(ll v,ll d){
    if(d==0) return v;
    ll newChild = p.size();
    c[v].push_back(newChild);
    p.push_back(v);
    c.push_back(vi(0));
    return children(newChild, d-1);
}

void decode(){
    ll v = 0;
    p.push_back(-1);
    c.push_back(vi(0));
    rep(i,0,n-1){
        ll dist; cin>>dist;
        v = parent(v);
        v = children(v,dist-1);
    }

    assert(p.size()==n);

    rep(i,0,n){
        if(p[i]!=-1){
            cout<<i+1<<" "<<p[i]+1<<endl;
        }
    }
}

int main() {
    cin.sync_with_stdio(0); cin.tie(0);
    cin.exceptions(cin.failbit);
    ll t;
    cin>>t>>n;
    if(t==1) encode();
    else decode();
}

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

Tasks

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

Submissions (Fredrik Ekholm)

2019-03-06 11:35:17 100