Submission #1061391

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

cyberland

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

using namespace std;

#define ff first
#define ss second

vector <pair<int,int>> v[200005];

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    for(int i = 0; i <= n; i++){
        v[i].clear();
    }
    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 <int> d(n,1e9);
    d[0] = 0;
    priority_queue <pair<int,int>> q;
    q.push({0,0});
    while(!q.empty()){
        pair <int,int> w1 = q.top();
        q.pop();
        w1.ff *= (-1);
        if(w1.ff != d[w1.ss]) continue;
        for(auto i : v[w1.ss]){
            if(d[i.ff] > d[w1.ss] + i.ss){
                d[i.ff] = d[w1.ss] + i.ss;
                q.push({-d[i.ff],i.ff});
            }
        }
    }
    if(d[h] == 1e9) d[h] = -1;
    return d[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