oj.uz

답안 #1114319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114319 2024-11-18T14:13:32 Z adaawf 사이버랜드 (APIO23_cyberland) C++17
44 / 100
 3000 ms 43320 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <iomanip>
using namespace std;
vector<pair<int, int>> g[100005];
double f[100005][35], d[100005][35];
int dd[100005];
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
    vector<int> v;
    for (int i = 0; i < n; i++) g[i].clear();
    for (int i = 0; i < n; i++) {
        dd[i] = 0;
        for (int j = 0; j <= k; j++) {
            f[i][j] = 1e18;
        }
    }
    for (int i = 0; i < m; i++) {
        g[x[i]].push_back({y[i], c[i]});
        g[y[i]].push_back({x[i], c[i]});
    }
    queue<int> q;
    q.push(0);
    dd[0] = 1;
    while (!q.empty()) {
        int p = q.front();
        q.pop();
        if (p == h) continue;
        if (a[p] == 0) v.push_back(p);
        for (auto w : g[p]) {
            if (dd[w.first] == 0) {
                dd[w.first] = 1;
                q.push(w.first);
            }
        }
    }
    if (dd[h] == 0) return -1;
    for (int w : v) f[w][0] = 0;
    f[0][0] = 0;
    for (int i = 0; i <= k; i++) {
        priority_queue<pair<double, int>> q;
        if (i != 0) {
            for (int j = 0; j < n; j++) {
                for (auto w : g[j]) {
                    if (w.first == h || j == h) continue;
                    f[j][i] = min(d[w.first][i] + w.second, f[j][i]);
                }
                //cout << j << " " << i << " " << f[j][i] << " " << d[2][1] << '\n';
            }
        }
        for (int j = 0; j < n; j++) {
            if (j != h) {
                q.push({-f[j][i], j});
            }
        }
        while (!q.empty()) {
            double x = -q.top().first;
            int u = q.top().second;
            q.pop();
            if (f[u][i] != x || u == h) continue;
            //cout << u << " " << i << " " << x << " " << f[h][i] << " 328762836" << '\n';
            for (auto w : g[u]) {
                if (f[w.first][i] > f[u][i] + w.second) {
                    f[w.first][i] = f[u][i] + w.second;
                    q.push({-f[w.first][i], w.first});
                }
            }
        }
        if (i == k) break;
        for (int j = 0; j < n; j++) {
            if (a[j] <= 1) d[j][i + 1] = f[j][i];
            else if (a[j] == 2) d[j][i + 1] = f[j][i] / 2;
        }
    }
    double res = 1e18;
    for (int j = 0; j <= k; j++) {
        res = min(res, f[h][j]);
    }
    if (res > 1e17) return -1;
    return res;
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 8692 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 8776 KB Correct.
2 Correct 186 ms 8776 KB Correct.
3 Correct 182 ms 8680 KB Correct.
4 Correct 186 ms 8528 KB Correct.
5 Correct 187 ms 8776 KB Correct.
6 Correct 226 ms 13832 KB Correct.
7 Correct 289 ms 13796 KB Correct.
8 Correct 133 ms 21056 KB Correct.
9 Correct 109 ms 8612 KB Correct.
10 Correct 111 ms 8528 KB Correct.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 8528 KB Correct.
2 Correct 181 ms 8688 KB Correct.
3 Correct 175 ms 8544 KB Correct.
4 Correct 139 ms 8572 KB Correct.
5 Correct 119 ms 8860 KB Correct.
6 Correct 50 ms 13536 KB Correct.

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 715 ms 43320 KB Correct.
2 Incorrect 230 ms 8528 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 8788 KB Correct.
2 Correct 85 ms 8796 KB Correct.
3 Correct 92 ms 8776 KB Correct.
4 Correct 147 ms 13752 KB Correct.
5 Correct 52 ms 8528 KB Correct.

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 8712 KB Correct.
2 Correct 73 ms 8776 KB Correct.
3 Correct 46 ms 33352 KB Correct.
4 Correct 74 ms 11552 KB Correct.
5 Correct 60 ms 8528 KB Correct.
6 Correct 83 ms 8776 KB Correct.

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 109 ms 8528 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3061 ms 14708 KB Time limit exceeded
2 Halted 0 ms 0 KB -