oj.uz

Submission #261638

# Submission time Handle Problem Language Result Execution time Memory
261638 2020-08-11T23:21:15 Z Haunted_Cpp Relay Marathon (NOI20_relaymarathon) C++17
25 / 100
 1956 ms 72176 KB 
/**
 *  author: Haunted_Cpp
**/
 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
 
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
 
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif

const int MAX_N = 1e5 + 5;
const int INF = 1e9 + 5;

vector<vector<pair<int, int>>> g(MAX_N);

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int st, et, w;
    cin >> st >> et >> w;
    --st; --et;
    g[st].emplace_back(et, w);
    g[et].emplace_back(st, w);
  }
  vector<bool> is_special(n);
  for (int i = 0; i < k; i++) {
    int foo;
    cin >> foo;
    --foo;
    is_special[foo] = true;
  }
  int res = 0;
  int add = 0;
  auto Dijkstra = [&]() {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    vector<int> dist(n, INF);
    vector<int> root(n, -1);
    vector<pair<int, int>> closest_vertex(n, {INF, -1});
    for (int i = 0; i < n; i++) {
      if (is_special[i]) {
        dist[i] = 0;
        root[i] = i;
        pq.push({dist[i], i});
      }
    }
    while(!pq.empty()) {
      int node = pq.top().second;
      int w = pq.top().first;
      pq.pop();
      if (w != dist[node]) continue;
      for (auto to : g[node]) {
        if (root[to.first] != -1 && root[to.first] != root[node]) {
          pair<int, int> best_way = {dist[node] + to.second + dist[to.first], root[to.first]};
          closest_vertex[root[node]] = min(closest_vertex[root[node]], best_way);
        }
        if (dist[to.first] > dist[node] + to.second) {
          dist[to.first] = dist[node] + to.second;
          root[to.first] = root[node];
          pq.push({dist[to.first], to.first});
        }
      }
    }
    int mn = 1e9;
    for (int i = 0; i < n; i++) {
      if (!is_special[i]) continue;
      mn = min(mn, closest_vertex[i].first);
    }
    add = mn;
    for (int i = 0; i < n; i++) {
      if (!is_special[i]) continue;
      if (closest_vertex[i].first == mn) {
        res += closest_vertex[i].first;
        is_special[i] = false;
        is_special[closest_vertex[i].second] = false;
        break;
      }
    }
    return closest_vertex;
  };
  if (n > 500) {
    Dijkstra();
    Dijkstra();
    cout << res << '\n';
  } else {
    int mn = 1e9;
    vector<pair<int, int>> dist = Dijkstra();
    for (int i = 0; i < n; i++) {
      int res = dist[i].first;
      is_special[i] = false;
      is_special[dist[i].second] = false;
      add = 0;
      Dijkstra();
      res += add;
      mn = min(mn, res);
      is_special[i] = true;
      is_special[dist[i].second] = true;
    }
    cout << mn << '\n';
  }
  return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 5248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 5248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 7104 KB Output is correct
2 Correct 8 ms 4736 KB Output is correct
3 Correct 1755 ms 64052 KB Output is correct
4 Correct 801 ms 33312 KB Output is correct
5 Correct 218 ms 10604 KB Output is correct
6 Correct 190 ms 9188 KB Output is correct
7 Correct 251 ms 11340 KB Output is correct
8 Correct 78 ms 7160 KB Output is correct
9 Correct 140 ms 8848 KB Output is correct
10 Correct 103 ms 7672 KB Output is correct
11 Correct 1843 ms 67692 KB Output is correct
12 Correct 131 ms 7928 KB Output is correct
13 Correct 498 ms 21620 KB Output is correct
14 Correct 247 ms 11476 KB Output is correct
15 Correct 1956 ms 66468 KB Output is correct
16 Correct 64 ms 6776 KB Output is correct
17 Correct 1293 ms 51096 KB Output is correct
18 Correct 9 ms 4736 KB Output is correct
19 Correct 1938 ms 72176 KB Output is correct
20 Correct 204 ms 10928 KB Output is correct
21 Correct 181 ms 10264 KB Output is correct
22 Correct 101 ms 7556 KB Output is correct
23 Correct 28 ms 6240 KB Output is correct
24 Correct 1248 ms 55120 KB Output is correct
25 Correct 143 ms 8968 KB Output is correct
26 Correct 79 ms 7160 KB Output is correct
27 Correct 124 ms 8268 KB Output is correct
28 Correct 19 ms 5504 KB Output is correct
29 Correct 251 ms 11080 KB Output is correct
30 Correct 458 ms 18152 KB Output is correct

Subtask #4
0 / 58.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 5248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -