Submission #763726

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
763726	2023-06-22 17:37:57	gun_gan	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	786 ms	92632 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;
typedef long long ll;
const ll MX = 1e5 + 5, inf = 1e18;
ll dist[MX][2];
int N, M, K;
vector<pair<int, int>> g[MX];
int travel_plan(int _N, int _M, int r[][2], int l[], int _K, int p[]) {
      N = _N, M = _M, K = _K;
      for(int i = 0; i < MX; i++) {
            dist[i][0] = dist[i][1] = inf;
      }
      for(int i = 0; i < M; i++) {
            g[r[i][0]].push_back({r[i][1], l[i]});
            g[r[i][1]].push_back({r[i][0], l[i]});
      }
      priority_queue<pair<ll,ll>> pq;
      for(int i = 0; i < K; i++) {
            dist[p[i]][0] = dist[p[i]][1] = 0;
            for(auto [u, w] : g[p[i]]) {
                  pq.push({-w, u});
            }
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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