oj.uz

Submission #409058

# Submission time Handle Problem Language Result Execution time Memory
409058 2021-05-20T06:39:49 Z ja_kingy Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 299 ms 19816 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
int INF = 2e9;

int dsu[400000];

int f(int x) {return dsu[x] == x ? x : dsu[x] = f(dsu[x]);}
bool merge(int a, int b) {
    a = f(a), b = f(b);
    if (a != b) {
        dsu[b] = a;
        return 1;
    }
    return 0;
}

int compress(vector<int> &vec, int x) {
    return lower_bound(vec.begin(), vec.end(), x) - vec.begin();
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    ll ans = 0;
    iota(dsu, end(dsu), 0);
    vector<int> xs;
    t.push_back(1);
    s.push_back(INF);
    for (int i = 0; i < s.size(); ++i) {
        xs.push_back(s[i]);
        xs.push_back(t[i]);
    }
    sort(xs.begin(), xs.end());
    xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
    vector<pii> evs;
    for (int i = 0; i < s.size(); ++i) {
        int a = compress(xs, s[i]), b = compress(xs, t[i]);
        evs.push_back({a, 1});
        evs.push_back({b, -1});
        merge(a,b);
    }
    sort(evs.begin(), evs.end());
    int d = 0, it = 0;
    vector<pii> es;
    for (int i = 0; i < xs.size() - 1; ++i) {
        es.push_back({xs[i+1]-xs[i],i});
        while (it < evs.size() && evs[it].first == i) {
            d += evs[it].second;
            it++;
        }
        if (d) merge(i, i+1);
        ans += (ll)max(0, d) * (xs[i+1]-xs[i]);
    }
    sort(es.begin(), es.end());
    for (pii e: es) {
        if (merge(e.second, e.second+1)) {
            ans += e.first;
        }
    }
    return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~
railroad.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i = 0; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~
railroad.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < xs.size() - 1; ++i) {
      |                     ~~^~~~~~~~~~~~~~~
railroad.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         while (it < evs.size() && evs[it].first == i) {
      |                ~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 19648 KB n = 199999
2 Correct 299 ms 19716 KB n = 199991
3 Correct 274 ms 19728 KB n = 199993
4 Correct 202 ms 16532 KB n = 152076
5 Correct 121 ms 10336 KB n = 93249
6 Correct 259 ms 18628 KB n = 199910
7 Correct 257 ms 18960 KB n = 199999
8 Correct 240 ms 18584 KB n = 199997
9 Correct 241 ms 17908 KB n = 171294
10 Correct 189 ms 16160 KB n = 140872
11 Correct 245 ms 18588 KB n = 199886
12 Correct 263 ms 19264 KB n = 199996
13 Correct 248 ms 18624 KB n = 200000
14 Correct 256 ms 18840 KB n = 199998
15 Correct 263 ms 18880 KB n = 200000
16 Correct 272 ms 19172 KB n = 199998
17 Correct 274 ms 19740 KB n = 200000
18 Correct 258 ms 19052 KB n = 190000
19 Correct 240 ms 18324 KB n = 177777
20 Correct 131 ms 10796 KB n = 100000
21 Correct 274 ms 19728 KB n = 200000
22 Correct 274 ms 19740 KB n = 200000
23 Correct 283 ms 19816 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB n = 2
2 Correct 2 ms 1868 KB n = 2
3 Correct 2 ms 1740 KB n = 2
4 Correct 2 ms 1740 KB n = 2
5 Correct 2 ms 1740 KB n = 2
6 Correct 2 ms 1740 KB n = 2
7 Correct 2 ms 1740 KB n = 3
8 Correct 2 ms 1740 KB n = 3
9 Correct 2 ms 1740 KB n = 3
10 Correct 2 ms 1868 KB n = 8
11 Correct 2 ms 1836 KB n = 8
12 Correct 2 ms 1740 KB n = 8
13 Correct 2 ms 1836 KB n = 8
14 Correct 2 ms 1740 KB n = 8
15 Correct 2 ms 1740 KB n = 8
16 Correct 2 ms 1740 KB n = 8
17 Correct 2 ms 1740 KB n = 8
18 Correct 2 ms 1740 KB n = 8
19 Correct 2 ms 1740 KB n = 3
20 Correct 2 ms 1740 KB n = 7
21 Correct 2 ms 1740 KB n = 8
22 Correct 2 ms 1740 KB n = 8
23 Correct 2 ms 1740 KB n = 8
24 Correct 2 ms 1740 KB n = 8
25 Correct 2 ms 1868 KB n = 8
26 Correct 2 ms 1740 KB n = 8
27 Correct 2 ms 1740 KB n = 8
28 Correct 2 ms 1740 KB n = 8
29 Correct 2 ms 1840 KB n = 16
30 Correct 2 ms 1832 KB n = 16
31 Correct 2 ms 1832 KB n = 16
32 Correct 2 ms 1868 KB n = 16
33 Correct 2 ms 1740 KB n = 16
34 Correct 2 ms 1740 KB n = 16
35 Correct 2 ms 1868 KB n = 16
36 Correct 2 ms 1868 KB n = 15
37 Correct 2 ms 1740 KB n = 8
38 Correct 2 ms 1868 KB n = 16
39 Correct 2 ms 1868 KB n = 16
40 Correct 2 ms 1868 KB n = 9
41 Correct 2 ms 1840 KB n = 16
42 Correct 2 ms 1740 KB n = 16
43 Correct 2 ms 1868 KB n = 16
44 Correct 2 ms 1740 KB n = 9
45 Correct 2 ms 1868 KB n = 15
46 Correct 2 ms 1844 KB n = 16
47 Correct 2 ms 1836 KB n = 16
48 Correct 2 ms 1840 KB n = 16
49 Correct 281 ms 19648 KB n = 199999
50 Correct 299 ms 19716 KB n = 199991
51 Correct 274 ms 19728 KB n = 199993
52 Correct 202 ms 16532 KB n = 152076
53 Correct 121 ms 10336 KB n = 93249
54 Correct 259 ms 18628 KB n = 199910
55 Correct 257 ms 18960 KB n = 199999
56 Correct 240 ms 18584 KB n = 199997
57 Correct 241 ms 17908 KB n = 171294
58 Correct 189 ms 16160 KB n = 140872
59 Correct 245 ms 18588 KB n = 199886
60 Correct 263 ms 19264 KB n = 199996
61 Correct 248 ms 18624 KB n = 200000
62 Correct 256 ms 18840 KB n = 199998
63 Correct 263 ms 18880 KB n = 200000
64 Correct 272 ms 19172 KB n = 199998
65 Correct 274 ms 19740 KB n = 200000
66 Correct 258 ms 19052 KB n = 190000
67 Correct 240 ms 18324 KB n = 177777
68 Correct 131 ms 10796 KB n = 100000
69 Correct 274 ms 19728 KB n = 200000
70 Correct 274 ms 19740 KB n = 200000
71 Correct 283 ms 19816 KB n = 200000
72 Correct 279 ms 19724 KB n = 200000
73 Correct 294 ms 19736 KB n = 200000
74 Correct 277 ms 19684 KB n = 200000
75 Correct 268 ms 19732 KB n = 200000
76 Correct 271 ms 19672 KB n = 200000
77 Correct 247 ms 17188 KB n = 200000
78 Correct 230 ms 17176 KB n = 200000
79 Correct 254 ms 18584 KB n = 184307
80 Correct 101 ms 9376 KB n = 76040
81 Correct 248 ms 18572 KB n = 199981
82 Correct 276 ms 19180 KB n = 199994
83 Correct 251 ms 18712 KB n = 199996
84 Correct 276 ms 18844 KB n = 199998
85 Correct 266 ms 18840 KB n = 200000
86 Correct 288 ms 19252 KB n = 199998
87 Correct 261 ms 19732 KB n = 200000
88 Correct 271 ms 19744 KB n = 200000
89 Correct 264 ms 19620 KB n = 200000
90 Correct 275 ms 19740 KB n = 200000
91 Correct 277 ms 19620 KB n = 200000
92 Correct 275 ms 19732 KB n = 200000