Submission #1241005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241005		guanex	Crocodile's Underground City (IOI11_crocodile)	C++20	100 / 100	314 ms	77316 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>

using namespace std;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  vector<vector<pair<long long, long long>>> ed(N);
  for(long long i = 0; i < M; ++i){
    ed[R[i][0]].push_back({R[i][1], L[i]});
    ed[R[i][1]].push_back({R[i][0], L[i]});
  }
  priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, greater<pair<long long, long long>>> pq;
  vector<pair<long long, long long>> paths(N, make_pair(1e18, 1e18));
  for(int i = 0; i < K; ++i){
    paths[P[i]] = {0, 0};
    pq.push({0, P[i]});
  }
  int vis[N];
  memset(vis, 0, sizeof vis);
  while(!pq.empty()){
    long long no = pq.top().second;
    long long dis = pq.top().first;
    pq.pop();
    if(paths[no].second < dis){
      continue;
    }
    if(vis[no] == 1)continue;
    vis[no] = 1;
    //cout << no << " " << dis << endl;
    for(auto e:ed[no]){
      if(dis + e.second < paths[e.first].first){
        paths[e.first].second = paths[e.first].first;
        paths[e.first].first = dis + e.second;
        pq.push({paths[e.first].second, e.first});
      }else if(dis + e.second < paths[e.first].second){
        paths[e.first].second = dis + e.second;
        pq.push({paths[e.first].second, e.first});
      }
    }
  }
  return paths[0].second;
}

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