oj.uz

Submission #530533

# Submission time Handle Problem Language Result Execution time Memory
530533 2022-02-25T18:21:40 Z Alex_tz307 Robot (JOI21_ho_t4) C++17
100 / 100
 895 ms 101108 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);
          }
          if (!dp[v].count(0) || dp[v][0] > cost + min((int64_t)w, sum[u][c] - w)) {
            dp[v][0] = cost + min((int64_t)w, sum[u][c] - w);
            pq.emplace(dp[v][0], 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 9 ms 16716 KB Output is correct
2 Correct 9 ms 16716 KB Output is correct
3 Correct 9 ms 16716 KB Output is correct
4 Correct 9 ms 16748 KB Output is correct
5 Correct 9 ms 16736 KB Output is correct
6 Correct 12 ms 16756 KB Output is correct
7 Correct 11 ms 16772 KB Output is correct
8 Correct 10 ms 16800 KB Output is correct
9 Correct 12 ms 17528 KB Output is correct
10 Correct 12 ms 17484 KB Output is correct
11 Correct 10 ms 17228 KB Output is correct
12 Correct 10 ms 17220 KB Output is correct
13 Correct 11 ms 17252 KB Output is correct
14 Correct 11 ms 17320 KB Output is correct
15 Correct 11 ms 17228 KB Output is correct
16 Correct 12 ms 17228 KB Output is correct
17 Correct 12 ms 17232 KB Output is correct
18 Correct 10 ms 16972 KB Output is correct
19 Correct 11 ms 16844 KB Output is correct
20 Correct 11 ms 17272 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 37816 KB Output is correct
2 Correct 91 ms 28428 KB Output is correct
3 Correct 243 ms 33124 KB Output is correct
4 Correct 140 ms 33468 KB Output is correct
5 Correct 798 ms 99392 KB Output is correct
6 Correct 677 ms 89740 KB Output is correct
7 Correct 440 ms 76384 KB Output is correct
8 Correct 479 ms 73268 KB Output is correct
9 Correct 479 ms 73352 KB Output is correct
10 Correct 395 ms 54312 KB Output is correct
11 Correct 154 ms 44220 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16716 KB Output is correct
2 Correct 9 ms 16716 KB Output is correct
3 Correct 9 ms 16716 KB Output is correct
4 Correct 9 ms 16748 KB Output is correct
5 Correct 9 ms 16736 KB Output is correct
6 Correct 12 ms 16756 KB Output is correct
7 Correct 11 ms 16772 KB Output is correct
8 Correct 10 ms 16800 KB Output is correct
9 Correct 12 ms 17528 KB Output is correct
10 Correct 12 ms 17484 KB Output is correct
11 Correct 10 ms 17228 KB Output is correct
12 Correct 10 ms 17220 KB Output is correct
13 Correct 11 ms 17252 KB Output is correct
14 Correct 11 ms 17320 KB Output is correct
15 Correct 11 ms 17228 KB Output is correct
16 Correct 12 ms 17228 KB Output is correct
17 Correct 12 ms 17232 KB Output is correct
18 Correct 10 ms 16972 KB Output is correct
19 Correct 11 ms 16844 KB Output is correct
20 Correct 11 ms 17272 KB Output is correct
21 Correct 230 ms 37816 KB Output is correct
22 Correct 91 ms 28428 KB Output is correct
23 Correct 243 ms 33124 KB Output is correct
24 Correct 140 ms 33468 KB Output is correct
25 Correct 798 ms 99392 KB Output is correct
26 Correct 677 ms 89740 KB Output is correct
27 Correct 440 ms 76384 KB Output is correct
28 Correct 479 ms 73268 KB Output is correct
29 Correct 479 ms 73352 KB Output is correct
30 Correct 395 ms 54312 KB Output is correct
31 Correct 154 ms 44220 KB Output is correct
32 Correct 158 ms 26696 KB Output is correct
33 Correct 221 ms 34368 KB Output is correct
34 Correct 477 ms 53656 KB Output is correct
35 Correct 378 ms 48416 KB Output is correct
36 Correct 401 ms 71072 KB Output is correct
37 Correct 470 ms 73108 KB Output is correct
38 Correct 472 ms 80440 KB Output is correct
39 Correct 172 ms 31332 KB Output is correct
40 Correct 480 ms 74724 KB Output is correct
41 Correct 516 ms 74784 KB Output is correct
42 Correct 592 ms 75004 KB Output is correct
43 Correct 233 ms 37560 KB Output is correct
44 Correct 445 ms 37592 KB Output is correct
45 Correct 408 ms 72272 KB Output is correct
46 Correct 377 ms 71584 KB Output is correct
47 Correct 389 ms 72928 KB Output is correct
48 Correct 895 ms 101108 KB Output is correct