oj.uz

Submission #1105311

# Submission time Handle Problem Language Result Execution time Memory
1105311 2024-10-26T06:27:09 Z Zone_zonee Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 659 ms 101552 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
#define MAX_N 50000
#define MAX_M 10000000

vector<pair<int, long long>> adj[MAX_N];
long long dis[MAX_N];
int vis[MAX_N];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
  for(int i = 0; i < M; ++i){
    adj[R[i][0]].emplace_back(R[i][1], L[i]);
    adj[R[i][1]].emplace_back(R[i][0], L[i]);
  }
  fill(dis, dis+N, 1e18);
  priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
  for(int i = 0; i < K; ++i){
    vis[P[i]] = 1;
    pq.emplace(0LL, P[i]);
  }
  while(!pq.empty()){
    auto [d, u] = pq.top(); pq.pop();
    vis[u]++;
    if(dis[u] != 1e18) continue;
    if(vis[u] == 2){
      dis[u] = d;
      for(auto [v, w] : adj[u]) pq.emplace(d + w, v);
    }
  }
  return dis[0];
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4600 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 2 ms 4432 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 2 ms 4632 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4688 KB Output is correct
12 Correct 6 ms 5588 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 2 ms 4432 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4600 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 2 ms 4432 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 2 ms 4632 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4688 KB Output is correct
12 Correct 6 ms 5588 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 2 ms 4432 KB Output is correct
16 Correct 659 ms 101552 KB Output is correct
17 Runtime error 47 ms 16968 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -