제출 #922358

#제출 시각아이디문제언어결과실행 시간메모리
922358dozer사이버랜드 (APIO23_cyberland)C++17
44 / 100
3010 ms58804 KiB
#include "cyberland.h" #include <bits/stdc++.h> using namespace std; #define sp " " #define pb push_back #define pii pair<int, int> #define st first #define nd second #define fileio() freopen("curling.in", "r", stdin), freopen("curling.out", "w", stdout) const long double INF = 2e18 + 7; double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) { int lim = min(K, 100); vector<vector<long double>> dist(lim + 5, vector<long double>(N, INF)); vector<pii> adj[N + 5]; for (int i = 0; i < M; i++){ adj[x[i]].pb({y[i], c[i]}); adj[y[i]].pb({x[i], c[i]}); } vector<int> mark(N + 5, 0); queue<int> q; q.push(0); mark[0] = 1; while(!q.empty()){ int top = q.front(); q.pop(); for (auto i : adj[top]){ if (mark[i.st] == 0){ mark[i.st] = 1; if (i.st != H) q.push(i.st); } } } long double mini = INF; for (int i = lim; i >= 0; i--){ priority_queue<pair<long double, int>> q; dist[i][H] = 0; for (int j = 0; j < N; j++){ q.push({-dist[i][j], j}); } while(!q.empty()){ int top = q.top().nd; q.pop(); int curr = i; if (arr[top] != 2){ for (auto j : adj[top]){ int v = j.st, w = j.nd; long double upd = dist[i][top] + (long double)w / (1LL<<i); if (dist[i][v] > upd){ dist[i][v] = upd; if (v != H) q.push({-upd, v}); } } } else if (i > 0){ for (auto j : adj[top]){ int v = j.st, w = j.nd; long double upd = dist[i][top] + (long double)w / (1LL<<(i - 1)); if (dist[i - 1][v] > upd){ dist[i - 1][v] = upd; } } } } } for (int i = 0; i < N; i++){ if (i != H && mark[i] && arr[i] == 0) mini = min(mini, dist[0][i]); } mini = min(mini, dist[0][0]); if (mini > 1e18) return -1; return mini; }

컴파일 시 표준 에러 (stderr) 메시지

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:48:8: warning: unused variable 'curr' [-Wunused-variable]
   48 |    int curr = i;
      |        ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...