Submission #123624

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
123624	2019-07-01 19:18:33	deinfreund	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	1053 ms	71908 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;
 
vector<vector<int>> conns;
vector<vector<int>> costs;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  conns.resize(N);
  costs.resize(N);
  for (int i = 0; i < M; i++){
    int a = R[i][0];
    int b = R[i][1];
    conns[a].push_back(b);
    conns[b].push_back(a);
    costs[a].push_back(L[i]);
    costs[b].push_back(L[i]);
  }
  const long long big = 1000000000;//100000000000000000LL;
  vector<long long> firstCost(N, big);
  vector<long long> secondCost(N, big);
  priority_queue<pair<long long, int>> pq;
  for (int i = 0; i < K; i++){
    pq.push({0, P[i]});
  }
  vector<bool> visited(N, 0);
  while (!pq.empty()){
    int pos;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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