oj.uz

Submission #587959

# Submission time Handle Problem Language Result Execution time Memory
587959 2022-07-02T15:04:47 Z AriaH Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 195 ms 18620 KB 
#include "railroad.h"

/* Ignore Others Only Focus On Yourself! */
/* Im the Best! */

#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef pair < ll, ll > pll;

#define F first
#define S second
#define all(x) x.begin(),x.end()
#define Mp make_pair
#define point complex
#define endl '\n'
#define SZ(x) (int)x.size()
#define fast_io ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define file_io freopen("input.txt", "r+", stdin); freopen("output.txt", "w+", stdout);
#define mashtali return cout << "Hello, World!", 0;

const int N = 1e6 + 10;
const int LOG = 20;
const ll mod = 1e9 + 7;
const ll inf = 8e18;
const double pi = acos(-1);
const ld eps = 1e-18;
const ld one = 1.;

ll pw(ll a, ll b, ll M, ll ret = 1) { if(a == 0) return 0; a %= M; while(b) { ret = (b & 1? ret * a % M : ret), a = a * a % M, b >>= 1; } return ret % M; }

mt19937 rng(time(nullptr));

vector < int > cm;

int ps[N], par[N];

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

int unify(int v, int u)
{
    v = get(v), u = get(u);
    if(v == u) return 0;
    par[u] = v;
    return 1;
}

int lwr(int x)
{
    return lower_bound(all(cm), x) - cm.begin();
}

