oj.uz

Submission #600349

# Submission time Handle Problem Language Result Execution time Memory
600349 2022-07-20T18:56:41 Z MilosMilutinovic Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 129 ms 18276 KB 
/**
 *    author:  wxhtzdy
 *    created: 20.07.2022 18:41:11
**/
#include <bits/stdc++.h>

using namespace std;

class dsu {
  public:
  vector<int> p;
  int n;
  dsu(int _n) : n(_n) {
    p.resize(n);
    iota(p.begin(), p.end(), 0);
  }
  inline int get(int x) {
    return (x == p[x] ? x : (p[x] = get(p[x])));
  }
  inline bool unite(int x, int y) {
    x = get(x);
    y = get(y);
    if (x != y) {
      p[x] = y;
      return true;
    }
    return false;
  }
};

long long plan_roller_coaster(vector<int> s, vector<int> t) {
  int n = (int) s.size();      
  vector<tuple<int, int, int>> ev;
  for (int i = 0; i < n; i++) {
    ev.emplace_back(s[i], +1, i);
    ev.emplace_back(t[i], -1, i);
  }
  ev.emplace_back(1e9, +1, n);
  ev.emplace_back(1, -1, n);
  dsu d(n + 1);
  sort(ev.begin(), ev.end());
  int bal = 0;              
  long long ans = 0;
  vector<tuple<int, int, int>> edges;
  for (int i = 0; i < (int) ev.size() - 1; i++) {
    int len = get<0>(ev[i + 1]) - get<0>(ev[i]);
    bal += get<1>(ev[i]);
    if (bal > 0) {
      ans += bal * 1LL * len;
    } 
    if (bal == 0) {
      edges.emplace_back(len, get<2>(ev[i]), get<2>(ev[i + 1]));
    } else {
      d.unite(get<2>(ev[i]), get<2>(ev[i + 1]));
    }
  }
  sort(edges.begin(), edges.end());
  for (auto& p : edges) {
    if (d.unite(get<1>(p), get<2>(p))) {
      ans += get<0>(p);
    }
  }
  return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 276 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 252 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 300 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 0 ms 212 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 304 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 276 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 252 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 300 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 0 ms 212 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 304 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 1 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 304 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 224 KB n = 16
33 Correct 0 ms 300 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 1 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 296 KB n = 16
43 Correct 1 ms 300 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 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 103 ms 13476 KB n = 199999
2 Correct 100 ms 13488 KB n = 199991
3 Correct 100 ms 13500 KB n = 199993
4 Correct 70 ms 11580 KB n = 152076
5 Correct 42 ms 6768 KB n = 93249
6 Correct 86 ms 12452 KB n = 199910
7 Correct 84 ms 12840 KB n = 199999
8 Correct 85 ms 12472 KB n = 199997
9 Correct 84 ms 12456 KB n = 171294
10 Correct 66 ms 11484 KB n = 140872
11 Correct 86 ms 12480 KB n = 199886
12 Correct 94 ms 13212 KB n = 199996
13 Correct 90 ms 12712 KB n = 200000
14 Correct 109 ms 18084 KB n = 199998
15 Correct 111 ms 17572 KB n = 200000
16 Correct 112 ms 17828 KB n = 199998
17 Correct 89 ms 15024 KB n = 200000
18 Correct 88 ms 13140 KB n = 190000
19 Correct 85 ms 13552 KB n = 177777
20 Correct 46 ms 6936 KB n = 100000
21 Correct 92 ms 13484 KB n = 200000
22 Correct 123 ms 18204 KB n = 200000
23 Correct 113 ms 18208 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 276 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 252 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 300 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 0 ms 212 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 304 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 1 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 304 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 224 KB n = 16
33 Correct 0 ms 300 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 1 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 296 KB n = 16
43 Correct 1 ms 300 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 103 ms 13476 KB n = 199999
50 Correct 100 ms 13488 KB n = 199991
51 Correct 100 ms 13500 KB n = 199993
52 Correct 70 ms 11580 KB n = 152076
53 Correct 42 ms 6768 KB n = 93249
54 Correct 86 ms 12452 KB n = 199910
55 Correct 84 ms 12840 KB n = 199999
56 Correct 85 ms 12472 KB n = 199997
57 Correct 84 ms 12456 KB n = 171294
58 Correct 66 ms 11484 KB n = 140872
59 Correct 86 ms 12480 KB n = 199886
60 Correct 94 ms 13212 KB n = 199996
61 Correct 90 ms 12712 KB n = 200000
62 Correct 109 ms 18084 KB n = 199998
63 Correct 111 ms 17572 KB n = 200000
64 Correct 112 ms 17828 KB n = 199998
65 Correct 89 ms 15024 KB n = 200000
66 Correct 88 ms 13140 KB n = 190000
67 Correct 85 ms 13552 KB n = 177777
68 Correct 46 ms 6936 KB n = 100000
69 Correct 92 ms 13484 KB n = 200000
70 Correct 123 ms 18204 KB n = 200000
71 Correct 113 ms 18208 KB n = 200000
72 Correct 99 ms 13528 KB n = 200000
73 Correct 105 ms 13492 KB n = 200000
74 Correct 129 ms 13484 KB n = 200000
75 Correct 98 ms 13604 KB n = 200000
76 Correct 85 ms 13484 KB n = 200000
77 Correct 89 ms 15100 KB n = 200000
78 Correct 118 ms 18216 KB n = 200000
79 Correct 99 ms 12844 KB n = 184307
80 Correct 38 ms 6124 KB n = 76040
81 Correct 90 ms 12456 KB n = 199981
82 Correct 91 ms 13176 KB n = 199994
83 Correct 93 ms 12788 KB n = 199996
84 Correct 109 ms 18008 KB n = 199998
85 Correct 108 ms 17576 KB n = 200000
86 Correct 115 ms 17948 KB n = 199998
87 Correct 88 ms 15136 KB n = 200000
88 Correct 89 ms 13480 KB n = 200000
89 Correct 87 ms 15144 KB n = 200000
90 Correct 91 ms 13488 KB n = 200000
91 Correct 120 ms 18192 KB n = 200000
92 Correct 116 ms 18276 KB n = 200000