Submission #803782

#	Time	Username	Problem	Language	Result	Execution time	Memory
803782		arush_agu	Evacuation plan (IZhO18_plan)	C++17	54 / 100	4042 ms	81732 KiB

plan

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n, m;
  cin >> n >> m;
  vvii adj(n);
  vector<set<int>> adj_set(n);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    adj[u].push_back({v, w}), adj[v].push_back({u, w});
    adj_set[u].insert(v), adj_set[v].insert(u);
  }
  int k;
  cin >> k;
  vi nuc(k);
  for (int &x : nuc)
    cin >> x, x--;

  vi dist(n, INF);
  vb vis(n);
  priority_queue<ii, vii, greater<ii>> pq;
  for (int &x : nuc)
    pq.push({0, x}), dist[x] = 0;

  while (!pq.empty()) {
    auto [d, u] = pq.top();
    pq.pop();

    if (vis[u])
      continue;
    vis[u] = 1;

    for (auto [v, w] : adj[u])
      if (!vis[v] && dist[v] > w + d) {
        dist[v] = d + w;
        pq.push({d + w, v});
      }
  }

  int q;
  cin >> q;
  while (q--) {
    int s, t;
    cin >> s >> t;
    s--, t--;

    if (adj_set[s].count(t)) {
      cout << min(dist[s], dist[t]) << '\n';
      continue;
    }

    vi par(n, -1);
    vi vis(n), qdist(n, -INF);
    priority_queue<ii> pq;
    pq.push({dist[s], s});
    qdist[s] = dist[s];

    while (!pq.empty()) {
      auto [d, u] = pq.top();
      pq.pop();

      if (vis[u])
        continue;
      vis[u] = 1;

      if (u == t) {
        int ans = min(dist[s], dist[t]);
        int curr = u;
        while (curr != -1) {
          ans = min(ans, dist[curr]);
          curr = par[curr];
        }

        cout << ans << "\n";
        break;
      }

      for (auto [v, _] : adj[u])
        if (!vis[v] && qdist[v] < min(d, dist[v])) {
          qdist[v] = min(d, dist[v]);
          pq.push({qdist[v], v});
          par[v] = u;
        }
    }
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

plan.cpp: In function 'int main()':
plan.cpp:183:11: warning: unused variable 'start' [-Wunused-variable]
  183 |   clock_t start = clock();
      |           ^~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 19 / 19
• Subtask 5: 0 / 46