CSES - NOI 2019 Open

CSES - NOI 2019 Open - Results

Submission details
Task:	Distance Code
Sender:	5n4
Submission time:	2019-03-08 19:45:56 +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.01 s	1, 2, 3	details
#2	ACCEPTED	0.03 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.03 s	1, 2, 3	details
#6	ACCEPTED	0.02 s	1, 2, 3	details
#7	ACCEPTED	0.02 s	1, 2, 3	details
#8	ACCEPTED	0.02 s	1, 2, 3	details
#9	ACCEPTED	0.02 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.03 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.03 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.05 s	3	details
#17	ACCEPTED	0.05 s	3	details
#18	ACCEPTED	0.07 s	3	details
#19	ACCEPTED	0.07 s	3	details
#20	ACCEPTED	0.04 s	1, 2, 3	details

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()()
    {
        int r = 1;
        for (int i = 1; i <= n; ++i)
            if (gra[i].size() > 1)
                r = i;
        dfs(r, r);
        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 last = 0;
    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());
        last = St.top();
        St.pop();
    }

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

        for (int i = 2; i <= n; ++i)
        {
            int v = cod[i];
            pop();
            if (St.size() == 1)
            {
                push();
                gra[St.top()].push_back(last);
            }
            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: ACCEPTED

input
`1 4 3 2 2 1 4 1` view save

correct output
(empty)

user output
`1 2 1 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 1 3 1 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 3 1 4 3 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 1 3 1 4 4 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 1 3 1 4 1 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 1 3 1 4 1 5 1 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 1 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 1 3 3 4 3 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 3 1 3 4 5 3 6 5 ...` 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 1 3 1 4 1 5 1 6 ...` Truncated

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 3 1 4 3 5 4 6 5 ...` Truncated

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 1 4 4 5 4 500 ...` Truncated

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 3 1 4 3 5 4 5 6 ...` Truncated

Test 16

Group: 3

Verdict: ACCEPTED

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 ...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 3 1 4 3 5 4 6 5 ...` Truncated

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 1 4 3 4 5 5 6 ...` Truncated

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 3 1 4 3 5 4 6 5 ...` Truncated

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 1 3 4 1 4 5 4 6` view save

NOI 2019 Open

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 (5n4)