oj.uz

Submission #952197

# Submission time Handle Problem Language Result Execution time Memory
952197 2024-03-23T09:26:22 Z emad234 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 396 ms 92584 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 1e6 + 5;
using namespace std;
vector<vector<pii>> v;
ll dist[mxN], mn[mxN];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  v.clear();
  memset(dist, 0, sizeof dist);
  memset(mn, -1, sizeof mn);
  v.resize(N + 3);
  for (ll i = 0; i < N; i++)
  {
    dist[i] = 2e9 + 5;
  }
  for (ll i = 0; i < M; i++)
  {
    v[R[i][1]].push_back({R[i][0], L[i]});
    v[R[i][0]].push_back({R[i][1], L[i]});
  }
  priority_queue<pii, vector<pii>, greater<pii>> q;
  for (ll i = 0; i < K; i++)
  {
    dist[P[i]] = 0;
    q.push({0, P[i]});
  }
  while (q.size())
  {
    auto u = q.top();
    q.pop();
    if (dist[u.S] < u.F)
      continue;
    for (auto x : v[u.S])
    {
      if (dist[x.F] > x.S + u.F && mn[x.F] == -1)
      {
        mn[x.F] = x.S + u.F;
      }
      else if (dist[x.F] > x.S + u.F && mn[x.F] != -1)
      {
        ll Mn = mn[x.F];
        mn[x.F] = min(x.S + u.F, Mn);
        dist[x.F] = max(x.S + u.F, Mn);
        q.push({dist[x.F], x.F});
      }
    }
  }
  return dist[0];
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19036 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19032 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 4 ms 19292 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 3 ms 19036 KB Output is correct
12 Correct 6 ms 19548 KB Output is correct
13 Correct 6 ms 19548 KB Output is correct
14 Correct 3 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 310 ms 84008 KB Output is correct
17 Correct 54 ms 33104 KB Output is correct
18 Correct 70 ms 35428 KB Output is correct
19 Correct 396 ms 92584 KB Output is correct
20 Correct 226 ms 71760 KB Output is correct
21 Correct 30 ms 25940 KB Output is correct
22 Incorrect 238 ms 68148 KB Output isn't correct
23 Halted 0 ms 0 KB -