oj.uz

Submission #880144

# Submission time Handle Problem Language Result Execution time Memory
880144 2023-11-28T20:49:23 Z MilosMilutinovic Robot (JOI21_ho_t4) C++14
100 / 100
 522 ms 59432 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<array<int, 3>>> g(n);
  vector<vector<int>> col(n);
  for (int i = 0; i < m; i++) {
    int u, v, c, p;
    cin >> u >> v >> c >> p;
    --u; --v; --c;
    g[u].push_back({v, c, p});
    g[v].push_back({u, c, p});
    col[u].push_back(c);
    col[v].push_back(c);
  }
  const long long inf = 1e18;
  vector<vector<long long>> dist(n);
  vector<vector<long long>> tot(n);
  vector<vector<vector<int>>> ids(n);
  for (int i = 0; i < n; i++) {
    col[i].push_back(-1);
    sort(col[i].begin(), col[i].end());
    col[i].erase(unique(col[i].begin(), col[i].end()), col[i].end());
    int sz = (int) col[i].size();
    dist[i] = vector<long long>(sz, inf);
    tot[i].resize(sz);
    ids[i].resize(sz);
    for (int j = 0; j < (int) g[i].size(); j++) {
      array<int, 3> p = g[i][j];
      int idx = (int) (lower_bound(col[i].begin(), col[i].end(), p[1]) - col[i].begin());
      tot[i][idx] += p[2];
      ids[i][idx].push_back(j);
    }
  }
  dist[0][0] = 0;
  set<tuple<long long, int, int>> st;
  auto Update = [&](int v, long long d, int c) {
    c = (int) (lower_bound(col[v].begin(), col[v].end(), c) - col[v].begin());
    if (dist[v][c] <= d) {
      return;
    }
    if (dist[v][c] != inf) {
      st.erase(st.find({dist[v][c], v, c}));
    }
    dist[v][c] = d;
    st.insert({dist[v][c], v, c});
  }; 
  st.emplace(0, 0, 0);
  while (!st.empty()) {
    auto it = st.begin();
    long long d = get<0>(*it);
    int i = get<1>(*it);
    int c = get<2>(*it);
    st.erase(it);
    if (c == 0) {
      for (auto& p : g[i]) {
        Update(p[0], d, p[1]);
        int idx = (int) (lower_bound(col[i].begin(), col[i].end(), p[1]) - col[i].begin());
        Update(p[0], d + min((long long) p[2], tot[i][idx] - p[2]), -1);
      }
    } else {
      for (int j : ids[i][c]) {
        array<int, 3> p = g[i][j];
        Update(p[0], d + tot[i][c] - p[2], -1);
      }
    }
  }
  if (dist[n - 1][0] == inf) {
    cout << -1 << '\n';
  } else {
    cout << dist[n - 1][0] << '\n';
  }
  return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 17544 KB Output is correct
2 Correct 41 ms 9532 KB Output is correct
3 Correct 114 ms 17248 KB Output is correct
4 Correct 70 ms 13396 KB Output is correct
5 Correct 466 ms 57992 KB Output is correct
6 Correct 398 ms 53092 KB Output is correct
7 Correct 266 ms 54456 KB Output is correct
8 Correct 247 ms 44076 KB Output is correct
9 Correct 297 ms 44096 KB Output is correct
10 Correct 176 ms 31060 KB Output is correct
11 Correct 77 ms 31420 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 119 ms 17544 KB Output is correct
22 Correct 41 ms 9532 KB Output is correct
23 Correct 114 ms 17248 KB Output is correct
24 Correct 70 ms 13396 KB Output is correct
25 Correct 466 ms 57992 KB Output is correct
26 Correct 398 ms 53092 KB Output is correct
27 Correct 266 ms 54456 KB Output is correct
28 Correct 247 ms 44076 KB Output is correct
29 Correct 297 ms 44096 KB Output is correct
30 Correct 176 ms 31060 KB Output is correct
31 Correct 77 ms 31420 KB Output is correct
32 Correct 90 ms 12904 KB Output is correct
33 Correct 123 ms 16980 KB Output is correct
34 Correct 285 ms 30264 KB Output is correct
35 Correct 205 ms 25484 KB Output is correct
36 Correct 234 ms 41404 KB Output is correct
37 Correct 280 ms 46404 KB Output is correct
38 Correct 351 ms 54196 KB Output is correct
39 Correct 95 ms 18256 KB Output is correct
40 Correct 263 ms 45488 KB Output is correct
41 Correct 280 ms 45396 KB Output is correct
42 Correct 341 ms 46964 KB Output is correct
43 Correct 105 ms 18556 KB Output is correct
44 Correct 170 ms 22872 KB Output is correct
45 Correct 232 ms 41672 KB Output is correct
46 Correct 197 ms 39884 KB Output is correct
47 Correct 284 ms 45652 KB Output is correct
48 Correct 522 ms 59432 KB Output is correct