제출 #1003776

#제출 시각아이디문제언어결과실행 시간메모리
1003776overwatch9Robot (JOI21_ho_t4)C++17
0 / 100
3063 ms2097152 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn = 1e5 + 1; vector <array <int, 3>> adj[maxn]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b, c, p; cin >> a >> b >> c >> p; adj[a].push_back({b, c, p}); adj[b].push_back({a, c, p}); } vector <vector <ll>> dis(n+1, vector <ll> (m+1, 1e18)); fill(dis[1].begin(), dis[1].end(), 0); priority_queue <array <ll, 4>> pq; pq.push({0, 0, 0, 1}); vector <vector <bool>> processed(n+1, vector <bool> (m+1)); ll ans = 1e18; while (!pq.empty()) { int s = pq.top()[3]; int col = pq.top()[1]; int p = pq.top()[2]; pq.pop(); if (processed[s][col]) continue; processed[s][col] = true; if (s == n) ans = min(ans, dis[s][col]); vector <int> cnt(m+1); vector <ll> sum(m+1); for (auto i : adj[s]) { if (i[0] == p) { cnt[col]++; sum[col] += i[2]; } else { cnt[i[1]]++; sum[i[1]] += i[2]; } } ll cost = 0; for (auto i : adj[s]) { int c = i[1]; if (i[0] == p) c = col; for (int j = 1; j <= m; j++) { if (cnt[j] == 1 && c == j && dis[i[0]][j] > dis[s][col]) { dis[i[0]][j] = dis[s][col]; pq.push({-dis[i[0]][j], j, s, i[0]}); } else if (cnt[j] == 0 && dis[i[0]][j] > dis[s][col] + min(sum[c] - i[2], (ll)i[2])) { dis[i[0]][j] = dis[s][col] + min(sum[c] - i[2], (ll)i[2]); pq.push({-dis[i[0]][j], j, s, i[0]}); } } } } if (ans == 1e18) ans = -1; cout << ans << '\n'; }

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

Main.cpp: In function 'int main()':
Main.cpp:42:12: warning: unused variable 'cost' [-Wunused-variable]
   42 |         ll cost = 0;
      |            ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...