ll plan_roller_coaster(vector < int > s, vector < int > t)
{
    iota(par, par + N, 0);
    int n = SZ(s);
    for(int i = 0; i < n; i ++)
    {
        cm.push_back(s[i]);
        cm.push_back(t[i]);
    }
    cm.push_back(-1e9 - 5);
    cm.push_back(1e9 + 5);
    sort(all(cm));
    cm.resize(unique(all(cm)) - cm.begin());
    for(int i = 0; i < n; i ++)
    {
        s[i] = lwr(s[i]);
        t[i] = lwr(t[i]);
        ps[s[i]] --;
        ps[t[i]] ++;
        unify(s[i], t[i]);
    }
    ll tot = 0;
    vector < pll > E;
    for(int i = 0; i < SZ(cm) - 1; i ++)
    {
        ps[i + 1] += ps[i];
        tot += 1ll * max(0, -1 - ps[i]) * (cm[i + 1] - cm[i]);
        if(ps[i] == -1)
        {
            E.push_back(Mp(cm[i + 1] - cm[i], i));
        }
        else
        {
            unify(i, i + 1);
        }
    }
    sort(all(E));
    for(auto [c, i] : E)
    {
        if(unify(i, i + 1))
        {
            tot += c;
        }
    }
    return tot;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 11536 KB n = 199999
2 Correct 161 ms 12292 KB n = 199991
3 Correct 169 ms 12284 KB n = 199993
4 Correct 112 ms 10760 KB n = 152076
5 Correct 70 ms 8896 KB n = 93249
6 Correct 135 ms 11980 KB n = 199910
7 Correct 153 ms 12352 KB n = 199999
8 Correct 133 ms 11992 KB n = 199997
9 Correct 131 ms 11320 KB n = 171294
10 Correct 116 ms 10452 KB n = 140872
11 Correct 139 ms 12028 KB n = 199886
12 Correct 141 ms 14528 KB n = 199996
13 Correct 155 ms 13992 KB n = 200000
14 Correct 157 ms 17736 KB n = 199998
15 Correct 161 ms 17700 KB n = 200000
16 Correct 176 ms 18096 KB n = 199998
17 Correct 140 ms 14412 KB n = 200000
18 Correct 142 ms 14056 KB n = 190000
19 Correct 128 ms 13380 KB n = 177777
20 Correct 79 ms 9388 KB n = 100000
21 Correct 144 ms 14408 KB n = 200000
22 Correct 189 ms 18564 KB n = 200000
23 Correct 192 ms 18608 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB n = 2
2 Correct 2 ms 4152 KB n = 2
3 Correct 3 ms 4180 KB n = 2
4 Correct 2 ms 4180 KB n = 2
5 Correct 2 ms 4180 KB n = 2
6 Correct 3 ms 4180 KB n = 2
7 Correct 2 ms 4180 KB n = 3
8 Correct 3 ms 4180 KB n = 3
9 Correct 3 ms 4180 KB n = 3
10 Correct 3 ms 4152 KB n = 8
11 Correct 2 ms 4180 KB n = 8
12 Correct 2 ms 4156 KB n = 8
13 Correct 2 ms 4180 KB n = 8
14 Correct 2 ms 4156 KB n = 8
15 Correct 2 ms 4160 KB n = 8
16 Correct 2 ms 4180 KB n = 8
17 Correct 2 ms 4160 KB n = 8
18 Correct 2 ms 4180 KB n = 8
19 Correct 2 ms 4180 KB n = 3
20 Correct 2 ms 4180 KB n = 7
21 Correct 2 ms 4180 KB n = 8
22 Correct 2 ms 4180 KB n = 8
23 Correct 2 ms 4180 KB n = 8
24 Correct 2 ms 4180 KB n = 8
25 Correct 2 ms 4180 KB n = 8
26 Correct 2 ms 4180 KB n = 8
27 Correct 2 ms 4180 KB n = 8
28 Correct 2 ms 4180 KB n = 8
29 Correct 2 ms 4160 KB n = 16
30 Correct 2 ms 4156 KB n = 16
31 Correct 3 ms 4180 KB n = 16
32 Correct 2 ms 4180 KB n = 16
33 Correct 3 ms 4180 KB n = 16
34 Correct 2 ms 4140 KB n = 16
35 Correct 2 ms 4156 KB n = 16
36 Correct 3 ms 4180 KB n = 15
37 Correct 2 ms 4180 KB n = 8
38 Correct 2 ms 4180 KB n = 16
39 Correct 2 ms 4152 KB n = 16
40 Correct 2 ms 4180 KB n = 9
41 Correct 2 ms 4180 KB n = 16
42 Correct 2 ms 4180 KB n = 16
43 Correct 2 ms 4180 KB n = 16
44 Correct 2 ms 4180 KB n = 9
45 Correct 3 ms 4180 KB n = 15
46 Correct 2 ms 4152 KB n = 16
47 Correct 2 ms 4152 KB n = 16
48 Correct 2 ms 4180 KB n = 16
49 Correct 186 ms 11536 KB n = 199999
50 Correct 161 ms 12292 KB n = 199991
51 Correct 169 ms 12284 KB n = 199993
52 Correct 112 ms 10760 KB n = 152076
53 Correct 70 ms 8896 KB n = 93249
54 Correct 135 ms 11980 KB n = 199910
55 Correct 153 ms 12352 KB n = 199999
56 Correct 133 ms 11992 KB n = 199997
57 Correct 131 ms 11320 KB n = 171294
58 Correct 116 ms 10452 KB n = 140872
59 Correct 139 ms 12028 KB n = 199886
60 Correct 141 ms 14528 KB n = 199996
61 Correct 155 ms 13992 KB n = 200000
62 Correct 157 ms 17736 KB n = 199998
63 Correct 161 ms 17700 KB n = 200000
64 Correct 176 ms 18096 KB n = 199998
65 Correct 140 ms 14412 KB n = 200000
66 Correct 142 ms 14056 KB n = 190000
67 Correct 128 ms 13380 KB n = 177777
68 Correct 79 ms 9388 KB n = 100000
69 Correct 144 ms 14408 KB n = 200000
70 Correct 189 ms 18564 KB n = 200000
71 Correct 192 ms 18608 KB n = 200000
72 Correct 169 ms 14500 KB n = 200000
73 Correct 152 ms 14408 KB n = 200000
74 Correct 149 ms 14500 KB n = 200000
75 Correct 153 ms 14628 KB n = 200000
76 Correct 158 ms 14408 KB n = 200000
77 Correct 127 ms 13776 KB n = 200000
78 Correct 154 ms 17828 KB n = 200000
79 Correct 151 ms 13496 KB n = 184307
80 Correct 60 ms 8180 KB n = 76040
81 Correct 134 ms 13240 KB n = 199981
82 Correct 141 ms 14648 KB n = 199994
83 Correct 140 ms 14012 KB n = 199996
84 Correct 156 ms 17732 KB n = 199998
85 Correct 167 ms 17720 KB n = 200000
86 Correct 174 ms 18052 KB n = 199998
87 Correct 149 ms 14392 KB n = 200000
88 Correct 152 ms 14464 KB n = 200000
89 Correct 162 ms 14500 KB n = 200000
90 Correct 156 ms 14496 KB n = 200000
91 Correct 190 ms 18620 KB n = 200000
92 Correct 195 ms 18600 KB n = 200000