Submission #1074310

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074310		dosts	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	0 ms	348 KiB

crocodile

//Dost SEFEROĞLU
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
#define int long long
#define ii int32_t
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 2e12;
ii travel_plan(ii N, ii M, ii R[][2], ii L[], ii K, ii P[])
{
  vector<pii> edges[N];
  for (int i=0;i<M;i++) {
    edges[R[i][0]].push_back({R[i][1],L[i]});
    edges[R[i][1]].push_back({R[i][0],L[i]});
  }
  pii dist[N];
  for (int i=0;i<N;i++) dist[i] = {inf,inf};
  using state = pair<pii,int>;
  priority_queue<state,vector<state>,greater<state>> pq;
  for (int i=0;i<K;i++) {
    dist[P[i]] = {0,0};
    pq.push({{0,0},P[i]});
  }
  while (!pq.empty()) {
    state f = pq.top();
    pq.pop();
    if (f.ff > dist[f.ss]) continue;
    for (auto it : edges[f.ss]) {
      int go = it.ff,w = it.ss;
      pii pp = {dist[go].ff,w+f.ff.ss};
      if (pp.ff > pp.ss) swap(pp.ff,pp.ss);
      if (dist[go] > pp) {
        dist[go] = pp;
       state pusher = make_pair(pp,go);
        pq.push(pusher);
      } 
    }
  }
  return dist[0].ss;
}

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