oj.uz

답안 #658137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658137 2022-11-12T09:30:35 Z evenvalue Sky Walking (IOI19_walk) C++17
100 / 100
 1242 ms 269812 KB 
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e17 + 10;
constexpr int kMod = 1e9 + 7;

class LazySegTree {
  const int n;
  vector<int> t;

  void push(const int x, const int l, const int r) {
    if (t[x] == -1) return;
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    for (const int child : {x + 1, y}) {
      t[child] = t[x];
    }
    t[x] = -1;
  }

  void update(const int x, const int l, const int r, const int ql, const int qr, const int i) {
    if (ql <= l and r <= qr) {
      t[x] = i;
      return;
    }
    push(x, l, r);
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    if (ql <= mid) {
      update(x + 1, l, mid, ql, qr, i);
    }
    if (mid < qr) {
      update(y, mid + 1, r, ql, qr, i);
    }
  }

  int query(const int x, const int l, const int r, const int p) {
    if (l == r) {
      return t[x];
    }
    push(x, l, r);
    const int mid = (l + r) / 2;
    const int y = 2 * (mid - l + 1) + x;
    if (p <= mid) {
      return query(x + 1, l, mid, p);
    } else {
      return query(y, mid + 1, r, p);
    }
  }

public:
  explicit LazySegTree(const int n) : n(n), t(2 * n - 1, -1) {}

  void update(const int l, const int r, const int i) {
    update(0, 0, n - 1, l, r, i);
  }

  int query(const int p) {
    return query(0, 0, n - 1, p);
  }
};


pair<vector<int64>, vector<int>> dijkstra(const vector<vector<pair<int, int>>> &g, const int s) {
  const int n = (int) g.size();

  vector<int64> d(n, kInf64);
  vector<int> p(n, -1);
  min_heap<pair<int64, int>> q;

  d[s] = 0;
  q.push({0, s});

  while (not q.empty()) {
    const auto [dist, x] = q.top();
    q.pop();
    if (d[x] < dist) continue;
    for (const auto &[y, w] : g[x]) {
      if (d[y] <= d[x] + w) continue;
      d[y] = d[x] + w;
      p[y] = x;
      q.push({d[y], y});
    }
  }

  return make_pair(d, p);
}

struct building {
  int x;
  int h;
};

struct skywalk {
  int l;
  int r;
  int h;

  set<pair<int, int>> nodes;

  skywalk() = default;
  skywalk(const int l, const int r, const int h) : l(l), r(r), h(h) {}

  bool operator<(const skywalk &other) const {
    if (h != other.h) return h < other.h;
    if (l != other.l) return l < other.l;
    return r < other.r;
  }

  void add_node(const int node, const int x) {
    nodes.insert({x, node});
  }

  pair<int, int> get_prev(const int x) const {
    return *prev(nodes.upper_bound({x, kInf}));
  }

  pair<int, int> get_next(const int x) const {
    return *nodes.upper_bound({x, -1});
  }
};

int64 subtask4(const vector<building> &buildings, vector<skywalk> &skywalks, int S, int G) {
  const int n = buildings.size();

  sort(skywalks.begin(), skywalks.end());

  vector<vector<pair<int, int>>> g(n);
  LazySegTree st(n);

  auto add_node = [&]() -> int {
    g.emplace_back();
    return g.size() - 1;
  };

  auto add_edge = [&](const int x, const int y, const int w) -> void {
    g[x].emplace_back(y, w);
    g[y].emplace_back(x, w);
  };

  auto add_vert = [&](const int i, const int h, const int u) {
    const int x = buildings[i].x;
    const int s = st.query(i);
    if (s == -1) {
      add_edge(u, i, h);
      return;
    }

    const int v = add_node();

    auto before = skywalks[s].get_prev(x);
    add_edge(before.second, v, x - before.first);

    auto after = skywalks[s].get_next(x);
    add_edge(after.second, v, after.first - x);

    add_edge(u, v, h - skywalks[s].h);

    skywalks[s].add_node(v, x);
  };

  for (int i = 0; i < skywalks.size(); i++) {
    skywalk &s = skywalks[i];

    const int l = s.l;
    const int r = s.r;
    const int h = s.h;

    const int x = add_node();
    const int y = add_node();

    add_edge(x, y, buildings[r].x - buildings[l].x);
    add_vert(l, h, x);
    add_vert(r, h, y);

    s.add_node(x, buildings[l].x);
    s.add_node(y, buildings[r].x);

    st.update(l, r, i);
  }

  const int64 ans = dijkstra(g, S).first[G];
  return (ans == kInf64 ? -1 : ans);
}

