제출 #1103178

#제출 시각아이디문제언어결과실행 시간메모리
1103178duyhoanhoCities (BOI16_cities)C++17
74 / 100
6056 ms92612 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pi pair<int, int> #define fi first #define se second #define all(v) v.begin(), v.end() const int N = 1e5 + 5, INF = 1e17; int n, k, m; int b[N]; int f[N][70]; vector<pi> ad[N]; void Dij(int st) { // st - mask using tp = tuple<int, int, int>; priority_queue<tp, vector<tp>, greater<tp>> q; for(int i = 1; i <= n; ++i) q.emplace(f[i][st], i, st); while(q.size()) { int c, u, mask; tie(c, u, mask) = q.top(); q.pop(); if(f[u][mask] < c) continue; for(auto x : ad[u]) { int v, w; tie(v, w) = x; int nMask = mask | b[v]; if(f[v][nMask] > c + w) f[v][nMask] = c + w, q.emplace(f[v][nMask], v, nMask); } } } signed main() { cin.tie(0)->sync_with_stdio(0); if(fopen("task.inp", "r")) { freopen("task.inp", "r", stdin); freopen("task.out", "w", stdout); } cin >> n >> k >> m; for(int i = 1, id = 0; i <= k; ++i) { int x; cin >> x; b[x] = (1 << id++); } for(int i = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; ad[u].emplace_back(v, w); ad[v].emplace_back(u, w); } memset(f, 21, sizeof f); for(int i = 1; i <= n; ++i) f[i][b[i]] = 0; for(int mask = 0; mask < (1 << k); ++mask) { for(int sub1 = 0; sub1 < (1 << k); ++sub1) { int sub2 = mask ^ sub1; for(int i = 1; i <= n; ++i) f[i][mask] = min(f[i][mask], f[i][sub1] + f[i][sub2]); } Dij(mask); } int ans = INF; for(int i = 1; i <= n; ++i) ans = min(ans, f[i][(1 << k) - 1]); cout << ans; }

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

cities.cpp: In function 'int main()':
cities.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen("task.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen("task.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...