Submission #284500

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
284500	2020-08-27 14:04:42	IOrtroiii	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	738 ms	70900 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 "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<int, int>>> adj(N);
   for (int i = 0; i < M; ++i) {
      adj[R[i][0]].emplace_back(R[i][1], L[i]);
      adj[R[i][1]].emplace_back(R[i][0], L[i]);
   }
   vector<int> cnts(N);
   priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
   for (int i = 0; i < K; ++i) {
      q.emplace(0, P[i]);
      q.emplace(0, P[i]);
   }
   while (!q.empty()) {
      int d, v; tie(d, v) = q.top(); q.pop();
      if (++cnts[v] == 2) {
         if (v == 0) return d;
         for (auto e : adj[v]) {
            q.emplace(d + e.second, e.first);
         }
      }
   }
   assert(false);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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