Submission #1196246

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196246		GoBananas69	사이버랜드 (APIO23_cyberland)	C++20	0 / 100	16 ms	5444 KiB

cyberland

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using std::vector;
using std::pair;

vector<vector<pair<int, int>>> adj;
vector<bool> vis;
vector<int> dist;

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    adj.assign(n, {});
    vis.assign(n, false);
    dist.assign(n, 0);
    for (int i = 0; i<m; ++i) {
        int u = x[i], v = y[i], w = c[i];
        adj[u].push_back({v, w});
        adj[v].push_back({u, w}); 
    }
    std::queue<int> q;
    dist[0] = 0;
    q.push(0);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (auto &p: adj[u]) {
            int v = p.first;
            int w = p.second;
            dist[v] = dist[u] + w;
            if (v == h) {
                return dist[v];
            }
            q.push(v);
        }
    }
    if (vis[h] == false) return -1;
    else return dist[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