oj.uz

Submission #851218

# Submission time Handle Problem Language Result Execution time Memory
851218 2023-09-19T02:02:14 Z NeroZein Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 399 ms 54164 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 = 1e15; 
  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 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4700 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 4700 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 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4700 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 4700 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 4548 KB Output is correct
11 Correct 1 ms 4548 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4956 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 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4700 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 4700 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 4548 KB Output is correct
11 Correct 1 ms 4548 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4956 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 308 ms 54164 KB Output is correct
17 Correct 56 ms 16980 KB Output is correct
18 Correct 72 ms 17748 KB Output is correct
19 Correct 399 ms 50704 KB Output is correct
20 Correct 204 ms 34996 KB Output is correct
21 Correct 28 ms 9052 KB Output is correct
22 Incorrect 221 ms 33360 KB Output isn't correct
23 Halted 0 ms 0 KB -