Submission #979461

#	Time	Username	Problem	Language	Result	Execution time	Memory
979461		HappyCapybara	Cyberland (APIO23_cyberland)	C++17	15 / 100	27 ms	6748 KiB

cyberland

#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
    vector<vector<pair<int,int>>> g(N);
    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]});
    }
    vector<bool> seen(N, false);
    priority_queue<pair<double,int>> pq;
    pq.push({(double) 0, 0});
    while (!pq.empty()){
        double d = -pq.top().first;
        int cur = pq.top().second;
        pq.pop();
        if (cur == H) return d;
        if (seen[cur]) continue;
        seen[cur] = true;
        for (pair<int,int> next : g[cur]) pq.push({-(d+next.second), next.first});
    }
    return -1;
}

• Subtask 1: 0 / 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