Submission #1120521

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120521		dosts	Crocodile's Underground City (IOI11_crocodile)	C++17	89 / 100	406 ms	77052 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  #define int long long
  const int inf = 2e18;
  vector<pii> edges[N];
  for (int i=0;i<M;i++) {
    edges[R[i][0]].push_back({R[i][1],L[i]});
    edges[R[i][1]].push_back({R[i][0],L[i]});
  }
  vector<pii> dist(N,pii{inf,inf});
  priority_queue<pii,vector<pii>,greater<pii>> pq;
  for (int i = 0;i<K;i++) {
    dist[P[i]] = {0,0};
    pq.push({0,P[i]});
  }

  while (!pq.empty()) {
    pii f = pq.top();
    pq.pop();
    if (dist[f.ss].ss < f.ff) continue;
    if (f.ff == inf) continue;
    for (auto it : edges[f.ss]) {
      if (f.ff+it.ss < dist[it.ff].ff) {
        swap(dist[it.ff].ff,dist[it.ff].ss);
        dist[it.ff].ff = f.ff+it.ss;
        pq.push({dist[it.ff].ss,it.ff});
      }
      else if (f.ff+it.ss < dist[it.ff].ss) {
        dist[it.ff].ss = f.ff+it.ss;
        pq.push({dist[it.ff].ss,it.ff});
      }
    }
  }
  if (dist[0].ss >= inf) return -1;
  return dist[0].ss;
}

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 0 / 11