— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:5n4
Submission time:2019-03-08 19:24:46 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#30.02 s1, 2, 3details
#40.03 s1, 2, 3details
#50.03 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#90.02 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#110.03 s1, 2, 3details
#120.03 s2, 3details
#130.03 s2, 3details
#14ACCEPTED0.02 s2, 3details
#150.02 s2, 3details
#160.05 s3details
#170.03 s3details
#18ACCEPTED0.07 s3details
#190.03 s3details
#200.03 s1, 2, 3details

Code

#include <bits/stdc++.h>

constexpr int nax = 1e5;

using namespace std;
using Graph = array< vector< int >, nax + 1 >;
using Code = array< int, nax + 1 >;

struct Encode
{
    const int n; 
    const Graph& gra;

    int t = 0;
    Code pos;

    Encode(const int n, const Graph& gra) : n(n), gra(gra) {}

    Code operator()()
    {
        dfs(1, 1);
        return pos;
    }

    void dfs(int v, int oj)
    {
        for (int s : gra[v])
            if (s != oj)
                dfs(s, v);

        pos[++t] = v;
    }
};

struct Decode
{
    const int n;
    const Code& cod;

    int pt = 0;
    stack< int > St;
    Graph gra;

    Decode(const int n, const Code& cod) : n(n), cod(cod) 
    {
        St.push(0);
    }

    void push(int cnt = 1)
    {
        //assert(not St.empty());
        //cerr << cnt << '\n';
        while (cnt--)
        {
            int t = St.top();
            St.push(++pt);
            gra[t].push_back(pt);
        }
    }

    void pop()
    {
        //cerr << -1 << '\n';
        //assert(not St.empty());
        St.pop();
    }

    Graph operator()()
    {
        push(2);

        for (int i = 2; i <= n; ++i)
        {
            int v = cod[i];
            pop();
            push(v - 1);
        }

        return gra;
    }
};

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

    int t;
    cin >> t;
    if (t == 1)
    {
        int n; cin >> n;
        Graph gra;

        for (int i = 0; i < n - 1; ++i)
        {
            int p, q; cin >> p >> q;
            gra[p].push_back(q);
            gra[q].push_back(p);
        }

        Code cod = Encode(n, gra)();

        for (int i = 1; i <= n; ++i)
            cout << cod[i] << ' ';

        cout << '\n';
    }
    if (t == 2)
    {
        int n; cin >> n;
        Code cod;

        for (int i = 2; i <= n; ++i)
            cin >> cod[i];

        Graph gra = Decode(n, cod)();

        for (int i = 1; i <= n; ++i)
            for (int s : gra[i])
                cout << i << ' ' << s << '\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:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
1 2
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
1 2
1 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
1 2
3 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
1 3
3 4
3 5
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
1 2
1 3
1 4
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
1 2
1 3
1 4
1 5
1 6
...
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
(empty)

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
1 3
1 5
3 4
5 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
(empty)

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
1 2
1 3
1 4
1 5
1 6
...
view save

Test 13

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

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
1 3
3 4
3 495
3 496
...
view save

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
1 2
1 3
1 4
1 5
1 6
...
view save

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
1 2
1 3
3 4
4 5
4 6
...
view save

Test 19

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
1 2
1 3
view save

Tasks

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

Submissions (5n4)

2:26:12 1002:05:02 0