oj.uz

Submission #136409

# Submission time Handle Problem Language Result Execution time Memory
136409 2019-07-25T09:03:16 Z MAMBA Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 298 ms 17624 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

#define rep(i, j, k) for (int i = j; i < (int)k; i++)
#define pb push_back
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef vector<int> vi;

const int N = 2e6 + 10;

int par[N];

int getPar(int v) { return v == par[v] ? v : par[v] = getPar(par[v]); }

bool merge(int a, int b) {
  if ((a = getPar(a)) == (b = getPar(b))) return false;
  return par[a] = b, true;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
  s.pb(1e9);
  t.pb(1);

  vi me(all(s));
  for (auto e : t) me.pb(e);
  sort(all(me));
  me.resize(unique(all(me)) - me.begin());

  for (auto &e : s) e = lower_bound(all(me), e) - me.begin();
  for (auto &e : t) e = lower_bound(all(me), e) - me.begin();

  int n = s.size();
  vi cnt(me.size());

  iota(par, par + me.size(), 0);

  rep(i, 0, n) {
    merge(s[i], t[i]);
    cnt[s[i]]++;
    cnt[t[i]]--;
  }

  ll res = 0;

  int local = 0;
  rep(i, 0, me.size() - 1) {
    local += cnt[i];
    if (local < 0) {
      merge(i, i + 1);
    }
    if (local > 0) {
      res += 1ll * local * (me[i + 1] - me[i]);
      merge(i, i + 1);
    }
  }

  vi ind(me.size() - 1);
  iota(all(ind), 0);

  sort(all(ind),
       [&](int a, int b) { return me[a + 1] - me[a] < me[b + 1] - me[b]; });

  for (auto e : ind)
    if (merge(e, e + 1)) res += me[e + 1] - me[e];

  return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 10688 KB n = 199999
2 Correct 296 ms 12608 KB n = 199991
3 Correct 289 ms 12776 KB n = 199993
4 Correct 217 ms 10292 KB n = 152076
5 Correct 133 ms 6856 KB n = 93249
6 Correct 218 ms 11864 KB n = 199910
7 Correct 248 ms 12876 KB n = 199999
8 Correct 223 ms 12328 KB n = 199997
9 Correct 243 ms 11132 KB n = 171294
10 Correct 207 ms 9728 KB n = 140872
11 Correct 236 ms 11960 KB n = 199886
12 Correct 252 ms 14200 KB n = 199996
13 Correct 229 ms 13400 KB n = 200000
14 Correct 255 ms 15448 KB n = 199998
15 Correct 252 ms 14652 KB n = 200000
16 Correct 279 ms 15060 KB n = 199998
17 Correct 263 ms 17624 KB n = 200000
18 Correct 262 ms 13992 KB n = 190000
19 Correct 225 ms 15624 KB n = 177777
20 Correct 137 ms 7528 KB n = 100000
21 Correct 289 ms 14536 KB n = 200000
22 Correct 267 ms 14424 KB n = 200000
23 Correct 253 ms 14552 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 2 ms 376 KB n = 2
5 Correct 2 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 404 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 256 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 248 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 256 KB n = 8
16 Correct 2 ms 256 KB n = 8
17 Correct 2 ms 504 KB n = 8
18 Correct 2 ms 256 KB n = 8
19 Correct 2 ms 256 KB n = 3
20 Correct 2 ms 256 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 376 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 2 ms 376 KB n = 8
25 Correct 2 ms 252 KB n = 8
26 Correct 2 ms 404 KB n = 8
27 Correct 2 ms 256 KB n = 8
28 Correct 2 ms 256 KB n = 8
29 Correct 2 ms 256 KB n = 16
30 Correct 2 ms 256 KB n = 16
31 Correct 2 ms 376 KB n = 16
32 Correct 2 ms 376 KB n = 16
33 Correct 2 ms 376 KB n = 16
34 Correct 2 ms 348 KB n = 16
35 Correct 2 ms 252 KB n = 16
36 Correct 2 ms 256 KB n = 15
37 Correct 2 ms 256 KB n = 8
38 Correct 2 ms 376 KB n = 16
39 Correct 2 ms 256 KB n = 16
40 Correct 2 ms 256 KB n = 9
41 Correct 2 ms 256 KB n = 16
42 Correct 2 ms 256 KB n = 16
43 Correct 3 ms 376 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 2 ms 252 KB n = 15
46 Correct 2 ms 376 KB n = 16
47 Correct 2 ms 376 KB n = 16
48 Correct 2 ms 376 KB n = 16
49 Correct 283 ms 10688 KB n = 199999
50 Correct 296 ms 12608 KB n = 199991
51 Correct 289 ms 12776 KB n = 199993
52 Correct 217 ms 10292 KB n = 152076
53 Correct 133 ms 6856 KB n = 93249
54 Correct 218 ms 11864 KB n = 199910
55 Correct 248 ms 12876 KB n = 199999
56 Correct 223 ms 12328 KB n = 199997
57 Correct 243 ms 11132 KB n = 171294
58 Correct 207 ms 9728 KB n = 140872
59 Correct 236 ms 11960 KB n = 199886
60 Correct 252 ms 14200 KB n = 199996
61 Correct 229 ms 13400 KB n = 200000
62 Correct 255 ms 15448 KB n = 199998
63 Correct 252 ms 14652 KB n = 200000
64 Correct 279 ms 15060 KB n = 199998
65 Correct 263 ms 17624 KB n = 200000
66 Correct 262 ms 13992 KB n = 190000
67 Correct 225 ms 15624 KB n = 177777
68 Correct 137 ms 7528 KB n = 100000
69 Correct 289 ms 14536 KB n = 200000
70 Correct 267 ms 14424 KB n = 200000
71 Correct 253 ms 14552 KB n = 200000
72 Correct 289 ms 14460 KB n = 200000
73 Correct 298 ms 14552 KB n = 200000
74 Correct 288 ms 14424 KB n = 200000
75 Correct 261 ms 14424 KB n = 200000
76 Correct 251 ms 14424 KB n = 200000
77 Correct 219 ms 14396 KB n = 200000
78 Correct 219 ms 11352 KB n = 200000
79 Correct 262 ms 13296 KB n = 184307
80 Correct 109 ms 5668 KB n = 76040
81 Correct 226 ms 12632 KB n = 199981
82 Correct 258 ms 14296 KB n = 199994
83 Correct 230 ms 13296 KB n = 199996
84 Correct 258 ms 15292 KB n = 199998
85 Correct 265 ms 14668 KB n = 200000
86 Correct 276 ms 15016 KB n = 199998
87 Correct 262 ms 17624 KB n = 200000
88 Correct 278 ms 14864 KB n = 200000
89 Correct 255 ms 17520 KB n = 200000
90 Correct 290 ms 14472 KB n = 200000
91 Correct 266 ms 14424 KB n = 200000
92 Correct 252 ms 14344 KB n = 200000