제출 #754460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754460		HaciyevAlik	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	1271 ms	8696 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
const int mx=100005;
std::vector<std::pair<long long,long long>> g[mx];
long long used[mx],dis[mx];
std::priority_queue<std::pair<long long,long long>> pq;
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) {
    for(int i=0;i<mx;++i) {g[i].clear();}
    for(int i=0;i<mx;++i) dis[i]=100000000000;
    memset(used,0,sizeof(used));
    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]});
    }
    dis[0]=0;
    pq.push({0,0});
    while(!pq.empty()) {
        int a=pq.top().second; pq.pop();
        if(used[a]) continue;
        used[a]=1;
        for(int i=0;i<(int)g[a].size();++i) {
            long long v=g[a][i].first,w=g[a][i].second;
            if(dis[a]+w<dis[v]) {
                dis[v]=dis[a]+w;
                pq.push({-dis[v],v});
            }
        }
    }
    if(!used[H]) return -1;
    return dis[H];
}

• 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