int64 min_distance(vector<int> X, vector<int> H, vector<int> L, vector<int> R, vector<int> Y, int S, int G) {
  const int n = X.size();
  int m = L.size();

  vector<building> buildings(n);
  for (int i = 0; i < n; i++) {
    buildings[i].h = H[i];
    buildings[i].x = X[i];
  }

  vector<skywalk> skywalks(m);
  for (int j = 0; j < m; j++) {
    skywalks[j].l = L[j];
    skywalks[j].r = R[j];
    skywalks[j].h = Y[j];
  }

  auto add_skywalks = [&](const int x) {
    vector<pair<int, int>> A = {{kInf, -1}};
    for (int i = 0; i <= x; i++) {
      while (A.back().first < H[i]) {
        A.pop_back();
      }
      A.emplace_back(H[i], i);
    }

    vector<pair<int, int>> B = {{kInf, -1}};
    for (int i = n - 1; i >= x; i--) {
      while (B.back().first < H[i]) {
        B.pop_back();
      }
      B.emplace_back(H[i], i);
    }

    vector<skywalk> foo;
    swap(foo, skywalks);
    for (const skywalk &s : foo) {
      if (not(s.l < x and x < s.r)) {
        skywalks.push_back(s);
        continue;
      }
      const int a = lower_bound(A.rbegin(), A.rend(), make_pair(s.h, -1))->second;
      const int b = lower_bound(B.rbegin(), B.rend(), make_pair(s.h, -1))->second;
      skywalks.emplace_back(s.l, a, s.h);
      skywalks.emplace_back(a, b, s.h);
      skywalks.emplace_back(b, s.r, s.h);
    }
  };

  add_skywalks(S);
  add_skywalks(G);

  return subtask4(buildings, skywalks, S, G);
}

Compilation message

