oj.uz

Submission #433277

# Submission time Handle Problem Language Result Execution time Memory
433277 2021-06-19T12:15:34 Z MilosMilutinovic Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 1 ms 332 KB 
#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 int inf = INT_MAX;
  vector<int> dist(n, inf);
  set<pair<int, 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
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -