oj.uz

Submission #813122

# Submission time Handle Problem Language Result Execution time Memory
813122 2023-08-07T13:43:06 Z trangtranha28 Robot (JOI21_ho_t4) C++14
100 / 100
 1068 ms 80904 KB 
#include <bits/stdc++.h>
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define fore(x, v) for(auto &x : v)
#define fi first
#define se second
using namespace std; 
 
const long long INF = 1e15;
const int N = 1e5+5;
const int M = 2e5+5;
 
int n, m;
map <int, vector <pair <int, int> > > graph[N];
long long dp[N];
map<int, long long> dp2[N], sum[N];
 
int main() {
  cin >> n >> m;

  foru(i, 1, m) {
    int u, v, c, p;
    cin >> u >> v >> c >> p;
    graph[u][c].emplace_back(v, p);
    graph[v][c].emplace_back(u, p);
    sum[u][c] += p;
    sum[v][c] += p;
  } 

  memset(dp, 0x3f, sizeof(dp));
  priority_queue <pair <long long, pair <int, int> > > pq;
  dp[1] = 0;
  pq.push({0, {1, 0}});

  while (!pq.empty()) {
    auto top = pq.top(); pq.pop();

    long long cost = top.fi;
    int u = top.se.fi, c = top.se.se;

    if (!c) {
      if (-cost != dp[u]) continue;
      fore(nc, graph[u]) fore(info, nc.se) {
        int v = info.fi, p = info.se;
        long long ncost;

        ncost = sum[u][nc.fi] - p - cost;
        if (ncost < dp[v]) {
          dp[v] = ncost;
          pq.push({-ncost, {v, 0}});
        }

        ncost = p - cost;
        if (ncost < dp[v]) {
          dp[v] = ncost;
          pq.push({-ncost, {v, 0}});
        }

        ncost = -cost;
        if ((dp2[v].find(nc.fi) == dp2[v].end()) || ncost < dp2[v][nc.fi]) {
          dp2[v][nc.fi] = ncost;
          pq.push({-ncost, {v, nc.fi}});
        }
      }
    } 
    else {
      if (-cost != dp2[u][c]) continue;
      long long ncost = sum[u][c] - cost;
      fore(info, graph[u][c]) {
        int v = info.fi, p = info.se;
        if (ncost - p < dp[v]) {
          dp[v] = ncost - p;
          pq.push({-ncost + p, {v, 0}});
        }
      }
    }
  }

  cout << (dp[n] < INF ? dp[n] : -1);
  return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15060 KB Output is correct
2 Correct 6 ms 15060 KB Output is correct
3 Correct 6 ms 15060 KB Output is correct
4 Correct 7 ms 15060 KB Output is correct
5 Correct 7 ms 15148 KB Output is correct
6 Correct 9 ms 15236 KB Output is correct
7 Correct 7 ms 15224 KB Output is correct
8 Correct 7 ms 15172 KB Output is correct
9 Correct 9 ms 15700 KB Output is correct
10 Correct 9 ms 15700 KB Output is correct
11 Correct 9 ms 15444 KB Output is correct
12 Correct 8 ms 15420 KB Output is correct
13 Correct 8 ms 15432 KB Output is correct
14 Correct 8 ms 15432 KB Output is correct
15 Correct 8 ms 15432 KB Output is correct
16 Correct 11 ms 15444 KB Output is correct
17 Correct 10 ms 15460 KB Output is correct
18 Correct 7 ms 15252 KB Output is correct
19 Correct 8 ms 15316 KB Output is correct
20 Correct 8 ms 15344 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 33756 KB Output is correct
2 Correct 65 ms 24692 KB Output is correct
3 Correct 187 ms 29292 KB Output is correct
4 Correct 100 ms 27344 KB Output is correct
5 Correct 818 ms 79180 KB Output is correct
6 Correct 656 ms 68144 KB Output is correct
7 Correct 383 ms 51616 KB Output is correct
8 Correct 390 ms 46492 KB Output is correct
9 Correct 388 ms 46536 KB Output is correct
10 Correct 270 ms 46320 KB Output is correct
11 Correct 126 ms 30924 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15060 KB Output is correct
2 Correct 6 ms 15060 KB Output is correct
3 Correct 6 ms 15060 KB Output is correct
4 Correct 7 ms 15060 KB Output is correct
5 Correct 7 ms 15148 KB Output is correct
6 Correct 9 ms 15236 KB Output is correct
7 Correct 7 ms 15224 KB Output is correct
8 Correct 7 ms 15172 KB Output is correct
9 Correct 9 ms 15700 KB Output is correct
10 Correct 9 ms 15700 KB Output is correct
11 Correct 9 ms 15444 KB Output is correct
12 Correct 8 ms 15420 KB Output is correct
13 Correct 8 ms 15432 KB Output is correct
14 Correct 8 ms 15432 KB Output is correct
15 Correct 8 ms 15432 KB Output is correct
16 Correct 11 ms 15444 KB Output is correct
17 Correct 10 ms 15460 KB Output is correct
18 Correct 7 ms 15252 KB Output is correct
19 Correct 8 ms 15316 KB Output is correct
20 Correct 8 ms 15344 KB Output is correct
21 Correct 180 ms 33756 KB Output is correct
22 Correct 65 ms 24692 KB Output is correct
23 Correct 187 ms 29292 KB Output is correct
24 Correct 100 ms 27344 KB Output is correct
25 Correct 818 ms 79180 KB Output is correct
26 Correct 656 ms 68144 KB Output is correct
27 Correct 383 ms 51616 KB Output is correct
28 Correct 390 ms 46492 KB Output is correct
29 Correct 388 ms 46536 KB Output is correct
30 Correct 270 ms 46320 KB Output is correct
31 Correct 126 ms 30924 KB Output is correct
32 Correct 196 ms 25144 KB Output is correct
33 Correct 176 ms 27428 KB Output is correct
34 Correct 367 ms 48112 KB Output is correct
35 Correct 275 ms 39636 KB Output is correct
36 Correct 319 ms 43268 KB Output is correct
37 Correct 383 ms 44980 KB Output is correct
38 Correct 338 ms 50920 KB Output is correct
39 Correct 183 ms 27604 KB Output is correct
40 Correct 454 ms 47960 KB Output is correct
41 Correct 411 ms 48080 KB Output is correct
42 Correct 530 ms 57728 KB Output is correct
43 Correct 175 ms 35760 KB Output is correct
44 Correct 363 ms 39232 KB Output is correct
45 Correct 316 ms 44508 KB Output is correct
46 Correct 368 ms 44536 KB Output is correct
47 Correct 414 ms 45132 KB Output is correct
48 Correct 1068 ms 80904 KB Output is correct