walk.cpp: In function 'int64 subtask4(const std::vector<building>&, std::vector<skywalk>&, int, int)':
walk.cpp:172:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<skywalk>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |   for (int i = 0; i < skywalks.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 240 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 396 ms 69196 KB Output is correct
4 Correct 502 ms 75240 KB Output is correct
5 Correct 289 ms 59280 KB Output is correct
6 Correct 373 ms 83116 KB Output is correct
7 Correct 265 ms 58836 KB Output is correct
8 Correct 355 ms 69336 KB Output is correct
9 Correct 353 ms 72824 KB Output is correct
10 Correct 446 ms 75960 KB Output is correct
11 Correct 396 ms 69540 KB Output is correct
12 Correct 365 ms 64560 KB Output is correct
13 Correct 447 ms 75984 KB Output is correct
14 Correct 644 ms 182428 KB Output is correct
15 Correct 456 ms 128764 KB Output is correct
16 Correct 265 ms 72452 KB Output is correct
17 Correct 241 ms 65848 KB Output is correct
18 Correct 236 ms 77272 KB Output is correct
19 Correct 25 ms 9116 KB Output is correct
20 Correct 305 ms 89752 KB Output is correct
21 Correct 236 ms 64452 KB Output is correct
22 Correct 207 ms 63648 KB Output is correct
23 Correct 290 ms 71428 KB Output is correct
24 Correct 216 ms 64776 KB Output is correct
25 Correct 240 ms 65248 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 32776 KB Output is correct
2 Correct 356 ms 68416 KB Output is correct
3 Correct 380 ms 69552 KB Output is correct
4 Correct 426 ms 78672 KB Output is correct
5 Correct 396 ms 79620 KB Output is correct
6 Correct 416 ms 79348 KB Output is correct
7 Correct 214 ms 44496 KB Output is correct
8 Correct 363 ms 64612 KB Output is correct
9 Correct 395 ms 79916 KB Output is correct
10 Correct 223 ms 71108 KB Output is correct
11 Correct 12 ms 5044 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 32776 KB Output is correct
2 Correct 356 ms 68416 KB Output is correct
3 Correct 380 ms 69552 KB Output is correct
4 Correct 426 ms 78672 KB Output is correct
5 Correct 396 ms 79620 KB Output is correct
6 Correct 416 ms 79348 KB Output is correct
7 Correct 214 ms 44496 KB Output is correct
8 Correct 363 ms 64612 KB Output is correct
9 Correct 395 ms 79916 KB Output is correct
10 Correct 223 ms 71108 KB Output is correct
11 Correct 12 ms 5044 KB Output is correct
12 Correct 358 ms 69476 KB Output is correct
13 Correct 289 ms 78032 KB Output is correct
14 Correct 393 ms 79596 KB Output is correct
15 Correct 281 ms 69336 KB Output is correct
16 Correct 317 ms 77704 KB Output is correct
17 Correct 339 ms 77472 KB Output is correct
18 Correct 287 ms 69216 KB Output is correct
19 Correct 324 ms 77880 KB Output is correct
20 Correct 208 ms 44244 KB Output is correct
21 Correct 28 ms 10756 KB Output is correct
22 Correct 264 ms 66768 KB Output is correct
23 Correct 260 ms 68980 KB Output is correct
24 Correct 269 ms 65164 KB Output is correct
25 Correct 261 ms 64972 KB Output is correct
26 Correct 230 ms 58916 KB Output is correct
27 Correct 400 ms 79284 KB Output is correct
28 Correct 307 ms 78156 KB Output is correct
29 Correct 393 ms 79204 KB Output is correct
30 Correct 212 ms 44692 KB Output is correct
31 Correct 378 ms 80300 KB Output is correct
32 Correct 223 ms 67808 KB Output is correct
33 Correct 222 ms 67544 KB Output is correct
34 Correct 241 ms 70860 KB Output is correct
35 Correct 247 ms 68724 KB Output is correct
36 Correct 283 ms 65904 KB Output is correct
37 Correct 215 ms 64504 KB Output is correct
38 Correct 210 ms 63656 KB Output is correct
39 Correct 267 ms 71524 KB Output is correct
40 Correct 230 ms 64812 KB Output is correct
41 Correct 240 ms 65208 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 240 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 396 ms 69196 KB Output is correct
21 Correct 502 ms 75240 KB Output is correct
22 Correct 289 ms 59280 KB Output is correct
23 Correct 373 ms 83116 KB Output is correct
24 Correct 265 ms 58836 KB Output is correct
25 Correct 355 ms 69336 KB Output is correct
26 Correct 353 ms 72824 KB Output is correct
27 Correct 446 ms 75960 KB Output is correct
28 Correct 396 ms 69540 KB Output is correct
29 Correct 365 ms 64560 KB Output is correct
30 Correct 447 ms 75984 KB Output is correct
31 Correct 644 ms 182428 KB Output is correct
32 Correct 456 ms 128764 KB Output is correct
33 Correct 265 ms 72452 KB Output is correct
34 Correct 241 ms 65848 KB Output is correct
35 Correct 236 ms 77272 KB Output is correct
36 Correct 25 ms 9116 KB Output is correct
37 Correct 305 ms 89752 KB Output is correct
38 Correct 236 ms 64452 KB Output is correct
39 Correct 207 ms 63648 KB Output is correct
40 Correct 290 ms 71428 KB Output is correct
41 Correct 216 ms 64776 KB Output is correct
42 Correct 240 ms 65248 KB Output is correct
43 Correct 123 ms 32776 KB Output is correct
44 Correct 356 ms 68416 KB Output is correct
45 Correct 380 ms 69552 KB Output is correct
46 Correct 426 ms 78672 KB Output is correct
47 Correct 396 ms 79620 KB Output is correct
48 Correct 416 ms 79348 KB Output is correct
49 Correct 214 ms 44496 KB Output is correct
50 Correct 363 ms 64612 KB Output is correct
51 Correct 395 ms 79916 KB Output is correct
52 Correct 223 ms 71108 KB Output is correct
53 Correct 12 ms 5044 KB Output is correct
54 Correct 358 ms 69476 KB Output is correct
55 Correct 289 ms 78032 KB Output is correct
56 Correct 393 ms 79596 KB Output is correct
57 Correct 281 ms 69336 KB Output is correct
58 Correct 317 ms 77704 KB Output is correct
59 Correct 339 ms 77472 KB Output is correct
60 Correct 287 ms 69216 KB Output is correct
61 Correct 324 ms 77880 KB Output is correct
62 Correct 208 ms 44244 KB Output is correct
63 Correct 28 ms 10756 KB Output is correct
64 Correct 264 ms 66768 KB Output is correct
65 Correct 260 ms 68980 KB Output is correct
66 Correct 269 ms 65164 KB Output is correct
67 Correct 261 ms 64972 KB Output is correct
68 Correct 230 ms 58916 KB Output is correct
69 Correct 400 ms 79284 KB Output is correct
70 Correct 307 ms 78156 KB Output is correct
71 Correct 393 ms 79204 KB Output is correct
72 Correct 212 ms 44692 KB Output is correct
73 Correct 378 ms 80300 KB Output is correct
74 Correct 223 ms 67808 KB Output is correct
75 Correct 222 ms 67544 KB Output is correct
76 Correct 241 ms 70860 KB Output is correct
77 Correct 247 ms 68724 KB Output is correct
78 Correct 283 ms 65904 KB Output is correct
79 Correct 215 ms 64504 KB Output is correct
80 Correct 210 ms 63656 KB Output is correct
81 Correct 267 ms 71524 KB Output is correct
82 Correct 230 ms 64812 KB Output is correct
83 Correct 240 ms 65208 KB Output is correct
84 Correct 83 ms 25524 KB Output is correct
85 Correct 431 ms 83132 KB Output is correct
86 Correct 808 ms 177992 KB Output is correct
87 Correct 51 ms 16116 KB Output is correct
88 Correct 57 ms 17396 KB Output is correct
89 Correct 50 ms 16112 KB Output is correct
90 Correct 21 ms 7544 KB Output is correct
91 Correct 1 ms 596 KB Output is correct
92 Correct 12 ms 4012 KB Output is correct
93 Correct 169 ms 37376 KB Output is correct
94 Correct 36 ms 12268 KB Output is correct
95 Correct 278 ms 70144 KB Output is correct
96 Correct 279 ms 74372 KB Output is correct
97 Correct 444 ms 114404 KB Output is correct
98 Correct 274 ms 65052 KB Output is correct
99 Correct 1242 ms 269812 KB Output is correct
100 Correct 421 ms 79772 KB Output is correct
101 Correct 752 ms 159312 KB Output is correct
102 Correct 230 ms 45828 KB Output is correct
103 Correct 245 ms 67656 KB Output is correct
104 Correct 231 ms 67272 KB Output is correct
105 Correct 245 ms 70772 KB Output is correct
106 Correct 346 ms 99940 KB Output is correct
107 Correct 353 ms 99960 KB Output is correct
108 Correct 28 ms 7832 KB Output is correct
109 Correct 363 ms 74984 KB Output is correct
110 Correct 324 ms 80144 KB Output is correct
111 Correct 308 ms 82908 KB Output is correct
112 Correct 299 ms 75664 KB Output is correct
113 Correct 274 ms 69592 KB Output is correct