oj.uz

Submission #770001

# Submission time Handle Problem Language Result Execution time Memory
770001 2023-06-30T16:09:18 Z mgl_diamond Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 244 ms 27308 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;

#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second

void setIO(string name) {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (!name.empty()) {
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
  }
}

const ll LINF = 1e18;
const int N = 1e5+5;
int n, m, source[4];
ll ans(LINF), dist[4][N], dp[N][2], vi[N];
vector<ii> graph[N];
vector<int> tree[N];

void dijkstra(int kth) {
  memset(dist[kth], 0x3f, sizeof(dist[kth]));
  dist[kth][source[kth]] = 0;
  priority_queue<pair<ll, int>> pq;      
  pq.push({0, source[kth]});
  while (!pq.empty()) {
    auto top = pq.top(); pq.pop();
    ll to = -top.fi;
    int u = top.se;
    if (to != dist[kth][u]) continue;
    fore(e, graph[u]) {
      ll cost = to + e.se;
      if (dist[kth][e.fi] > cost) {
        dist[kth][e.fi] = cost;
        pq.push({-cost, e.fi});
      }
    }
  }
}

void dfs(int u) {
  if (vi[u]) return;
  vi[u] = 1;
  fore(v, tree[u]) {
    dfs(v);
    dp[u][0] = min(dp[u][0], min(dp[v][0], dist[2][v]));
    dp[u][1] = min(dp[u][1], min(dp[v][1], dist[3][v]));
  }
  if (dp[u][0] < LINF) {
    ans = min(ans, dp[u][0] + dist[3][u]);
  }
  if (dp[u][1] < LINF) {
    ans = min(ans, dp[u][1] + dist[2][u]);
  }
}

int main() {
  setIO("");

  cin >> n >> m;

  foru(i, 0, 3) {
    cin >> source[i];
  }

  foru(i, 1, m) {
    int u, v, w;
    cin >> u >> v >> w;
    graph[u].emplace_back(v, w);
    graph[v].emplace_back(u, w);
  }

  foru(i, 0, 3) {
    dijkstra(i);
  }

  foru(i, 1, n) {
    fore(e, graph[i]) {
      int j = e.fi;
      if (dist[0][i] + dist[1][j] + e.se != dist[0][source[1]]) continue;
      tree[i].push_back(j);
    }
  }

  memset(dp, 0x3f, sizeof(dp));
  dfs(source[0]);
  cout << min(dist[2][source[3]], ans);
}

Compilation message

commuter_pass.cpp: In function 'void setIO(std::string)':
commuter_pass.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 17528 KB Output is correct
2 Correct 188 ms 17152 KB Output is correct
3 Correct 193 ms 27308 KB Output is correct
4 Correct 201 ms 21376 KB Output is correct
5 Correct 176 ms 21380 KB Output is correct
6 Correct 196 ms 21380 KB Output is correct
7 Correct 202 ms 21736 KB Output is correct
8 Correct 178 ms 21456 KB Output is correct
9 Correct 165 ms 20432 KB Output is correct
10 Correct 147 ms 20556 KB Output is correct
11 Correct 64 ms 20168 KB Output is correct
12 Correct 218 ms 20336 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 19212 KB Output is correct
2 Correct 194 ms 19696 KB Output is correct
3 Correct 207 ms 19000 KB Output is correct
4 Correct 197 ms 19496 KB Output is correct
5 Correct 193 ms 20308 KB Output is correct
6 Correct 206 ms 22892 KB Output is correct
7 Correct 219 ms 23516 KB Output is correct
8 Correct 244 ms 19712 KB Output is correct
9 Correct 210 ms 20400 KB Output is correct
10 Correct 199 ms 19104 KB Output is correct
11 Correct 69 ms 20396 KB Output is correct
12 Correct 185 ms 23180 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 10452 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 14 ms 11868 KB Output is correct
5 Correct 9 ms 10708 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 9 ms 10708 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9812 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 17528 KB Output is correct
2 Correct 188 ms 17152 KB Output is correct
3 Correct 193 ms 27308 KB Output is correct
4 Correct 201 ms 21376 KB Output is correct
5 Correct 176 ms 21380 KB Output is correct
6 Correct 196 ms 21380 KB Output is correct
7 Correct 202 ms 21736 KB Output is correct
8 Correct 178 ms 21456 KB Output is correct
9 Correct 165 ms 20432 KB Output is correct
10 Correct 147 ms 20556 KB Output is correct
11 Correct 64 ms 20168 KB Output is correct
12 Correct 218 ms 20336 KB Output is correct
13 Correct 181 ms 19212 KB Output is correct
14 Correct 194 ms 19696 KB Output is correct
15 Correct 207 ms 19000 KB Output is correct
16 Correct 197 ms 19496 KB Output is correct
17 Correct 193 ms 20308 KB Output is correct
18 Correct 206 ms 22892 KB Output is correct
19 Correct 219 ms 23516 KB Output is correct
20 Correct 244 ms 19712 KB Output is correct
21 Correct 210 ms 20400 KB Output is correct
22 Correct 199 ms 19104 KB Output is correct
23 Correct 69 ms 20396 KB Output is correct
24 Correct 185 ms 23180 KB Output is correct
25 Correct 9 ms 10452 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 4 ms 9684 KB Output is correct
28 Correct 14 ms 11868 KB Output is correct
29 Correct 9 ms 10708 KB Output is correct
30 Correct 6 ms 9812 KB Output is correct
31 Correct 6 ms 9812 KB Output is correct
32 Correct 6 ms 9812 KB Output is correct
33 Correct 5 ms 9812 KB Output is correct
34 Correct 9 ms 10708 KB Output is correct
35 Correct 4 ms 9684 KB Output is correct
36 Correct 4 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 5 ms 9684 KB Output is correct
39 Correct 5 ms 9812 KB Output is correct
40 Correct 188 ms 21784 KB Output is correct
41 Correct 176 ms 20380 KB Output is correct
42 Correct 177 ms 20680 KB Output is correct
43 Correct 78 ms 22732 KB Output is correct
44 Correct 84 ms 22796 KB Output is correct
45 Correct 196 ms 22884 KB Output is correct
46 Correct 162 ms 22660 KB Output is correct
47 Correct 166 ms 21184 KB Output is correct
48 Correct 91 ms 19584 KB Output is correct
49 Correct 139 ms 21408 KB Output is correct
50 Correct 164 ms 22136 KB Output is correct
51 Correct 186 ms 22804 KB Output is correct