Submission #917796

#TimeUsernameProblemLanguageResultExecution timeMemory
917796XXBabaProBerkay사이버랜드 (APIO23_cyberland)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; #define F first #define S second using ll = long long; double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) { vector<vector<pair<int, ll>>> adj(N); for (int i = 0; i < M; i++) { adj[x[i]].emplace_back(y[i], c[i]); adj[y[i]].emplace_back(x[i], c[i]); } priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> PQ; vector<ll> dist(N, 1e18); dist[0] = 0.0; PQ.emplace(0.0, 0); while (!PQ.empty()) { auto [d, u] = PQ.top(); PQ.pop(); if (d != dist[u]) continue; if (arr[u] == 0) dist[u] = 0; for (pair<int, ll> i : adj[u]) { auto [v, w] = i; if (dist[v] > dist[u] + w) PQ.emplace(dist[v] = dist[u] + w, v); } } return dist[H] == 1e18 ? -1.0 : double(dist[H]); } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int N, M, K, H; cin >> N >> M >> K >> H; vector<int> x(M), y(M), c(M), arr(N); for (int i = 0; i < N; i++) cin >> arr[i]; for (int i = 0; i < M; i++) cin >> x[i] >> y[i] >> c[i]; cout << solve(N, M, K, H, x, y, c, arr) << '\n'; }

Compilation message (stderr)

/usr/bin/ld: /tmp/cc9Ihszv.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc40vxOv.o:cyberland.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status