Submission #262146

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
262146	2020-08-12 12:02:50	nandonathaniel	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	1295 ms	78412 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;
typedef pair<int,int> pii;
typedef pair<long long,int> pli;
const int MAXN=100005;
const long long INF=1e18;
vector<pii> adj[MAXN];
long long dist[MAXN];
priority_queue<pli,vector<pli>,greater<pli> > PQ;
bool keluar[MAXN];
int muncul[MAXN];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  for(int i=0;i<M;i++){
    adj[R[i][0]].push_back({R[i][1],L[i]});
    adj[R[i][1]].push_back({R[i][0],L[i]});
  }
  for(int i=0;i<N;i++)dist[i]=INF;
  for(int i=0;i<K;i++){
    dist[P[i]]=0;
    keluar[P[i]]=true;
    PQ.push({dist[P[i]],P[i]});
  }
  while(!PQ.empty()){
    pii now=PQ.top();
    PQ.pop();
    muncul[now.second]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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