oj.uz

Submission #483045

# Submission time Handle Problem Language Result Execution time Memory
483045 2021-10-27T14:55:32 Z blue Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 730 ms 74744 KB 
#include "railroad.h"
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <iostream>
using namespace std;

const int INF = 1'000'000'001;

int N;

set<int> pos;
map<int, int> norm;
vector<int> act;

int K;




struct ds
{
    int Z;
    vector<int> parent;
    vector<int> subtree;
    vector<int> mx;
    vector<int> mn;

    ds()
    {
        ;
    }

    ds(int Z_)
    {
        Z = Z_;
        parent = vector<int>(Z);
        subtree = vector<int>(Z, 1);
        mx = vector<int>(Z);
        mn = vector<int>(Z);
        for(int i = 0; i < Z; i++) parent[i] = mx[i] = mn[i] = i;
    }

    int root(int u)
    {
        if(parent[u] == u) return u;
        parent[u] = root(parent[u]);
        return parent[u];
    }

    bool connected(int u, int v)
    {
        return root(u) == root(v);
    }

    void join(int u, int v)
    {
        u = root(u);
        v = root(v);

        if(u == v) return;

        if(subtree[u] < subtree[v]) swap(u, v);

        parent[v] = u;
        subtree[u] += subtree[v];
        mx[u] = max(mx[u], mx[v]);
        mn[u] = min(mn[u], mn[v]);
    }
};


