oj.uz

Submission #778773

# Submission time Handle Problem Language Result Execution time Memory
778773 2023-07-10T16:33:11 Z MilosMilutinovic Cyberland (APIO23_cyberland) C++17
49 / 100
 347 ms 115792 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

const double eps = 1e-8;

const int MAX = 100005;
vector<pair<int, int>> g[MAX];
double dist[MAX * 68];
double lst[MAX * 68];

double solve(int n, int m, int k, int h, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> a) {
  k = min(k, 67);
  for (int i = 0; i < n; i++) {
    g[i].clear();
  }
  for (int i = 0; i < m; i++) {
    g[x[i]].emplace_back(y[i], c[i]);
    g[y[i]].emplace_back(x[i], c[i]);
  }
  vector<int> que(1, 0);
  vector<bool> was(n, false);
  was[0] = true;
  for (int b = 0; b < (int) que.size(); b++) {
    int i = que[b];
    for (auto& p : g[i]) {
      int j = p.first;
      if (j == h) {
        continue;
      }
      if (!was[j]) {
        was[j] = true;
        que.push_back(j);
      }
    }
  }
  const double inf = 1e15;
  k += 1;
  for (int i = 0; i < n * k; i++) {
    dist[i] = inf;
    lst[i] = inf;
  }
  priority_queue<pair<double, int>> pq;
  for (int j : que) {
    if (j == 0 || a[j] == 0) {
      for (int x = 0; x < k; x++) {
        dist[j * k + x] = 0;
      }
      pq.push({dist[j * k + 0], j * k});
    }
  }
  double ans = inf;
  while (!pq.empty()) {
    auto it = pq.top();
    int v = it.second;
    pq.pop();
    int i = v / k;
    int j = v % k;
    if (i == h) {
      ans = dist[v];
      break;
    }
    if (lst[v] <= dist[v] + eps) {
      continue;
    }
    lst[v] = dist[v];
    for (auto& p : g[i]) {
      int to = p.first;
      int w = p.second;
      if (a[to] == 0) {
        continue;
      }
      if (dist[to * k + j] > dist[v] + w + eps) {
        int nto = to * k + j;
        dist[nto] = dist[v] + w;
        pq.push({-dist[nto], nto});
      }
      if (a[to] == 2) {
        if (j + 1 < k && dist[to * k + j + 1] > (dist[v] + w) / 2.000000 + eps) {
          int nto = to * k + j + 1;
          dist[nto] = (dist[v] + w) / 2.000000;
          pq.push({-dist[nto], nto});
        }
      }
    }
  }
  if (ans == inf) {
    ans = -1;
  }
  return ans;
}

/*
1
3 2 30
2
1 2 1
1 2 12
2 0 4

4.00000000000

1
4 4 30
3
1 0 2 1
0 1 5
0 2 4
1 3 2
2 3 4

2.00000000000
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2828 KB Correct.
2 Correct 15 ms 2820 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3272 KB Correct.
2 Correct 20 ms 3348 KB Correct.
3 Correct 19 ms 3304 KB Correct.
4 Correct 20 ms 3284 KB Correct.
5 Correct 20 ms 3284 KB Correct.
6 Correct 18 ms 8200 KB Correct.
7 Correct 25 ms 8020 KB Correct.
8 Correct 16 ms 13720 KB Correct.
9 Correct 19 ms 2772 KB Correct.
10 Correct 21 ms 2776 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3284 KB Correct.
2 Correct 22 ms 3292 KB Correct.
3 Correct 22 ms 3324 KB Correct.
4 Correct 22 ms 2776 KB Correct.
5 Correct 22 ms 2748 KB Correct.
6 Correct 6 ms 7252 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 36800 KB Correct.
2 Incorrect 109 ms 3400 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3340 KB Correct.
2 Correct 25 ms 3292 KB Correct.
3 Correct 24 ms 3400 KB Correct.
4 Correct 21 ms 8196 KB Correct.
5 Correct 17 ms 2772 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3328 KB Correct.
2 Correct 17 ms 3288 KB Correct.
3 Correct 46 ms 44428 KB Correct.
4 Correct 14 ms 6740 KB Correct.
5 Correct 20 ms 2788 KB Correct.
6 Correct 21 ms 3284 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 3812 KB Correct.
2 Correct 14 ms 4412 KB Correct.
3 Incorrect 51 ms 36516 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 5884 KB Correct.
2 Correct 40 ms 6860 KB Correct.
3 Correct 92 ms 115792 KB Correct.
4 Incorrect 99 ms 7708 KB Wrong Answer.
5 Halted 0 ms 0 KB -