Submission #1240972

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240972		guanex	악어의 지하 도시 (IOI11_crocodile)	C++20	0 / 100	1 ms	580 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(1e15, 1e15));
  long long dist[N];
  for(long long i = 0; i < N; ++i){
    dist[i] = 1e15;
  }
  for(int i = 0; i < K; ++i){
    dist[P[i]] = 0;
    pq.push({0, P[i]});
  }
  while(!pq.empty()){
    long long no = pq.top().second;
    long long dis = pq.top().first;
    pq.pop();
    if(dist[no] < dis){
      continue;
    }
    //cout << no << " " << dis << endl;
    dist[no] = dis;
    for(auto e:ed[no]){
      if(dist[e.first] != 1e15){
        continue;
      }
      if(dis + e.second > paths[e.first].second){
        continue;
      }
      paths[e.first].second = min(paths[e.first].second, dis + e.second);
      if(paths[e.first].first > paths[e.first].second){
        swap(paths[e.first].first, paths[e.first].second);
      }
      if(paths[e.first].second != -1){
        pq.push({paths[e.first].second, e.first});
      }
    }
  }
  return dist[0];
}

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