제출 #1253421

#제출 시각아이디문제언어결과실행 시간메모리
1253421antonnShortcut (IOI16_shortcut)C++20
0 / 100
0 ms324 KiB
#include "shortcut.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; template<typename T> bool assign_min(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<typename T> bool assign_max(T& a, T b) { if (a < b) { a = b; return true; } return false; } /* 4 10 10 20 20 0 40 0 30 */ int n; vector<vector<pair<int, int>>> g; vector<ll> dist; int get_far(int u) { vector<int> vis(2 * n + 1); dist.assign(2 * n + 1, 1e18); priority_queue<pair<ll, ll>> pq; pq.push({0, u}); dist[u] = 0; while (!pq.empty()) { int u = pq.top().second; pq.pop(); if (vis[u]) { continue; } vis[u] = 1; for (auto [v, c] : g[u]) { if (dist[u] + c < dist[v]) { dist[v] = dist[u] + c; pq.push({-dist[v], v}); } } } int best = 1; for (int i = 1; i <= 2 * n; i++) { if (dist[i] != 1e18 && dist[i] > dist[best]) { best = i; } } return best; } ll solve(vector<array<ll, 3>> edges) { g.assign(2 * n + 1, {}); for (auto [a, b, c] : edges) { g[a].push_back({b, c}); g[b].push_back({a, c}); } int u = get_far(1); int v = get_far(u); return dist[v]; } ll find_shortcut(int N, vector<int> l, vector<int> d, int c) { n = N; vector<array<ll, 3>> edges; for (int i = 1; i <= n; i++) { if (d[i - 1] != 0) { edges.push_back({i, n + i, d[i - 1]}); } if (i < n) { edges.push_back({i, i + 1, l[i - 1]}); } } ll ans = 1e18; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { edges.push_back({i, j, c}); ans = min(ans, solve(edges)); edges.pop_back(); } } return ans; }

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

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...