oj.uz

Submission #246323

# Submission time Handle Problem Language Result Execution time Memory
246323 2020-07-08T16:20:48 Z Nightlight Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 578 ms 27344 KB 
#include <bits/stdc++.h>
#define pii pair<long long, int>
using namespace std;

int N, M;
int S, T, U, V;
vector<pii> adj[100005];
vector<int> child[100005];
long long best[2][100005];//0 -> S, 1 -> T
long long dist[2][100005];//0 -> U, 1 -> V
long long dp[2][100005];
priority_queue<pii, vector<pii>, greater<pii>> pq;
long long opt, ans = 4e18;

void find_opt(int init, int id) {
  pq.emplace(0, init);
  best[id][init] = 0;
  int u, v;
  long long len, w;
  while(!pq.empty()) {
    u = pq.top().second;
    len = pq.top().first;
    pq.pop();

    for(pii now : adj[u]) {
      v = now.second;
      w = now.first;
      if(best[id][v] > len + w) {
        best[id][v] = len + w;
        pq.emplace(best[id][v], v);
      }
    }
  }
}

void make_DAG() {
  opt = best[0][T];
  int u, v;
  long long w;
  for(u = 1; u <= N; u++) {
    for(pii now : adj[u]) {
      v = now.second;
      w = now.first;
      if(best[0][u] + w + best[1][v] <= opt) child[u].emplace_back(v);
    }
  }
}

void find_dist(int init, int id) {
  pq.emplace(0, init);
  dist[id][init] = 0;
  int u, v;
  long long len, w;
  while(!pq.empty()) {
    u = pq.top().second;
    len = pq.top().first;
    pq.pop();

    for(pii now : adj[u]) {
      v = now.second;
      w = now.first;
      if(dist[id][v] > len + w) {
        dist[id][v] = len + w;
        pq.emplace(dist[id][v], v);
      }
    }
  }
}

long long depe(int id, int u) {
  if(u == T) return dist[id][T];
  if(dp[id][u] != -1) return dp[id][u];
  long long res = dist[id][u];
  for(int v : child[u]) {
    res = min(res, depe(id, v));
  }
  return dp[id][u] = res;
}

void solve() {
  find_opt(S, 0);
  find_opt(T, 1);
  make_DAG();
  find_dist(U, 0);
  find_dist(V, 1);

  ans = dist[0][V];
  for(int i = 1; i <= N; i++) {
    if(child[i].size() == 0) continue;
    ans = min(ans, dist[0][i] + depe(1, i));
    ans = min(ans, dist[1][i] + depe(0, i));
  }
  printf("%lld\n", ans);
  cin >> N;
}

