oj.uz

Submission #332158

# Submission time Handle Problem Language Result Execution time Memory
332158 2020-12-01T15:03:01 Z quocnguyen1012 Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 292 ms 19848 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int maxn = 4e5 + 5;

int lab[maxn], deg[maxn];
int n;

int findset(int u) {
  if (lab[u] == u) return u;
  return lab[u] = findset(lab[u]);
}

bool join(int u, int v) {
  u = findset(u); v = findset(v);
  if (u == v) return false;
  lab[v] = u;
  return true;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
  vector<int> coor;
  n = s.size();
  for (int & i : s) coor.push_back(i);
  for (int & i : t) coor.push_back(i);

  sort(coor.begin(), coor.end());
  coor.erase(unique(coor.begin(), coor.end()), coor.end());
  iota(lab, lab + coor.size(), 0);

  auto compv = [&](int v) {
    return lower_bound(coor.begin(), coor.end(), v) - coor.begin();
  };
  for (int & i : s) i = compv(i);
  for (int & i : t) i = compv(i);
  for (int i = 0; i < n; ++i) {
    ++deg[s[i]];
    --deg[t[i]];
    join(s[i], t[i]);
  }
  vector<array<int, 3>> edges;
  ll ret = 0;
  deg[coor.size() - 1]++;
  deg[0]--;

  int m = coor.size();

  for (int i = coor.size() - 1; i >= 1; --i) {
    edges.push_back({coor[i] - coor[i - 1], i, i - 1});
    if (deg[i] < 0) {
      deg[i - 1] += deg[i];
      join(i, i - 1);
      ret += 1ll * (coor[i] - coor[i - 1]) * abs(deg[i]);
      //cerr << coor[i] << ' ';
    } else if (deg[i] > 0) {
      deg[i - 1] += deg[i];
      join(i, i - 1);
    }
  }
  //for (int & i : deg) assert(i == 0);
  //for (int i = 0; i < coor.size(); ++i)
    //cerr << coor[i] << ' ' << deg[i] << '\n';
  sort(edges.begin(), edges.end());
  for (auto & it : edges) {
    if (join(it[1], it[2])) {
      //cerr << it[0] << ' ' << coor[it[1]] << ' ' << coor[it[2]] << '\n';
      ret += it[0];
    }
  }
  return ret;
}

#ifdef LOCAL
signed main(void) {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
  freopen("A.INP", "r", stdin);
  freopen("A.OUT", "w", stdout);
#endif // LOCAL
  int n; cin >> n;
  vector<int> s(n), t(n);
  for (int & i : s) cin >> i;
  for (int & i : t) cin >> i;
  cout << plan_roller_coaster(s, t);
}
#endif // LOCAL

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:48:7: warning: unused variable 'm' [-Wunused-variable]
   48 |   int m = coor.size();
      |       ^

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 19848 KB n = 199999
2 Correct 273 ms 19588 KB n = 199991
3 Correct 252 ms 19800 KB n = 199993
4 Correct 190 ms 16564 KB n = 152076
5 Correct 109 ms 9692 KB n = 93249
6 Correct 252 ms 18008 KB n = 199910
7 Correct 246 ms 18904 KB n = 199999
8 Correct 235 ms 18136 KB n = 199997
9 Correct 237 ms 17880 KB n = 171294
10 Correct 180 ms 16236 KB n = 140872
11 Correct 243 ms 18136 KB n = 199886
12 Correct 288 ms 19160 KB n = 199996
13 Correct 241 ms 18264 KB n = 200000
14 Correct 260 ms 18904 KB n = 199998
15 Correct 257 ms 18776 KB n = 200000
16 Correct 268 ms 19160 KB n = 199998
17 Correct 238 ms 19672 KB n = 200000
18 Correct 238 ms 18904 KB n = 190000
19 Correct 211 ms 18136 KB n = 177777
20 Correct 123 ms 10040 KB n = 100000
21 Correct 262 ms 19416 KB n = 200000
22 Correct 253 ms 19672 KB n = 200000
23 Correct 245 ms 19800 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 512 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 380 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 512 KB n = 16
36 Correct 1 ms 364 KB n = 15
37 Correct 1 ms 364 KB n = 8
38 Correct 1 ms 364 KB n = 16
39 Correct 1 ms 364 KB n = 16
40 Correct 15 ms 492 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 2 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 1 ms 364 KB n = 16
47 Correct 1 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16
49 Correct 252 ms 19848 KB n = 199999
50 Correct 273 ms 19588 KB n = 199991
51 Correct 252 ms 19800 KB n = 199993
52 Correct 190 ms 16564 KB n = 152076
53 Correct 109 ms 9692 KB n = 93249
54 Correct 252 ms 18008 KB n = 199910
55 Correct 246 ms 18904 KB n = 199999
56 Correct 235 ms 18136 KB n = 199997
57 Correct 237 ms 17880 KB n = 171294
58 Correct 180 ms 16236 KB n = 140872
59 Correct 243 ms 18136 KB n = 199886
60 Correct 288 ms 19160 KB n = 199996
61 Correct 241 ms 18264 KB n = 200000
62 Correct 260 ms 18904 KB n = 199998
63 Correct 257 ms 18776 KB n = 200000
64 Correct 268 ms 19160 KB n = 199998
65 Correct 238 ms 19672 KB n = 200000
66 Correct 238 ms 18904 KB n = 190000
67 Correct 211 ms 18136 KB n = 177777
68 Correct 123 ms 10040 KB n = 100000
69 Correct 262 ms 19416 KB n = 200000
70 Correct 253 ms 19672 KB n = 200000
71 Correct 245 ms 19800 KB n = 200000
72 Correct 269 ms 19032 KB n = 200000
73 Correct 253 ms 18904 KB n = 200000
74 Correct 252 ms 19032 KB n = 200000
75 Correct 241 ms 18904 KB n = 200000
76 Correct 243 ms 18904 KB n = 200000
77 Correct 191 ms 14172 KB n = 200000
78 Correct 196 ms 14428 KB n = 200000
79 Correct 230 ms 18392 KB n = 184307
80 Correct 89 ms 8668 KB n = 76040
81 Correct 228 ms 18136 KB n = 199981
82 Correct 253 ms 18904 KB n = 199994
83 Correct 246 ms 18264 KB n = 199996
84 Correct 283 ms 18904 KB n = 199998
85 Correct 249 ms 18776 KB n = 200000
86 Correct 292 ms 19032 KB n = 199998
87 Correct 243 ms 18948 KB n = 200000
88 Correct 253 ms 19032 KB n = 200000
89 Correct 238 ms 18904 KB n = 200000
90 Correct 261 ms 18904 KB n = 200000
91 Correct 255 ms 18904 KB n = 200000
92 Correct 244 ms 18904 KB n = 200000