oj.uz

답안 #940603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940603 2024-03-07T11:29:09 Z evenvalue Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 450 ms 39988 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef evenvalue
  #include "debug.h"
#else
  #define debug(...)
#endif

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

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>>;

namespace Read {
int Int() {
  int x;
  cin >> x;
  return x;
}
int64 Int64() {
  int64 x;
  cin >> x;
  return x;
}
char Char() {
  char c;
  cin >> c;
  return c;
}
string String() {
  string s;
  cin >> s;
  return s;
}
double Double() {
  return stod(String());
}
ld LongDouble() {
  return stold(String());
}
template<typename T1, typename T2>
pair<T1, T2> Pair() {
  pair<T1, T2> p;
  cin >> p.first >> p.second;
  return p;
}
template<typename T>
vector<T> Vec(const int n) {
  vector<T> v(n);
  for (T &x : v) {
    cin >> x;
  }
  return v;
}
template<typename T>
vector<vector<T>> VecVec(const int n, const int m) {
  vector<vector<T>> v(n);
  for (vector<T> &vec : v) {
    vec = Vec<T>(m);
  }
  return v;
}
}//namespace Read

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e16 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kMaxN = 2e5 + 10;

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

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

  for (const int x : s) {
    d[x] = 0;
    q.emplace(0, x);
  }

  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) {
        d[y] = d[x] + w;
        p[y].clear();
        q.emplace(d[y], y);
      }
      if (d[y] == d[x] + w) {
        p[y].push_back(x);
      }
    }
  }

  return make_pair(d, p);
}

inline void solution() {
  const auto n = Read::Int();
  const auto m = Read::Int();
  const auto s = Read::Int() - 1;
  const auto t = Read::Int() - 1;
  const auto u = Read::Int() - 1;
  const auto v = Read::Int() - 1;

  vector<vector<pair<int, int64>>> g(n);
  for (int i = 0; i < m; i++) {
    const auto x = Read::Int() - 1;
    const auto y = Read::Int() - 1;
    const auto w = Read::Int();
    g[x].emplace_back(y, w);
    g[y].emplace_back(x, w);
  }

  const auto foo = dijkstra(g, {s});
  const auto &ds = foo.first;
  const auto &p = foo.second;
  const auto dt = dijkstra(g, {t}).first;
  const auto du = dijkstra(g, {u}).first;
  const auto dv = dijkstra(g, {v}).first;

  vector<vector<int>> dag(n);
  for (int y = 0; y < n; y++) {
    if (ds[y] + dt[y] != ds[t]) continue;
    for (const int x : p[y]) {
      if (ds[x] + dt[x] != ds[t]) continue;
      dag[x].push_back(y);
    }
  }

  auto topsort = [&]() {
    vector<int> order;
    vector<bool> visit(n);

    function<void(int)> dfs = [&](const int x) {
      visit[x] = true;
      for (const int y : dag[x]) {
        if (not visit[y]) dfs(y);
      }
      order.push_back(x);
    };

    for (int x = 0; x < n; x++) {
      if (ds[x] + dt[x] != ds[t]) continue;
      if (not visit[x]) dfs(x);
    }

    return order;
  };

  const auto order = topsort();

  vector<int64> best_u = du;
  vector<int64> best_v = dv;

  int64 ans = du[v];
  for (const int x : order) {
    for (const int y : dag[x]) {
      best_u[x] = min(best_u[x], best_u[y]);
      best_v[x] = min(best_v[x], best_v[y]);
    }
    ans = min(ans, best_u[x] + dv[x]);
    ans = min(ans, best_v[x] + du[x]);
  }

  cout << ans << '\n';
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  //freopen(".in", "r", stdin);
  //freopen(".out", "w", stdout);

  cout << fixed << setprecision(10);

  int testcases = 1;
  //cin >> testcases;
  while (testcases--) {
    solution();
  }
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 37892 KB Output is correct
2 Correct 305 ms 37200 KB Output is correct
3 Correct 288 ms 37576 KB Output is correct
4 Correct 309 ms 37716 KB Output is correct
5 Correct 305 ms 37112 KB Output is correct
6 Correct 342 ms 37792 KB Output is correct
7 Correct 323 ms 37116 KB Output is correct
8 Correct 350 ms 37268 KB Output is correct
9 Correct 293 ms 38048 KB Output is correct
10 Correct 291 ms 38272 KB Output is correct
11 Correct 135 ms 29868 KB Output is correct
12 Correct 304 ms 39988 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 317 ms 37256 KB Output is correct
2 Correct 306 ms 36992 KB Output is correct
3 Correct 316 ms 37204 KB Output is correct
4 Correct 302 ms 36960 KB Output is correct
5 Correct 306 ms 37068 KB Output is correct
6 Correct 372 ms 37512 KB Output is correct
7 Correct 338 ms 37216 KB Output is correct
8 Correct 354 ms 37472 KB Output is correct
9 Correct 313 ms 37308 KB Output is correct
10 Correct 318 ms 37000 KB Output is correct
11 Correct 186 ms 30032 KB Output is correct
12 Correct 339 ms 37488 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2136 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 12 ms 3932 KB Output is correct
5 Correct 8 ms 2000 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 6 ms 2140 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 37892 KB Output is correct
2 Correct 305 ms 37200 KB Output is correct
3 Correct 288 ms 37576 KB Output is correct
4 Correct 309 ms 37716 KB Output is correct
5 Correct 305 ms 37112 KB Output is correct
6 Correct 342 ms 37792 KB Output is correct
7 Correct 323 ms 37116 KB Output is correct
8 Correct 350 ms 37268 KB Output is correct
9 Correct 293 ms 38048 KB Output is correct
10 Correct 291 ms 38272 KB Output is correct
11 Correct 135 ms 29868 KB Output is correct
12 Correct 304 ms 39988 KB Output is correct
13 Correct 317 ms 37256 KB Output is correct
14 Correct 306 ms 36992 KB Output is correct
15 Correct 316 ms 37204 KB Output is correct
16 Correct 302 ms 36960 KB Output is correct
17 Correct 306 ms 37068 KB Output is correct
18 Correct 372 ms 37512 KB Output is correct
19 Correct 338 ms 37216 KB Output is correct
20 Correct 354 ms 37472 KB Output is correct
21 Correct 313 ms 37308 KB Output is correct
22 Correct 318 ms 37000 KB Output is correct
23 Correct 186 ms 30032 KB Output is correct
24 Correct 339 ms 37488 KB Output is correct
25 Correct 7 ms 2136 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 12 ms 3932 KB Output is correct
29 Correct 8 ms 2000 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 612 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1 ms 432 KB Output is correct
34 Correct 6 ms 2140 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 289 ms 37724 KB Output is correct
41 Correct 350 ms 37988 KB Output is correct
42 Correct 367 ms 38004 KB Output is correct
43 Correct 282 ms 31232 KB Output is correct
44 Correct 199 ms 29976 KB Output is correct
45 Correct 353 ms 36664 KB Output is correct
46 Correct 349 ms 36900 KB Output is correct
47 Correct 450 ms 37508 KB Output is correct
48 Correct 246 ms 29540 KB Output is correct
49 Correct 326 ms 37424 KB Output is correct
50 Correct 347 ms 37108 KB Output is correct
51 Correct 355 ms 36704 KB Output is correct