int main() {
  memset(dp, -1, sizeof(dp));
  memset(best, 0x3f3f3f3f, sizeof(best));
  memset(dist, 0x3f3f3f3f, sizeof(dist));
  scanf("%d %d %d %d %d %d", &N, &M, &S, &T, &U, &V);
  int u, v, w;
  for(int i = 1; i <= M; i++) {
    scanf("%d %d %d", &u, &v, &w);
    adj[u].emplace_back(w, v);
    adj[v].emplace_back(w, u);
  }
  solve();
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d %d %d %d", &N, &M, &S, &T, &U, &V);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &u, &v, &w);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 24048 KB Output is correct
2 Correct 426 ms 23280 KB Output is correct
3 Correct 453 ms 26188 KB Output is correct
4 Correct 381 ms 24144 KB Output is correct
5 Correct 427 ms 23744 KB Output is correct
6 Correct 426 ms 24044 KB Output is correct
7 Correct 419 ms 24168 KB Output is correct
8 Correct 443 ms 24172 KB Output is correct
9 Correct 371 ms 23028 KB Output is correct
10 Correct 296 ms 23024 KB Output is correct
11 Correct 167 ms 20088 KB Output is correct
12 Correct 412 ms 23024 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 24048 KB Output is correct
2 Correct 500 ms 24428 KB Output is correct
3 Correct 509 ms 24432 KB Output is correct
4 Correct 427 ms 23784 KB Output is correct
5 Correct 436 ms 24048 KB Output is correct
6 Correct 417 ms 26124 KB Output is correct
7 Correct 551 ms 27344 KB Output is correct
8 Correct 578 ms 24048 KB Output is correct
9 Correct 454 ms 24532 KB Output is correct
10 Correct 447 ms 24560 KB Output is correct
11 Correct 194 ms 21336 KB Output is correct
12 Correct 416 ms 26860 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 11392 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 11 ms 9728 KB Output is correct
4 Correct 30 ms 13056 KB Output is correct
5 Correct 20 ms 11392 KB Output is correct
6 Correct 24 ms 9856 KB Output is correct
7 Correct 11 ms 9856 KB Output is correct
8 Correct 12 ms 9984 KB Output is correct
9 Correct 11 ms 9856 KB Output is correct
10 Correct 20 ms 11392 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 10 ms 9728 KB Output is correct
14 Correct 11 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 24048 KB Output is correct
2 Correct 426 ms 23280 KB Output is correct
3 Correct 453 ms 26188 KB Output is correct
4 Correct 381 ms 24144 KB Output is correct
5 Correct 427 ms 23744 KB Output is correct
6 Correct 426 ms 24044 KB Output is correct
7 Correct 419 ms 24168 KB Output is correct
8 Correct 443 ms 24172 KB Output is correct
9 Correct 371 ms 23028 KB Output is correct
10 Correct 296 ms 23024 KB Output is correct
11 Correct 167 ms 20088 KB Output is correct
12 Correct 412 ms 23024 KB Output is correct
13 Correct 446 ms 24048 KB Output is correct
14 Correct 500 ms 24428 KB Output is correct
15 Correct 509 ms 24432 KB Output is correct
16 Correct 427 ms 23784 KB Output is correct
17 Correct 436 ms 24048 KB Output is correct
18 Correct 417 ms 26124 KB Output is correct
19 Correct 551 ms 27344 KB Output is correct
20 Correct 578 ms 24048 KB Output is correct
21 Correct 454 ms 24532 KB Output is correct
22 Correct 447 ms 24560 KB Output is correct
23 Correct 194 ms 21336 KB Output is correct
24 Correct 416 ms 26860 KB Output is correct
25 Correct 20 ms 11392 KB Output is correct
26 Correct 10 ms 9728 KB Output is correct
27 Correct 11 ms 9728 KB Output is correct
28 Correct 30 ms 13056 KB Output is correct
29 Correct 20 ms 11392 KB Output is correct
30 Correct 24 ms 9856 KB Output is correct
31 Correct 11 ms 9856 KB Output is correct
32 Correct 12 ms 9984 KB Output is correct
33 Correct 11 ms 9856 KB Output is correct
34 Correct 20 ms 11392 KB Output is correct
35 Correct 10 ms 9728 KB Output is correct
36 Correct 10 ms 9728 KB Output is correct
37 Correct 10 ms 9728 KB Output is correct
38 Correct 11 ms 9728 KB Output is correct
39 Correct 10 ms 9728 KB Output is correct
40 Correct 387 ms 24084 KB Output is correct
41 Correct 371 ms 23024 KB Output is correct
42 Correct 381 ms 23296 KB Output is correct
43 Correct 198 ms 22264 KB Output is correct
44 Correct 185 ms 22520 KB Output is correct
45 Correct 399 ms 24936 KB Output is correct
46 Correct 372 ms 24936 KB Output is correct
47 Correct 391 ms 24044 KB Output is correct
48 Correct 200 ms 20344 KB Output is correct
49 Correct 297 ms 24032 KB Output is correct
50 Correct 414 ms 24432 KB Output is correct
51 Correct 374 ms 24936 KB Output is correct