oj.uz

Submission #952214

# Submission time Handle Problem Language Result Execution time Memory
952214 2024-03-23T09:52:12 Z emad234 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 408 ms 100472 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] = 1e18 + 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 4 ms 19188 KB Output is correct
2 Correct 3 ms 18880 KB Output is correct
3 Correct 3 ms 18892 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19188 KB Output is correct
2 Correct 3 ms 18880 KB Output is correct
3 Correct 3 ms 18892 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 5 ms 19292 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 7 ms 19804 KB Output is correct
14 Correct 3 ms 19292 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 4 ms 19188 KB Output is correct
2 Correct 3 ms 18880 KB Output is correct
3 Correct 3 ms 18892 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 5 ms 19292 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 7 ms 19804 KB Output is correct
14 Correct 3 ms 19292 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 324 ms 92332 KB Output is correct
17 Correct 58 ms 35028 KB Output is correct
18 Correct 75 ms 37424 KB Output is correct
19 Correct 408 ms 100472 KB Output is correct
20 Correct 232 ms 78424 KB Output is correct
21 Correct 30 ms 26856 KB Output is correct
22 Incorrect 244 ms 75724 KB Output isn't correct
23 Halted 0 ms 0 KB -