oj.uz

Submission #547017

# Submission time Handle Problem Language Result Execution time Memory
547017 2022-04-09T07:56:24 Z fvogel499 Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 1349 ms 137024 KB 
/*
 * File created on 04/08/2022 at 21:58:56.
 * Link to problem: 
 * Description: 
 * Time complexity: O()
 * Space complexity: O()
 * Status: ---
 * Copyright: Ⓒ 2022 Francois Vogel
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>

using namespace std;
using namespace __gnu_pbds;

#define mp pair<int, pii>
#define pii pair<int, int>
#define f first
#define s second

#define vi vector<int>
#define all(x) x.begin(), x.end()
#define size(x) (int)((x).size())
#define pb push_back
#define ins insert
#define cls clear

#define int ll
#define ll long long
#define ld long double

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int* par;

int gp(int x) {
    return par[x] == x ? x : par[x] = gp(par[x]);
}

void merge(int x, int y) {
    x = gp(x);
    y = gp(y);
    if (x == y) return;
    par[y] = x;
}

int plan_roller_coaster_act(vi from, vi to) {
    set<int> av;
    for (int i : from) av.ins(i);
    for (int i : to) av.ins(i);
    map<int, int> compress;
    int kc = 0;
    for (int i : av) compress[i] = kc++;
    map<int, int> decompress;
    for (auto i : compress) decompress[i.s] = i.f;
    for (int i = 0; i < size(from); i++) from[i] = compress[from[i]];
    for (int i = 0; i < size(to); i++) to[i] = compress[to[i]];
    int n = size(compress);
    vi graph [n];
    vi revG [n];
    for (int i = 0; i < size(from); i++) {
        graph[from[i]].pb(to[i]);
        revG[to[i]].pb(from[i]);
    }
    int res = 0;
    int sum = 0;
    for (int i = 0; i < n-1; i++) {
        sum += size(graph[i])-size(revG[i]);
        if (sum > 1) {
            res += (sum-1LL)*(decompress[i+1]-decompress[i]);
        }
        for (int j = 1; j > sum; j--) {
            sum++;
            graph[i].pb(i+1);
            revG[i+1].pb(i);
            break;
        }
        for (int j = 1; j < sum; j++) {
            sum--;
            graph[i+1].pb(i);
            revG[i].pb(i+1);
            break;
        }
    }
    int comp [n];
    for (int i = 0; i < n; i++) comp[i] = -1;
    int nbComps = 0;
    for (int i = 0; i < n; i++) if (comp[i] == -1) {
        queue<int> q;
        q.push(i);
        comp[i] = nbComps;
        while (!q.empty()) {
            int x = q.front();
            q.pop();
            for (int y : graph[x]) if (comp[y] == -1) {
                comp[y] = nbComps;
                q.push(y);
            }
            for (int y : revG[x]) if (comp[y] == -1) {
                comp[y] = nbComps;
                q.push(y);
            }
        }
        nbComps++;
    }
    vector<mp> edges;
    for (int i = 0; i < n-1; i++) if (comp[i] != comp[i+1]) edges.pb(mp(decompress[i+1]-decompress[i], pii(comp[i], comp[i+1])));
    sort(all(edges));
    par = new int [nbComps];
    for (int i = 0; i < nbComps; i++) par[i] = i;
    for (mp i : edges) if (gp(i.s.f) != gp(i.s.s)) {
        merge(i.s.f, i.s.s);
        res += i.f;
    }
    return res;
}

int plan_roller_coaster(vector<signed> from, vector<signed> to) {
    vi ifrom, ito;
    for (int i : from) ifrom.pb(i);
    for (int i : to) ito.pb(i);
    return plan_roller_coaster_act(ifrom, ito);
}

// signed main() {
//     cin.tie(0);
//     ios_base::sync_with_stdio(0);

//     int n;
//     cin >> n;
//     vector<signed> from(n), to(n);
//     for (int i = 0; i < n; i++) cin >> from[i];
//     for (int i = 0; i < n; i++) cin >> to[i];
//     cout << plan_roller_coaster(from, to) << endl;

//     cout.flush();
//     int d = 0;
//     d++;
// }

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1203 ms 126360 KB n = 199999
2 Correct 1271 ms 126480 KB n = 199991
3 Correct 1349 ms 126348 KB n = 199993
4 Correct 875 ms 96036 KB n = 152076
5 Correct 420 ms 59068 KB n = 93249
6 Correct 979 ms 105112 KB n = 199910
7 Correct 1085 ms 123128 KB n = 199999
8 Correct 969 ms 105724 KB n = 199997
9 Correct 949 ms 107728 KB n = 171294
10 Correct 692 ms 89168 KB n = 140872
11 Correct 976 ms 106660 KB n = 199886
12 Correct 1053 ms 123816 KB n = 199996
13 Correct 1010 ms 110148 KB n = 200000
14 Correct 1087 ms 125808 KB n = 199998
15 Correct 1107 ms 123960 KB n = 200000
16 Correct 1119 ms 127696 KB n = 199998
17 Correct 969 ms 125624 KB n = 200000
18 Correct 1074 ms 119484 KB n = 190000
19 Correct 782 ms 111604 KB n = 177777
20 Correct 423 ms 63000 KB n = 100000
21 Correct 1132 ms 125976 KB n = 200000
22 Correct 1121 ms 133412 KB n = 200000
23 Correct 1075 ms 125556 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 1 ms 212 KB n = 16
43 Correct 0 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 1 ms 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 1203 ms 126360 KB n = 199999
50 Correct 1271 ms 126480 KB n = 199991
51 Correct 1349 ms 126348 KB n = 199993
52 Correct 875 ms 96036 KB n = 152076
53 Correct 420 ms 59068 KB n = 93249
54 Correct 979 ms 105112 KB n = 199910
55 Correct 1085 ms 123128 KB n = 199999
56 Correct 969 ms 105724 KB n = 199997
57 Correct 949 ms 107728 KB n = 171294
58 Correct 692 ms 89168 KB n = 140872
59 Correct 976 ms 106660 KB n = 199886
60 Correct 1053 ms 123816 KB n = 199996
61 Correct 1010 ms 110148 KB n = 200000
62 Correct 1087 ms 125808 KB n = 199998
63 Correct 1107 ms 123960 KB n = 200000
64 Correct 1119 ms 127696 KB n = 199998
65 Correct 969 ms 125624 KB n = 200000
66 Correct 1074 ms 119484 KB n = 190000
67 Correct 782 ms 111604 KB n = 177777
68 Correct 423 ms 63000 KB n = 100000
69 Correct 1132 ms 125976 KB n = 200000
70 Correct 1121 ms 133412 KB n = 200000
71 Correct 1075 ms 125556 KB n = 200000
72 Correct 1112 ms 130340 KB n = 200000
73 Correct 1207 ms 130360 KB n = 200000
74 Correct 1187 ms 130284 KB n = 200000
75 Correct 971 ms 129296 KB n = 200000
76 Correct 895 ms 129564 KB n = 200000
77 Correct 708 ms 71436 KB n = 200000
78 Correct 726 ms 79140 KB n = 200000
79 Correct 1054 ms 119536 KB n = 184307
80 Correct 314 ms 49864 KB n = 76040
81 Correct 962 ms 109404 KB n = 199981
82 Correct 1094 ms 126892 KB n = 199994
83 Correct 988 ms 112928 KB n = 199996
84 Correct 1106 ms 128972 KB n = 199998
85 Correct 1049 ms 127024 KB n = 200000
86 Correct 1128 ms 131168 KB n = 199998
87 Correct 976 ms 129340 KB n = 200000
88 Correct 1184 ms 129404 KB n = 200000
89 Correct 890 ms 129564 KB n = 200000
90 Correct 1178 ms 129804 KB n = 200000
91 Correct 1129 ms 137024 KB n = 200000
92 Correct 1102 ms 129312 KB n = 200000