oj.uz

답안 #670827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670827 2022-12-10T18:45:22 Z dattranxxx Relay Marathon (NOI20_relaymarathon) C++11
25 / 100
 1393 ms 133820 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#define int ll

const int N = 1e5 + 5, inf = 1e16;
vector<pair<int, int>> adj[N];
int special[N];
int n, m, k;

priority_queue<pair<int, int>> q;
int dis[N], src[N];

int dijkstra(int s, int t) {
  memset(dis, 0x3f, sizeof(dis));
  q.emplace(0, s); dis[s] = 0;
  while (!q.empty()) {
    int d, u; tie(d, u) = q.top(); q.pop();
    if (-d != dis[u]) continue;
    if (special[u] && u != s && u != t) return dis[u];
    for (auto& p : adj[u]) {
      int v, w; tie(v, w) = p;
      if (dis[u] + w < dis[v]) 
        dis[v] = dis[u] + w, q.emplace(-dis[v], v);
    }
  }
  return inf;
}

tuple<int, int, int> dijkstra0(int x = -1, int y = -1) {
  memset(dis, 0x3f, sizeof(dis));
  for (int v = 0; v < n; ++v) if (special[v])
    dis[v] = 0, src[v] = v, q.emplace(0, v);
  while (!q.empty()) {
    int d, u; tie(d, u) = q.top(); q.pop();
    if (-d != dis[u]) continue;
    for (auto& p : adj[u]) {
      int v, w; tie(v, w) = p;
      if (dis[u] + w < dis[v]) 
        dis[v] = dis[u] + w, src[v] = src[u], q.emplace(-dis[v], v);
    }
  }
  int res = inf, s = -1, t = -1;
  for (int u = 0; u < n; ++u) for (auto& p : adj[u]) {
    int v, w; tie(v, w) = p;
    if (src[u] == x || src[u] == y || src[v] == x || src[v] == y) continue;
    if (src[u] != src[v] && dis[u] + dis[v] + w < res)
      res = dis[u] + dis[v] + w, s = src[u], t = src[v];
  }
  return make_tuple(res, s, t);
}

signed main() {
  cin.tie(0)->sync_with_stdio(0); cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 0, u, v, w; i < m; ++i)
    cin >> u >> v >> w, u--, v--,
    adj[u].emplace_back(v, w),
    adj[v].emplace_back(u, w);
    
  for (int i = 0, v; i < k; ++i)
    cin >> v, v--, special[v] = 1;
  
    
  int val1, val2, s, t, tmp1, tmp2;
  tie(val1, s, t) = dijkstra0(); tie(val2, tmp1, tmp2) = dijkstra0(s, t);
  cout << min(val1 + val2, dijkstra(s, t) + dijkstra(t, s));
	return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 8732 KB Output is correct
2 Correct 6 ms 4232 KB Output is correct
3 Correct 1208 ms 120224 KB Output is correct
4 Correct 571 ms 59768 KB Output is correct
5 Correct 158 ms 14660 KB Output is correct
6 Correct 124 ms 12300 KB Output is correct
7 Correct 180 ms 15824 KB Output is correct
8 Correct 60 ms 8908 KB Output is correct
9 Correct 105 ms 11720 KB Output is correct
10 Correct 90 ms 9820 KB Output is correct
11 Correct 1279 ms 127148 KB Output is correct
12 Correct 113 ms 10252 KB Output is correct
13 Correct 351 ms 36552 KB Output is correct
14 Correct 200 ms 16672 KB Output is correct
15 Correct 1238 ms 124688 KB Output is correct
16 Correct 40 ms 8008 KB Output is correct
17 Correct 885 ms 92968 KB Output is correct
18 Correct 7 ms 4564 KB Output is correct
19 Correct 1393 ms 133820 KB Output is correct
20 Correct 167 ms 15728 KB Output is correct
21 Correct 157 ms 13968 KB Output is correct
22 Correct 75 ms 9676 KB Output is correct
23 Correct 20 ms 7140 KB Output is correct
24 Correct 836 ms 102612 KB Output is correct
25 Correct 125 ms 11664 KB Output is correct
26 Correct 54 ms 8660 KB Output is correct
27 Correct 98 ms 10560 KB Output is correct
28 Correct 13 ms 5716 KB Output is correct
29 Correct 177 ms 15520 KB Output is correct
30 Correct 318 ms 29272 KB Output is correct

Subtask #4
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3412 KB Output isn't correct
2 Halted 0 ms 0 KB -