Submission #976626

#	Time	Username	Problem	Language	Result	Execution time	Memory
976626		rakhim_ova	Cyberland (APIO23_cyberland)	C++17	20 / 100	26 ms	6748 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll INF=1e13;

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) {
    int n=N, m=M, k=K, h=H;
    if(n<=3){
        if(h==0) return 0;
        vector<vector<double>> ct(n, vector<double> (n, -1));
        for(int i=0; i<m; i++){
            ct[x[i]][y[i]]=c[i];
            ct[y[i]][x[i]]=c[i];
        }
        double res=-1;
        if(ct[0][h]>=0){
            res=ct[0][h];
        }
        if(n<3) return res;
        if(ct[0][3-h]>=0 && ct[3-h][h]>=0){
            if(arr[3-h]==1){
                if(res<-0.5){
                    res=ct[0][3-h]+ct[3-h][h];
                }
                else{
                    res=min(res, ct[0][3-h]+ct[3-h][h]);
                }
            }
            else if(arr[3-h]==0){
                if(res<-0.5){
                    res=ct[3-h][h];
                }
                else{
                    res=min(res, ct[3-h][h]);
                }
            }
            else{
                if(k>0){
                    if(res<-0.5){
                        res=(double)ct[0][3-h]/2+ct[3-h][h];
                    }
                    else{
                        res=min(res, (double)ct[0][3-h]/2+ct[3-h][h]);
                    }
                }
                else{
                    if(res<-0.5){
                        res=ct[0][3-h]+ct[3-h][h];
                    }
                    else{
                        res=min(res, ct[0][3-h]+ct[3-h][h]);
                    }
                }

            }
        }
        return res;
    }
    double res=-1;
    vector<vector<pair<int, double>>> adj(n);
    for(int i=0; i<m; i++){
        adj[x[i]].push_back({y[i], c[i]});
        adj[y[i]].push_back({x[i], c[i]});
    }
    vector<double> d(n, INF);
    vector<bool> ch(n, false);
    priority_queue<pair<double, int>> pq;

    d[0]=0;
    pq.push({0, 0});
    while(!pq.empty()){
        int t=pq.top().second; pq.pop();
        if(ch[t]) continue;
        ch[t]=true;
        for(auto x: adj[t]){
            if(d[t]+x.second<d[x.first]){
                // cout << t << ' ' << x.first << ' ' << d[t]+x.second << '\n';
                pq.push({-(d[t]+x.second), x.first});
                d[x.first]=d[t]+x.second;
            }
        }
    }
    if(d[h]==INF){
        return -1;
    }
    // for(auto x: d) cout << x << ' ';
    // cout << '\n';
    return d[h];
}

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:63:12: warning: unused variable 'res' [-Wunused-variable]
   63 |     double res=-1;
      |            ^~~

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