oj.uz

Submission #983342

# Submission time Handle Problem Language Result Execution time Memory
983342 2024-05-15T10:34:44 Z vjudge1 Cyberland (APIO23_cyberland) C++17
21 / 100
 1192 ms 2097152 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
#define mk make_pair
#define pb push_back
#define vi vector <int>
#define vd vector <double>
#define paii pair<int, int>
using namespace std;
using tp = tuple<double, int, int>;
const double eps = 1e-9;
const double inf = 1e14;
double solve(int n, int m, int k, int h, vi x, vi y, vi c, vi a) {
  vector<vd> d(n, vd(k + 1, inf));
  vector<vector<paii>> g(n);
  for (int i = 0; i < m; i++) {
    g[x[i]].pb(mk(y[i], c[i]));
    g[y[i]].pb(mk(x[i], c[i]));
  }
  d[0][0] = 0;
  priority_queue<tp, vector<tp>, greater<tp>> pq;
  pq.push({0, 0, 0});
  while (!pq.empty()) {
    auto [exp, who, used] = pq.top();
    pq.pop();
    if (d[who][used] - exp < -eps) {
      continue;
    }
    if (who == h) {
      continue;
    }
    for (auto [to, w] : g[who]) {
      if (a[to] == 1) {
        if (d[to][used] > exp + w) {
          d[to][used] = exp + w;
          pq.push({d[to][used], to, used});
        }
      } else if (a[to] == w) {
        if (used < k - 1 && d[to][used + 1] > ((exp + (double) w) / 2)) {
          d[to][used + 1] = (exp + (double) w) / 2;
          pq.push({d[to][used + 1], to, used + 1});
        }
        if (d[to][used] > exp + w) {
          d[to][used] = exp + w;
          pq.push({d[to][used], to, used});
        }
      } else {
        if (d[to][used] > 0) {
          d[to][used] = 0;
          pq.push({0, to, used});
        }
      }
    }
  }
  double cur = d[h][0];
  for (int i = 0; i <= k; i++) {
    if (cur > d[h][i]) {
      cur = d[h][i];
    }
  }
  return cur;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 600 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 856 KB Correct.
2 Correct 24 ms 848 KB Correct.
3 Correct 22 ms 1084 KB Correct.
4 Correct 24 ms 604 KB Correct.
5 Correct 24 ms 860 KB Correct.
6 Correct 21 ms 4000 KB Correct.
7 Correct 27 ms 3996 KB Correct.
8 Correct 13 ms 7528 KB Correct.
9 Correct 23 ms 556 KB Correct.
10 Correct 22 ms 344 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 604 KB Correct.
2 Correct 27 ms 1508 KB Correct.
3 Correct 24 ms 860 KB Correct.
4 Correct 25 ms 1116 KB Correct.
5 Correct 25 ms 1116 KB Correct.
6 Correct 6 ms 3572 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 21336 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 836 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 856 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 876 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 1192 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -