oj.uz

Submission #851220

# Submission time Handle Problem Language Result Execution time Memory
851220 2023-09-19T02:04:22 Z NeroZein Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 376 ms 49620 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]].emplace_back(R[i][1], L[i]);
    g[R[i][1]].emplace_back(R[i][0], L[i]);
  }
  const long long INF = 1e9; 
  vector<vector<long long>> dis(N, vector<long long> (2, INF)); 
  priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq; 
  for (int i = 0; i < K; ++i) {
    dis[P[i]][0] = dis[P[i]][1] = 0;
    pq.emplace(0, P[i]);
  }
  while (!pq.empty()) {
    auto [c, v] = pq.top();
    pq.pop();
    if (c != dis[v][1]) {
      continue;
    }
    for (auto [u, w] : g[v]) {
      long long nc = c + w;
      if (nc < dis[u][1]) {
        dis[u][1] = nc; 
        if (dis[u][0] > dis[u][1]) {
          swap(dis[u][0], dis[u][1]); 
        }
        if (dis[u][1] != INF) {
          pq.emplace(dis[u][1], u); 
        }
      }
    }
  }
  return dis[0][1];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 305 ms 41924 KB Output is correct
17 Correct 66 ms 16808 KB Output is correct
18 Correct 71 ms 17864 KB Output is correct
19 Correct 376 ms 49620 KB Output is correct
20 Correct 197 ms 34900 KB Output is correct
21 Correct 27 ms 9040 KB Output is correct
22 Incorrect 234 ms 33444 KB Output isn't correct
23 Halted 0 ms 0 KB -