Submission #1161390

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1161390	2025-03-04 08:33:22	Newtonabc	Crocodile's Underground City (IOI11_crocodile)	C++20	100 / 100	334 ms	77164 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>
#define ll long long
using namespace std;
const int NN=1e5+10;
vector<pair<ll,int>> adj[NN];
ll d[NN][2];
bool vs[NN];
priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> q;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  for(int i=0;i<M;i++){
    int u=R[i][0],v=R[i][1];
    adj[u].push_back({v,L[i]});
    adj[v].push_back({u,L[i]});
  }
  for(int i=0;i<N;i++) d[i][0]=d[i][1]=LLONG_MAX;
  for(int i=0;i<K;i++) d[P[i]][0]=d[P[i]][1]=0,q.push({0,P[i]});
  while(!q.empty()){
    int u=q.top().second;
    q.pop();
    if(vs[u]) continue;
    vs[u]=true;
    for(auto [v,w]:adj[u]){
      if(d[u][1]+w<d[v][0]){
        d[v][1]=d[v][0];
        q.push({d[v][1],v});
        d[v][0]=d[u][1]+w;
      }
      else if(d[u][1]+w<d[v][1]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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