oj.uz

Submission #794095

# Submission time Handle Problem Language Result Execution time Memory
794095 2023-07-26T09:17:42 Z 12345678 Cyberland (APIO23_cyberland) C++17
15 / 100
 1681 ms 32912 KB 
#include "cyberland.h"

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, kx=31;

priority_queue<pair<double, pair<int, double>>, vector<pair<double, pair<int, double>>>, greater<pair<double, pair<int, double>>>> pq;
double dp[nx][kx], ans=DBL_MAX;

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> arr) {
    vector<vector<pair<int, int>>> d(nx);
    for (int i=0; i<M; i++) d[x[i]].push_back({y[i], c[i]}), d[y[i]].push_back({x[i], c[i]});
    for (int i=0; i<N; i++) if (arr[i]==0) pq.push({0, {0, i}});
    for (int i=0; i<N; i++)
    {
        if (arr[i]!=0) for (int j=0; j<kx; j++) dp[i][j]=DBL_MAX;
        else for (int j=0; j<kx; j++) dp[i][j]=0;
    }
    dp[0][0]=0;
    pq.push({0, {0, 0}});
    while (!pq.empty())
    {
        auto cw=pq.top().first, cl=pq.top().second.second;
        auto ck=pq.top().second.first;
        pq.pop();
        //cout<<cw<<' '<<ck<<' '<<cl<<'\n';
        if (cl==H) continue;
        for (auto [v, w]:d[cl])
        {
            if (dp[v][ck]>cw+w) pq.push({cw+w, {ck, v}}), dp[v][ck]=cw+w;
            if (arr[v]==2&&ck!=K) if (dp[v][ck+1]>(cw+w)/2) pq.push({(cw+w)/2, {ck+1, v}}), dp[v][ck+1]=(cw+w)/2; 
        }
    }
    ans=DBL_MAX;
    for (int i=0; i<=K; i++) ans=min(ans, dp[H][i]);
    if (ans==DBL_MAX) return -1;
    return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 5292 KB Correct.
2 Correct 55 ms 6140 KB Correct.
3 Correct 54 ms 6172 KB Correct.
4 Correct 56 ms 6168 KB Correct.
5 Correct 56 ms 6164 KB Correct.
6 Correct 25 ms 6444 KB Correct.
7 Correct 33 ms 8748 KB Correct.
8 Correct 14 ms 9172 KB Correct.
9 Correct 203 ms 5292 KB Correct.
10 Correct 206 ms 5364 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 5276 KB Correct.
2 Correct 44 ms 6168 KB Correct.
3 Correct 47 ms 6124 KB Correct.
4 Correct 26 ms 6568 KB Correct.
5 Correct 221 ms 5756 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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