Submission #1361724

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361724		hihi0908	Cyberland (APIO23_cyberland)	C++17	97 / 100	3091 ms	172752 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
#define pb push_back

struct hi{
    long double val;
    int k;
    int u;
};

struct cmp{
    bool operator()(hi a, hi b){
        return a.val > b.val;
    }
};

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<pll>> G(1e5 + 1);

    for(int i = 0; i < M; i++){
        G[x[i]].pb({y[i], c[i]});
        G[y[i]].pb({x[i], c[i]});
    }

    K = min(K, 100);

    priority_queue<hi, vector<hi>, cmp> pq;

    vector<vector<long double>> dist(N, vector<long double>(K + 1, 1e18));
    pq.push((hi){0, 0, 0});
    dist[0][0] = 0;
    while(!pq.empty()){
        auto [val, k, u] = pq.top();
        pq.pop();

        // cout << "HI " << val << ' ' << k << ' ' << u << '\n';
        if(dist[u][k] < val)   continue;
        if(u == H)  continue;

        for(auto &[v, w] : G[u]){            
            if(arr[v] == 0 && dist[v][k] > 0.000){
                dist[v][k] = 0.0000;
                pq.push((hi){dist[v][k], k, v});
            }else if(arr[v] == 2 && k + 1 <= K){
                if(dist[v][k + 1] > (val + w) / 2.0000){
                    dist[v][k + 1] = (val + w) / 2.0000;
                    pq.push((hi){dist[v][k + 1], k + 1, v});
                }
            }

            if(dist[v][k] > val + w){
                dist[v][k] = val + w;
                pq.push((hi){dist[v][k], k, v});
            }
        }
    }
    long double d = *min_element(dist[H].begin(), dist[H].end());
    // cout << dist[H][1] << ' ' << d << '\n';
    if(d > 1e17)    return -1;
    
    return d;
}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:45:45: warning: narrowing conversion of 'v' from 'std::tuple_element<0, std::pair<long long int, long long int> >::type' {aka 'long long int'} to 'int' [-Wnarrowing]
   45 |                 pq.push((hi){dist[v][k], k, v});
      |                                             ^
cyberland.cpp:49:57: warning: narrowing conversion of 'v' from 'std::tuple_element<0, std::pair<long long int, long long int> >::type' {aka 'long long int'} to 'int' [-Wnarrowing]
   49 |                     pq.push((hi){dist[v][k + 1], k + 1, v});
      |                                                         ^
cyberland.cpp:55:45: warning: narrowing conversion of 'v' from 'std::tuple_element<0, std::pair<long long int, long long int> >::type' {aka 'long long int'} to 'int' [-Wnarrowing]
   55 |                 pq.push((hi){dist[v][k], k, v});
      |                                             ^

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 19 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 29 / 29
• Subtask 8: 0 / 3