제출 #967078

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

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
// #define int long long
#define ff first
#define ss second
const int shrek = 1e5 + 10;
// vector< vector<pair<int, int>>> adj(shrek);
vector<pair<int, int>> adj[shrek];

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<double> dist (n);
    for(int i = 0; i < n; i++)
        adj[i].clear();
    for(int i = 0; i < n; i++) dist[i] = -1;
    for(int i = 0; i < m; i++) {
        adj[x[i]].push_back({y[i], c[i]});
        adj[y[i]].push_back({x[i], c[i]});
    }
    priority_queue <pair<double, int>> q;
    q.push({0.0, 0});
    while(!q.empty()) {
        double d = -q.top().ff;
        int u = q.top().ss;
        q.pop();
        if(dist[u] != -1) continue;
        dist[u] = d;
        for(auto x : adj[u]) {
            int v = x.ff;
            double w = x.ss;
            q.push({-(d + w), v});
        }
    }
    double ans = dist[h];
    return ans;
}

• 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