oj.uz

답안 #94571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
94571 2019-01-21T02:17:32 Z wxh010910 Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 439 ms 15208 KB 
#include <bits/stdc++.h>
#include "railroad.h"

using namespace std;

class dsu {
 public:
  vector<int> p;
  int n;

  dsu(int n): n(n) {
    p.resize(n);
    for (int i = 0; i < n; ++i) {
      p[i] = i;
    }
  }

  inline int find(int x) {
    while (x != p[x]) {
      x = p[x] = p[p[x]];
    }
    return x;
  }

  inline bool unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) {
      return false;
    } else {
      p[x] = y;
      return true;
    }
  }
};

long long plan_roller_coaster(vector<int> s, vector<int> t) {
  int n = s.size();
  vector<int> disc;
  for (int i = 0; i < n; ++i) {
    disc.push_back(s[i]);
    disc.push_back(t[i]);
  }
  sort(disc.begin(), disc.end());
  disc.erase(unique(disc.begin(), disc.end()), disc.end());
  int m = disc.size();
  dsu d(m);
  vector<int> pass_by(m);
  for (int i = 0; i < n; ++i) {
    s[i] = lower_bound(disc.begin(), disc.end(), s[i]) - disc.begin();
    t[i] = lower_bound(disc.begin(), disc.end(), t[i]) - disc.begin();
    ++pass_by[s[i]];
    --pass_by[t[i]];
    d.unite(s[i], t[i]);
  }
  long long ans = 0;
  vector<pair<int, int>> edges;
  for (int i = 0; i < m - 1; ++i) {
    pass_by[i + 1] += pass_by[i];
    if (pass_by[i] > 1) {
      ans += (long long) (disc[i + 1] - disc[i]) * (pass_by[i] - 1);
    }
    if (pass_by[i] == 1) {
      edges.emplace_back(disc[i + 1] - disc[i], i);
    } else {
      d.unite(i, i + 1);
    }
  }
  sort(edges.begin(), edges.end());
  for (auto p : edges) {
    if (d.unite(p.second, p.second + 1)) {
      ans += p.first;
    }
  }
  return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 348 KB n = 2
5 Correct 5 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 256 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 256 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 380 KB n = 3
20 Correct 2 ms 376 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 256 KB n = 8
25 Correct 2 ms 256 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 348 KB n = 2
5 Correct 5 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 256 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 256 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 380 KB n = 3
20 Correct 2 ms 376 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 256 KB n = 8
25 Correct 2 ms 256 KB n = 8
26 Correct 2 ms 256 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 256 KB n = 8
29 Correct 2 ms 376 KB n = 16
30 Correct 2 ms 376 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 376 KB n = 16
35 Correct 2 ms 376 KB n = 16
36 Correct 2 ms 376 KB n = 15
37 Correct 2 ms 380 KB n = 8
38 Correct 2 ms 376 KB n = 16
39 Correct 2 ms 376 KB n = 16
40 Correct 2 ms 256 KB n = 9
41 Correct 2 ms 256 KB n = 16
42 Correct 2 ms 376 KB n = 16
43 Correct 2 ms 256 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 2 ms 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 12264 KB n = 199999
2 Correct 439 ms 12108 KB n = 199991
3 Correct 189 ms 12284 KB n = 199993
4 Correct 137 ms 9064 KB n = 152076
5 Correct 80 ms 5996 KB n = 93249
6 Correct 152 ms 10600 KB n = 199910
7 Correct 161 ms 11428 KB n = 199999
8 Correct 157 ms 10456 KB n = 199997
9 Correct 152 ms 10344 KB n = 171294
10 Correct 124 ms 8808 KB n = 140872
11 Correct 151 ms 10600 KB n = 199886
12 Correct 158 ms 11804 KB n = 199996
13 Correct 156 ms 11084 KB n = 200000
14 Correct 177 ms 14312 KB n = 199998
15 Correct 176 ms 14336 KB n = 200000
16 Correct 177 ms 14760 KB n = 199998
17 Correct 176 ms 12200 KB n = 200000
18 Correct 167 ms 11640 KB n = 190000
19 Correct 152 ms 10856 KB n = 177777
20 Correct 85 ms 6380 KB n = 100000
21 Correct 177 ms 12136 KB n = 200000
22 Correct 209 ms 15076 KB n = 200000
23 Correct 206 ms 15140 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 348 KB n = 2
5 Correct 5 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 256 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 256 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 380 KB n = 3
20 Correct 2 ms 376 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 256 KB n = 8
25 Correct 2 ms 256 KB n = 8
26 Correct 2 ms 256 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 256 KB n = 8
29 Correct 2 ms 376 KB n = 16
30 Correct 2 ms 376 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 376 KB n = 16
35 Correct 2 ms 376 KB n = 16
36 Correct 2 ms 376 KB n = 15
37 Correct 2 ms 380 KB n = 8
38 Correct 2 ms 376 KB n = 16
39 Correct 2 ms 376 KB n = 16
40 Correct 2 ms 256 KB n = 9
41 Correct 2 ms 256 KB n = 16
42 Correct 2 ms 376 KB n = 16
43 Correct 2 ms 256 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 2 ms 376 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 183 ms 12264 KB n = 199999
50 Correct 439 ms 12108 KB n = 199991
51 Correct 189 ms 12284 KB n = 199993
52 Correct 137 ms 9064 KB n = 152076
53 Correct 80 ms 5996 KB n = 93249
54 Correct 152 ms 10600 KB n = 199910
55 Correct 161 ms 11428 KB n = 199999
56 Correct 157 ms 10456 KB n = 199997
57 Correct 152 ms 10344 KB n = 171294
58 Correct 124 ms 8808 KB n = 140872
59 Correct 151 ms 10600 KB n = 199886
60 Correct 158 ms 11804 KB n = 199996
61 Correct 156 ms 11084 KB n = 200000
62 Correct 177 ms 14312 KB n = 199998
63 Correct 176 ms 14336 KB n = 200000
64 Correct 177 ms 14760 KB n = 199998
65 Correct 176 ms 12200 KB n = 200000
66 Correct 167 ms 11640 KB n = 190000
67 Correct 152 ms 10856 KB n = 177777
68 Correct 85 ms 6380 KB n = 100000
69 Correct 177 ms 12136 KB n = 200000
70 Correct 209 ms 15076 KB n = 200000
71 Correct 206 ms 15140 KB n = 200000
72 Correct 188 ms 12320 KB n = 200000
73 Correct 182 ms 12288 KB n = 200000
74 Correct 180 ms 12172 KB n = 200000
75 Correct 165 ms 12220 KB n = 200000
76 Correct 163 ms 12136 KB n = 200000
77 Correct 148 ms 10472 KB n = 200000
78 Correct 174 ms 13600 KB n = 200000
79 Correct 161 ms 11084 KB n = 184307
80 Correct 65 ms 4972 KB n = 76040
81 Correct 153 ms 10644 KB n = 199981
82 Correct 159 ms 11904 KB n = 199994
83 Correct 197 ms 11040 KB n = 199996
84 Correct 179 ms 14312 KB n = 199998
85 Correct 173 ms 14436 KB n = 200000
86 Correct 177 ms 14668 KB n = 199998
87 Correct 167 ms 12200 KB n = 200000
88 Correct 184 ms 12136 KB n = 200000
89 Correct 167 ms 12280 KB n = 200000
90 Correct 184 ms 12172 KB n = 200000
91 Correct 200 ms 15208 KB n = 200000
92 Correct 195 ms 15108 KB n = 200000