long long plan_roller_coaster(vector<int> s, vector<int> t)
{
    s.push_back(INF);
    t.push_back(1);

    N = int(s.size());

    for(int i = 0; i < N; i++)
    {
        pos.insert(s[i]);
        pos.insert(t[i]);
    }

    int ct = -1;

    for(int p: pos)
    {
        ct++;
        norm[p] = ct;
        act.push_back(p);
    }

    K = 1+ct;

    ds DSU(K);

    for(int i = 0; i < N; i++)
    {
        s[i] = norm[s[i]];
        t[i] = norm[t[i]];

        // DSU.join(s[i], t[i]);
    }

    // for(int i = 0; i < K; i++) cerr << i << ' ' << act[i] << '\n';

    vector<int> indegree(K, 0), outdegree(K, 0);
    for(int i = 0; i < N; i++)
    {
        outdegree[s[i]]++;
        indegree[t[i]]++;
    }

    set<int> positive, negative;
    for(int i = 0; i < K; i++)
    {
        if(outdegree[i] > indegree[i])
            positive.insert(i);
        else if(outdegree[i] < indegree[i])
            negative.insert(i);
    }

    // cerr << "positive: ";
    // for(int p: positive) cerr << p << ' ';
    // cerr << '\n';
    //
    // cerr << "negative: ";
    // for(int n: negative) cerr << n << ' ';
    // cerr << '\n';

    long long ans = 0;
    while(!positive.empty())
    {
        int p = *positive.begin();
        int n = *negative.begin();

        // cerr << p << ' ' << n << '\n';

        int a = min(p, n);
        int b = max(p, n);
        while(1)
        {
            a = DSU.root(a);
            if(DSU.mx[a] >= b) break;
            DSU.join(a, DSU.mx[a]+1);
        }
        // DSU.join(p, n);
        if(n > p) ans += act[n] - act[p];
        outdegree[n]++;
        indegree[p]++;

        // cerr << "extra edge " << n << ' ' << p << '\n';
        // cerr << "ans = " << ans << '\n';

        if(outdegree[n] - indegree[n] == 0) negative.erase(n);
        if(indegree[p] - outdegree[p] == 0) positive.erase(p);
    }

    for(int i = 0; i < N; i++) DSU.join(s[i], t[i]);

    // cerr << "DSU: ";
    // for(int i = 0; i < K; i++) cerr << i << ' ' << DSU.root(i) << '\n';

    vector< pair<int, int> > H;
    for(int i = 0; i+1 < K; i++) H.push_back(make_pair(i, i+1));

    sort(H.begin(), H.end(), [] (pair<int, int> g, pair<int, int> h)
    {
        return act[g.second] - act[g.first] < act[h.second] - act[h.first];
    });

    for(pair<int, int> h: H)
    {
        if(!DSU.connected(h.first, h.second))
        {
            ans += act[h.second] - act[h.first];
            DSU.join(h.first, h.second);
        }
    }

    // ans += INF;

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 0 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 284 KB n = 3
8 Correct 0 ms 204 KB n = 3
9 Correct 0 ms 204 KB n = 3
10 Correct 0 ms 284 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 0 ms 204 KB n = 8
18 Correct 0 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 0 ms 204 KB n = 8
24 Correct 0 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 0 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 284 KB n = 3
8 Correct 0 ms 204 KB n = 3
9 Correct 0 ms 204 KB n = 3
10 Correct 0 ms 284 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 0 ms 204 KB n = 8
18 Correct 0 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 0 ms 204 KB n = 8
24 Correct 0 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8
26 Correct 0 ms 204 KB n = 8
27 Correct 0 ms 204 KB n = 8
28 Correct 0 ms 204 KB n = 8
29 Correct 1 ms 292 KB n = 16
30 Correct 1 ms 204 KB n = 16
31 Correct 0 ms 204 KB n = 16
32 Correct 0 ms 204 KB n = 16
33 Correct 0 ms 204 KB n = 16
34 Correct 0 ms 204 KB n = 16
35 Correct 0 ms 204 KB n = 16
36 Correct 0 ms 204 KB n = 15
37 Correct 0 ms 296 KB n = 8
38 Correct 0 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 0 ms 204 KB n = 9
41 Correct 0 ms 204 KB n = 16
42 Correct 1 ms 204 KB n = 16
43 Correct 0 ms 204 KB n = 16
44 Correct 0 ms 204 KB n = 9
45 Correct 0 ms 204 KB n = 15
46 Correct 0 ms 204 KB n = 16
47 Correct 0 ms 204 KB n = 16
48 Correct 0 ms 204 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 74608 KB n = 199999
2 Correct 706 ms 74520 KB n = 199991
3 Correct 685 ms 74528 KB n = 199993
4 Correct 493 ms 56480 KB n = 152076
5 Correct 242 ms 34956 KB n = 93249
6 Correct 525 ms 60064 KB n = 199910
7 Correct 566 ms 72220 KB n = 199999
8 Correct 489 ms 60312 KB n = 199997
9 Correct 559 ms 63768 KB n = 171294
10 Correct 425 ms 52552 KB n = 140872
11 Correct 545 ms 61076 KB n = 199886
12 Correct 580 ms 72864 KB n = 199996
13 Correct 503 ms 63264 KB n = 200000
14 Correct 551 ms 72124 KB n = 199998
15 Correct 540 ms 70944 KB n = 200000
16 Correct 558 ms 73760 KB n = 199998
17 Correct 678 ms 74648 KB n = 200000
18 Correct 611 ms 70800 KB n = 190000
19 Correct 576 ms 66256 KB n = 177777
20 Correct 262 ms 37464 KB n = 100000
21 Correct 671 ms 74580 KB n = 200000
22 Correct 681 ms 74528 KB n = 200000
23 Correct 730 ms 74660 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 0 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 284 KB n = 3
8 Correct 0 ms 204 KB n = 3
9 Correct 0 ms 204 KB n = 3
10 Correct 0 ms 284 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 0 ms 204 KB n = 8
18 Correct 0 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 0 ms 204 KB n = 8
24 Correct 0 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8
26 Correct 0 ms 204 KB n = 8
27 Correct 0 ms 204 KB n = 8
28 Correct 0 ms 204 KB n = 8
29 Correct 1 ms 292 KB n = 16
30 Correct 1 ms 204 KB n = 16
31 Correct 0 ms 204 KB n = 16
32 Correct 0 ms 204 KB n = 16
33 Correct 0 ms 204 KB n = 16
34 Correct 0 ms 204 KB n = 16
35 Correct 0 ms 204 KB n = 16
36 Correct 0 ms 204 KB n = 15
37 Correct 0 ms 296 KB n = 8
38 Correct 0 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 0 ms 204 KB n = 9
41 Correct 0 ms 204 KB n = 16
42 Correct 1 ms 204 KB n = 16
43 Correct 0 ms 204 KB n = 16
44 Correct 0 ms 204 KB n = 9
45 Correct 0 ms 204 KB n = 15
46 Correct 0 ms 204 KB n = 16
47 Correct 0 ms 204 KB n = 16
48 Correct 0 ms 204 KB n = 16
49 Correct 702 ms 74608 KB n = 199999
50 Correct 706 ms 74520 KB n = 199991
51 Correct 685 ms 74528 KB n = 199993
52 Correct 493 ms 56480 KB n = 152076
53 Correct 242 ms 34956 KB n = 93249
54 Correct 525 ms 60064 KB n = 199910
55 Correct 566 ms 72220 KB n = 199999
56 Correct 489 ms 60312 KB n = 199997
57 Correct 559 ms 63768 KB n = 171294
58 Correct 425 ms 52552 KB n = 140872
59 Correct 545 ms 61076 KB n = 199886
60 Correct 580 ms 72864 KB n = 199996
61 Correct 503 ms 63264 KB n = 200000
62 Correct 551 ms 72124 KB n = 199998
63 Correct 540 ms 70944 KB n = 200000
64 Correct 558 ms 73760 KB n = 199998
65 Correct 678 ms 74648 KB n = 200000
66 Correct 611 ms 70800 KB n = 190000
67 Correct 576 ms 66256 KB n = 177777
68 Correct 262 ms 37464 KB n = 100000
69 Correct 671 ms 74580 KB n = 200000
70 Correct 681 ms 74528 KB n = 200000
71 Correct 730 ms 74660 KB n = 200000
72 Correct 724 ms 74744 KB n = 200000
73 Correct 698 ms 74656 KB n = 200000
74 Correct 716 ms 74648 KB n = 200000
75 Correct 694 ms 74528 KB n = 200000
76 Correct 662 ms 74576 KB n = 200000
77 Correct 288 ms 34724 KB n = 200000
78 Correct 309 ms 34596 KB n = 200000
79 Correct 627 ms 68492 KB n = 184307
80 Correct 190 ms 28520 KB n = 76040
81 Correct 562 ms 61208 KB n = 199981
82 Correct 585 ms 72708 KB n = 199994
83 Correct 509 ms 63252 KB n = 199996
84 Correct 546 ms 72224 KB n = 199998
85 Correct 554 ms 70884 KB n = 200000
86 Correct 567 ms 73760 KB n = 199998
87 Correct 709 ms 74588 KB n = 200000
88 Correct 667 ms 74612 KB n = 200000
89 Correct 682 ms 74636 KB n = 200000
90 Correct 635 ms 74568 KB n = 200000
91 Correct 681 ms 74528 KB n = 200000
92 Correct 729 ms 74656 KB n = 200000