Submission #433310

#	Time	Username	Problem	Language	Result	Execution time	Memory
433310		MilosMilutinovic	Crocodile's Underground City (IOI11_crocodile)	C++14	46 / 100	10 ms	1996 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) {
  vector<vector<pair<int, int>>> g(n);
  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]});
  }
  const long long inf = 1e18;
  vector<long long> dist(n, inf);
  multiset<pair<long long, int>> que;
  for (int i = 0; i < k; i++) {
    for (auto& e : g[p[i]]) {
      que.insert({e.second, e.first});
    }
    dist[p[i]] = 0;
  }
  vector<int> cnt(n);
  vector<bool> was(n, false);
  while (!que.empty()) {
    auto x = *que.begin();
    que.erase(que.begin());
    if (was[x.second]) {
      continue;
    }
    cnt[x.second]++;
    if (cnt[x.second] == 2) {
      was[x.second] = true;
      dist[x.second] = x.first;
      for (auto y : g[x.second]) {
        que.insert({y.second + x.first, y.first});
      }
    }
  }
  return dist[0];
}

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