Submission #1178982

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178982		Muhammet	Cyberland (APIO23_cyberland)	C++17	0 / 100	1418 ms	2162688 KiB

cyberland

#include "bits/stdc++.h"
#include "cyberland.h"
// #include "stub.cpp"

using namespace std;

#define ff first
#define ss second

vector <vector <pair <int, int>>> v; 

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
    double ans = -1;
    v.clear();
    v.resize(n+1);
    for(int i = 0; i < m; i++) {
        v[x[i]].push_back({y[i], c[i]});
        v[y[i]].push_back({x[i], c[i]});
    }
    vector <vector <double>> dis(n+1, vector <double> (k+1, -1));
    priority_queue <pair <double, pair <int, int>>> q;
    dis[0][0] = 0;
    q.push({0, {0, 0}});
    while(!q.empty()) {
        double ds = q.top().ff;
        int i = q.top().ss.ff, cn = q.top().ss.ss;
        ds *= (-1);
        q.pop();
        if(dis[i][cn] != ds) continue;
        for(auto [j, w] : v[i]) {
            double dss = ds + w;
            if(dis[j][cn] > dss or dis[j][cn] == -1) {
                dis[j][cn] = dss;
                q.push({-dss, {j, cn}});
            }
            if(a[j] == 0 and dis[j][cn] != 0) {
                dis[j][cn] = 0;
                q.push({0, {j, cn}});
            }
            if(a[j] == 2 and cn < k) {
                dss /= 2;
                if(dis[j][cn+1] > dss or dis[j][cn+1] == -1) {
                    dis[j][cn+1] = dss;
                    q.push({-dss, {j, cn+1}});
                }
            }
        }
    }
    for(int i = 0; i <= k; i++) {
        if(ans == -1 and dis[h][i] != -1) ans = dis[h][i];
        ans = min(ans, dis[h][i]);
    }
    return ans;
}

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