oj.uz

Submission #609747

# Submission time Handle Problem Language Result Execution time Memory
609747 2022-07-27T20:32:36 Z strange420 Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 148 ms 24436 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

#define MAXN 500000

int p[MAXN];
struct info {
    int val;
    int index;
    int edgeType;

    info(int a, int b, int c) {
        val = a;
        index = b;
        edgeType = c;
    }

    bool operator <(const info& x) {
        return val < x.val;
    }
};
struct edge {
    int s; int e; int cost;
    edge(int start, int end, int c) {
        s = start;
        e = end;
        cost = c;
    }

    bool operator <(const edge& x) {
        return cost < x.cost;
    }
};


int find(int x) {
    return p[x] == x ? x : p[x] = find(p[x]);
}

bool merge(int x, int y) {
    x = find(x); y = find(y);
    p[x] = y;
    return x != y;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    s.push_back(1e9+1);
    t.push_back(1);
    int n = (int) s.size();

    vector<info> asd;
    for (int i=0; i<n; i++) {
        p[i] = i;
        asd.emplace_back(s[i], i, 1);
        asd.emplace_back(t[i], i, -1);
    }
    sort(asd.begin(), asd.end());

    long long ans = 0;
    vector<edge> edges;
    for (int i=0, diff=0; i<2*n-1; i++) {   // Looking at the next segment (i, i+1)
        diff += asd[i].edgeType;
        ans += 1LL * (asd[i+1].val - asd[i].val) * max(diff, 0);
        edges.emplace_back(asd[i].index, asd[i+1].index, asd[i+1].val - asd[i].val);
        if (diff != 0) {
            merge(asd[i].index, asd[i+1].index);
        }
    }

    sort(edges.begin(), edges.end());
    for (int i=0; i<2*n; i++)
        if (merge(edges[i].s, edges[i].e))
            ans += 1LL * edges[i].cost;

    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 340 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 1 ms 308 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 1 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 0 ms 308 KB n = 16
35 Correct 1 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 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 212 KB n = 16
42 Correct 0 ms 300 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 0 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 148 ms 20624 KB n = 199999
2 Correct 145 ms 21912 KB n = 199991
3 Correct 137 ms 22028 KB n = 199993
4 Correct 100 ms 18700 KB n = 152076
5 Correct 66 ms 10720 KB n = 93249
6 Correct 108 ms 20872 KB n = 199910
7 Correct 117 ms 21280 KB n = 199999
8 Correct 111 ms 20908 KB n = 199997
9 Correct 113 ms 19984 KB n = 171294
10 Correct 96 ms 18300 KB n = 140872
11 Correct 109 ms 20892 KB n = 199886
12 Correct 120 ms 21388 KB n = 199996
13 Correct 115 ms 20876 KB n = 200000
14 Correct 124 ms 21208 KB n = 199998
15 Correct 121 ms 21164 KB n = 200000
16 Correct 131 ms 21536 KB n = 199998
17 Correct 131 ms 24312 KB n = 200000
18 Correct 130 ms 21512 KB n = 190000
19 Correct 121 ms 22600 KB n = 177777
20 Correct 64 ms 11060 KB n = 100000
21 Correct 129 ms 21916 KB n = 200000
22 Correct 125 ms 22136 KB n = 200000
23 Correct 114 ms 22012 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 340 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 1 ms 308 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 1 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 0 ms 308 KB n = 16
35 Correct 1 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 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 212 KB n = 16
42 Correct 0 ms 300 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 0 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 148 ms 20624 KB n = 199999
50 Correct 145 ms 21912 KB n = 199991
51 Correct 137 ms 22028 KB n = 199993
52 Correct 100 ms 18700 KB n = 152076
53 Correct 66 ms 10720 KB n = 93249
54 Correct 108 ms 20872 KB n = 199910
55 Correct 117 ms 21280 KB n = 199999
56 Correct 111 ms 20908 KB n = 199997
57 Correct 113 ms 19984 KB n = 171294
58 Correct 96 ms 18300 KB n = 140872
59 Correct 109 ms 20892 KB n = 199886
60 Correct 120 ms 21388 KB n = 199996
61 Correct 115 ms 20876 KB n = 200000
62 Correct 124 ms 21208 KB n = 199998
63 Correct 121 ms 21164 KB n = 200000
64 Correct 131 ms 21536 KB n = 199998
65 Correct 131 ms 24312 KB n = 200000
66 Correct 130 ms 21512 KB n = 190000
67 Correct 121 ms 22600 KB n = 177777
68 Correct 64 ms 11060 KB n = 100000
69 Correct 129 ms 21916 KB n = 200000
70 Correct 125 ms 22136 KB n = 200000
71 Correct 114 ms 22012 KB n = 200000
72 Correct 138 ms 21924 KB n = 200000
73 Correct 139 ms 22004 KB n = 200000
74 Correct 146 ms 21912 KB n = 200000
75 Correct 124 ms 21924 KB n = 200000
76 Correct 124 ms 22004 KB n = 200000
77 Correct 128 ms 21992 KB n = 200000
78 Correct 115 ms 21916 KB n = 200000
79 Correct 128 ms 20864 KB n = 184307
80 Correct 50 ms 9616 KB n = 76040
81 Correct 112 ms 20884 KB n = 199981
82 Correct 118 ms 21268 KB n = 199994
83 Correct 115 ms 20900 KB n = 199996
84 Correct 117 ms 21152 KB n = 199998
85 Correct 116 ms 21152 KB n = 200000
86 Correct 148 ms 21528 KB n = 199998
87 Correct 128 ms 24436 KB n = 200000
88 Correct 124 ms 22516 KB n = 200000
89 Correct 127 ms 24356 KB n = 200000
90 Correct 130 ms 22012 KB n = 200000
91 Correct 124 ms 22032 KB n = 200000
92 Correct 117 ms 22028 KB n = 200000