oj.uz

Submission #778787

# Submission time Handle Problem Language Result Execution time Memory
778787 2023-07-10T16:48:46 Z MilosMilutinovic Cyberland (APIO23_cyberland) C++17
68 / 100
 3000 ms 36380 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

const double eps = 1e-7;

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, 66);
  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) {
        was[j] = true;
      }
      if (!was[j]) {
        was[j] = true;
        que.push_back(j);
      }
    }
  }
  if (!was[h]) {
    return -1;
  }
  const double inf = 1e15;
  k += 1;
  que.push_back(h);
  for (int i : que) {
    for (int j = 0; j < k; j++) {
      dist[i * k + j] = inf;
      lst[i * k + j] = inf;
    }
  }
  priority_queue<tuple<int, double, int>> pq;
  for (int j : que) {
    if (j == 0 || a[j] == 0) {
      dist[j * k] = 0;
      pq.push({0, dist[j * k], j * k});
    }
  }
  double ans = inf;
  while (!pq.empty()) {
    auto it = pq.top();
    int v = get<2>(it);
    pq.pop();
    int i = v / k;
    int j = v % k;
    if (i == h) {
      ans = min(ans, dist[v]);
      if (ans <= eps) {
        return ans;
      }
      continue;
    }
    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 (to == 0 || 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({j, -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({j + 1, -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
*/

Compilation message

cyberland.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("O3")
      | 
cyberland.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2772 KB Correct.
2 Correct 15 ms 2772 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3292 KB Correct.
2 Correct 22 ms 3284 KB Correct.
3 Correct 21 ms 3248 KB Correct.
4 Correct 22 ms 3292 KB Correct.
5 Correct 27 ms 3328 KB Correct.
6 Correct 22 ms 8140 KB Correct.
7 Correct 31 ms 8148 KB Correct.
8 Correct 21 ms 13768 KB Correct.
9 Correct 20 ms 2784 KB Correct.
10 Correct 20 ms 2788 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3272 KB Correct.
2 Correct 23 ms 3284 KB Correct.
3 Correct 22 ms 3240 KB Correct.
4 Correct 23 ms 2644 KB Correct.
5 Correct 22 ms 2776 KB Correct.
6 Correct 8 ms 7352 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 13492 KB Correct.
2 Correct 363 ms 3248 KB Correct.
3 Correct 311 ms 3200 KB Correct.
4 Correct 329 ms 3100 KB Correct.
5 Correct 261 ms 2768 KB Correct.

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3284 KB Correct.
2 Correct 21 ms 3280 KB Correct.
3 Correct 19 ms 3256 KB Correct.
4 Correct 26 ms 8200 KB Correct.
5 Correct 17 ms 2772 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3356 KB Correct.
2 Correct 17 ms 3284 KB Correct.
3 Correct 31 ms 7756 KB Correct.
4 Correct 15 ms 6276 KB Correct.
5 Correct 19 ms 2760 KB Correct.
6 Correct 19 ms 3284 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2832 ms 3296 KB Correct.
2 Correct 530 ms 3284 KB Correct.
3 Execution timed out 3078 ms 36380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3079 ms 3632 KB Time limit exceeded
2 Halted 0 ms 0 KB -