oj.uz

답안 #505933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
505933 2022-01-11T10:41:18 Z cig32 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 456 ms 32580 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long

int rnd(int x, int y) { // random number generator
  int u= uniform_int_distribution<int>(x, y)(rng); return u;
}
int dist[4][MAXN];
bool cmp(int a, int b) {
  return dist[0][a] > dist[0][b];
}
void solve(int tc) {
  int N, M;
  cin >> N >> M;
  int r[4]; for(int i=0; i<4; i++)cin >> r[i];
  vector<pair<int, int> > adj[N+1];
  vector<int> ok[N+1];
  for(int i=0; i<M; i++) {
    int a, b, c; cin >> a >> b >> c;
    adj[a].push_back({b, c});
    adj[b].push_back({a, c});
  }
  for(int i=0; i<4; i++) {
    for(int j=1; j<=N; j++) dist[i][j] = 1e17;
  }
  for(int i=0; i<4; i++) dist[i][r[i]] = 0;
  for(int i=0; i<4; i++) {
    bool vis[N+1] = {};
    priority_queue<pair<int, int>,vector<pair<int, int> >, greater<pair<int,int> > > pq;
    for(int j=1; j<=N; j++) pq.push({dist[i][j], j});
    while(pq.size()) {
      pair<int, int> t= pq.top(); pq.pop();
      if(!vis[t.second]) {
        vis[t.second] = 1;
        for(pair<int, int> x: adj[t.second]) {
          if(!vis[x.first] && dist[i][t.second] != 1e17 && dist[i][x.first] > dist[i][t.second] + x.second) {
            dist[i][x.first] = dist[i][t.second] + x.second;
            pq.push({dist[i][x.first], x.first});
          }
        }
      }
    }
  }
  vector<int> rg[N+1];
  for(int i=1; i<=N; i++) {
    for(pair<int,int> x: adj[i]) {
      if(dist[0][i] + x.second == dist[0][x.first] && dist[0][x.first] + dist[1][x.first] == dist[0][r[1]]) {
        ok[i].push_back(x.first);
        rg[x.first].push_back(i);
      }
    }
  }
  int p[N+1]; for(int i=1; i<=N; i++) p[i] = i;
  sort(p+1, p+N+1, cmp);
  int dp[N+1];
  for(int i=1; i<=N; i++) dp[i] = 1e17;
  int ans = dist[2][r[3]];
  for(int i=1; i<=N; i++) {
    int tar = p[i];
    dp[tar] = dist[3][tar];
    for(int x: ok[tar]) {
      dp[tar] = min(dp[tar], dp[x]);
    }
    ans = min(ans, dp[tar] + dist[2][tar]);
  }
  reverse(p+1, p+N+1);
  for(int i=1; i<=N; i++) {
    int tar = p[i];
    dp[tar] = dist[3][tar];
    for(int x: rg[tar]) {
      dp[tar] = min(dp[tar], dp[x]);
    }
    ans = min(ans, dp[tar] + dist[2][tar]);
  }
  cout << ans << "\n";
}

int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 29248 KB Output is correct
2 Correct 394 ms 28824 KB Output is correct
3 Correct 442 ms 29752 KB Output is correct
4 Correct 372 ms 29128 KB Output is correct
5 Correct 394 ms 28536 KB Output is correct
6 Correct 405 ms 29508 KB Output is correct
7 Correct 379 ms 29068 KB Output is correct
8 Correct 390 ms 28696 KB Output is correct
9 Correct 379 ms 29432 KB Output is correct
10 Correct 327 ms 29376 KB Output is correct
11 Correct 262 ms 21708 KB Output is correct
12 Correct 368 ms 29292 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 432 ms 28944 KB Output is correct
2 Correct 420 ms 28808 KB Output is correct
3 Correct 384 ms 28656 KB Output is correct
4 Correct 409 ms 28728 KB Output is correct
5 Correct 369 ms 28672 KB Output is correct
6 Correct 380 ms 29140 KB Output is correct
7 Correct 456 ms 29296 KB Output is correct
8 Correct 400 ms 28616 KB Output is correct
9 Correct 427 ms 28768 KB Output is correct
10 Correct 394 ms 28768 KB Output is correct
11 Correct 237 ms 22980 KB Output is correct
12 Correct 418 ms 29472 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 2124 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 15 ms 3800 KB Output is correct
5 Correct 8 ms 2112 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 8 ms 2140 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 29248 KB Output is correct
2 Correct 394 ms 28824 KB Output is correct
3 Correct 442 ms 29752 KB Output is correct
4 Correct 372 ms 29128 KB Output is correct
5 Correct 394 ms 28536 KB Output is correct
6 Correct 405 ms 29508 KB Output is correct
7 Correct 379 ms 29068 KB Output is correct
8 Correct 390 ms 28696 KB Output is correct
9 Correct 379 ms 29432 KB Output is correct
10 Correct 327 ms 29376 KB Output is correct
11 Correct 262 ms 21708 KB Output is correct
12 Correct 368 ms 29292 KB Output is correct
13 Correct 432 ms 28944 KB Output is correct
14 Correct 420 ms 28808 KB Output is correct
15 Correct 384 ms 28656 KB Output is correct
16 Correct 409 ms 28728 KB Output is correct
17 Correct 369 ms 28672 KB Output is correct
18 Correct 380 ms 29140 KB Output is correct
19 Correct 456 ms 29296 KB Output is correct
20 Correct 400 ms 28616 KB Output is correct
21 Correct 427 ms 28768 KB Output is correct
22 Correct 394 ms 28768 KB Output is correct
23 Correct 237 ms 22980 KB Output is correct
24 Correct 418 ms 29472 KB Output is correct
25 Correct 9 ms 2124 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 15 ms 3800 KB Output is correct
29 Correct 8 ms 2112 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 528 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 8 ms 2140 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 405 ms 29140 KB Output is correct
41 Correct 353 ms 29304 KB Output is correct
42 Correct 349 ms 29432 KB Output is correct
43 Correct 227 ms 25460 KB Output is correct
44 Correct 242 ms 25264 KB Output is correct
45 Correct 388 ms 32580 KB Output is correct
46 Correct 418 ms 32160 KB Output is correct
47 Correct 398 ms 29328 KB Output is correct
48 Correct 234 ms 24736 KB Output is correct
49 Correct 297 ms 28788 KB Output is correct
50 Correct 378 ms 30784 KB Output is correct
51 Correct 363 ms 32464 KB Output is correct