oj.uz

Submission #530536

# Submission time Handle Problem Language Result Execution time Memory
530536 2022-02-25T18:24:38 Z Alex_tz307 Robot (JOI21_ho_t4) C++17
100 / 100
 843 ms 96420 KB 
#include <bits/stdc++.h>

using namespace std;

const int kN = 1e5;
unordered_map<int, vector<pair<int, int>>> g[1 + kN];
unordered_map<int, int64_t> sum[1 + kN], dp[1 + kN];

void testCase() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v, c, w;
    cin >> u >> v >> c >> w;
    g[u][c].emplace_back(v, w);
    g[v][c].emplace_back(u, w);
    sum[u][c] += w;
    sum[v][c] += w;
  }
  priority_queue<tuple<int64_t, int, int>, vector<tuple<int64_t, int, int>>, greater<tuple<int64_t, int, int>>> pq;
  dp[1][0] = 0;
  pq.emplace(0, 1, 0);
  while (!pq.empty()) {
    int64_t cost;
    int u, c;
    tie(cost, u, c) = pq.top();
    pq.pop();
    if (cost != dp[u][c]) {
      continue;
    }
    if (c == 0) {
      for (auto itr : g[u]) {
        int c = itr.first;
        for (auto it : itr.second) {
          int v, w;
          tie(v, w) = it;
          if (!dp[v].count(c) || dp[v][c] > cost) {
            dp[v][c] = cost;
            pq.emplace(cost, v, c);
          }
          int64_t wt = min((int64_t)w, sum[u][c] - w);
          if (!dp[v].count(0) || dp[v][0] > cost + wt) {
            dp[v][0] = cost + wt;
            pq.emplace(cost + wt, v, 0);
          }
        }
      }
    } else {
      for (auto it : g[u][c]) {
        int v, w;
        tie(v, w) = it;
        if (!dp[v].count(0) || dp[v][0] > cost + sum[u][c] - w) {
          dp[v][0] = cost + sum[u][c] - w;
          pq.emplace(dp[v][0], v, 0);
        }
      }
    }
  }
  if (!dp[n].count(0)) {
    cout << "-1\n";
  } else {
    cout << dp[n][0] << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16716 KB Output is correct
2 Correct 11 ms 16716 KB Output is correct
3 Correct 10 ms 16660 KB Output is correct
4 Correct 10 ms 16744 KB Output is correct
5 Correct 10 ms 16712 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 10 ms 16844 KB Output is correct
8 Correct 10 ms 16752 KB Output is correct
9 Correct 13 ms 17664 KB Output is correct
10 Correct 13 ms 17484 KB Output is correct
11 Correct 12 ms 17276 KB Output is correct
12 Correct 12 ms 17244 KB Output is correct
13 Correct 12 ms 17276 KB Output is correct
14 Correct 12 ms 17380 KB Output is correct
15 Correct 12 ms 17200 KB Output is correct
16 Correct 13 ms 17280 KB Output is correct
17 Correct 15 ms 17228 KB Output is correct
18 Correct 10 ms 16932 KB Output is correct
19 Correct 12 ms 16844 KB Output is correct
20 Correct 12 ms 17228 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 36692 KB Output is correct
2 Correct 102 ms 28256 KB Output is correct
3 Correct 337 ms 31092 KB Output is correct
4 Correct 155 ms 32900 KB Output is correct
5 Correct 802 ms 95976 KB Output is correct
6 Correct 665 ms 86292 KB Output is correct
7 Correct 409 ms 72712 KB Output is correct
8 Correct 478 ms 69556 KB Output is correct
9 Correct 503 ms 69756 KB Output is correct
10 Correct 389 ms 52412 KB Output is correct
11 Correct 166 ms 42756 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16716 KB Output is correct
2 Correct 11 ms 16716 KB Output is correct
3 Correct 10 ms 16660 KB Output is correct
4 Correct 10 ms 16744 KB Output is correct
5 Correct 10 ms 16712 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 10 ms 16844 KB Output is correct
8 Correct 10 ms 16752 KB Output is correct
9 Correct 13 ms 17664 KB Output is correct
10 Correct 13 ms 17484 KB Output is correct
11 Correct 12 ms 17276 KB Output is correct
12 Correct 12 ms 17244 KB Output is correct
13 Correct 12 ms 17276 KB Output is correct
14 Correct 12 ms 17380 KB Output is correct
15 Correct 12 ms 17200 KB Output is correct
16 Correct 13 ms 17280 KB Output is correct
17 Correct 15 ms 17228 KB Output is correct
18 Correct 10 ms 16932 KB Output is correct
19 Correct 12 ms 16844 KB Output is correct
20 Correct 12 ms 17228 KB Output is correct
21 Correct 245 ms 36692 KB Output is correct
22 Correct 102 ms 28256 KB Output is correct
23 Correct 337 ms 31092 KB Output is correct
24 Correct 155 ms 32900 KB Output is correct
25 Correct 802 ms 95976 KB Output is correct
26 Correct 665 ms 86292 KB Output is correct
27 Correct 409 ms 72712 KB Output is correct
28 Correct 478 ms 69556 KB Output is correct
29 Correct 503 ms 69756 KB Output is correct
30 Correct 389 ms 52412 KB Output is correct
31 Correct 166 ms 42756 KB Output is correct
32 Correct 146 ms 23280 KB Output is correct
33 Correct 275 ms 31776 KB Output is correct
34 Correct 500 ms 50376 KB Output is correct
35 Correct 379 ms 45796 KB Output is correct
36 Correct 418 ms 68676 KB Output is correct
37 Correct 489 ms 70360 KB Output is correct
38 Correct 453 ms 77192 KB Output is correct
39 Correct 174 ms 27076 KB Output is correct
40 Correct 488 ms 69576 KB Output is correct
41 Correct 545 ms 69704 KB Output is correct
42 Correct 614 ms 70728 KB Output is correct
43 Correct 230 ms 35432 KB Output is correct
44 Correct 433 ms 33292 KB Output is correct
45 Correct 441 ms 68556 KB Output is correct
46 Correct 380 ms 68224 KB Output is correct
47 Correct 433 ms 69868 KB Output is correct
48 Correct 843 ms 96420 KB Output is correct