Submission #1061084

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

cyberland

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

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> arr) {
    if(*max_element(arr.begin(), arr.end()) == 1 and *min_element(arr.begin(), arr.end()) == 1){
        vector <pair<int,int>> v[n];
        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,w] : v[w1.ss]){
                if(d[i] > d[w1.ss] + w){
                    d[i] = d[w1.ss] + w;
                    q.push({-d[i],i});
                }
            }
        }
        if(d[h] == 1e9) d[h] = -1;
        return d[h];
    }
    return -1;
}

• 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