Submission #569367

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
569367	2022-05-27 10:53:14	codebuster_10	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	629 ms	61076 KiB

crocodile

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std ;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
  const int inf = 2e9;
  vector<pair<int,int>> dis(N,{inf,inf});
  vector<vector<pair<int,int>>> g(N);
  for(int e = 0; e < M; ++e){
    int u = R[e][0], v = R[e][1], w = L[e];
    g[u].emplace_back(v,w);
    g[v].emplace_back(u,w);
  }
  priority_queue<pair<int,int>> pq;
  for(int i = 0; i < K; ++i){
    int u = P[i];
    dis[u] = {0,0};
    pq.push({-dis[u].second,u});
  }
  while(!pq.empty()){
    auto [d,i] = pq.top(); pq.pop();
    if(-d != dis[i].second)
      continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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