Submission #1080446

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080446		Muhammet	Cyberland (APIO23_cyberland)	C++17	0 / 100	22 ms	7000 KiB

cyberland

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

using namespace std;

#define ff first
#define ss second

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
    vector <pair<int,int>> v[n+5];

    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]});
    }
    priority_queue <pair<int,int>> q;
    q.push({0,0});
    vector <int> dis(n+1,1e9);
    dis[0] = 0;
    while(!q.empty()){
        auto [w,x] = q.top();
        q.pop();
        if(-w != dis[x]) continue;
        if(x == h) continue;
        for(auto [to,w1] : v[x]){
            if((dis[to] > dis[x] + w1) or (a[to] == 0 and dis[to] != 0)){
                dis[to] = dis[x] + w1;
                if(a[to] == 0) dis[to] = 0;
                q.push({-dis[to],to});
            }
        }
    }
    return dis[h];
}

• 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