# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886689 | fanwen | Airplane (NOI23_airplane) | C++17 | 272 ms | 21064 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* author : bo may can 5 */
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define file(name) \
if(fopen(name".inp", "r")) \
freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);
const int MAX = 2e5 + 5;
int n, m, a[MAX], f[MAX], g[MAX];
vector <int> adj[MAX];
void dp(int s, int f[]) {
fill(f + 1, f + n + 1, INT_MAX);
priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> q;
q.emplace(f[s] = a[s], s);
while(!q.empty()) {
auto [du, u] = q.top(); q.pop();
if(f[u] != du) continue;
for (auto v : adj[u]) if(f[v] > max(f[u] + 1, a[v])) {
f[v] = max(f[u] + 1, a[v]);
q.emplace(f[v], v);
}
}
}
void you_make_it(void) {
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i];
while(m--) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
dp(1, f), dp(n, g);
int ans = INT_MAX;
for (int i = 1; i <= n; ++i) ans = min(ans, max(f[i], g[i]) * 2);
// for (int i = 1; i <= n; ++i) cout << f[i] << " \n"[i == n];
// for (int i = 1; i <= n; ++i) cout << g[i] << " \n"[i == n];
for (int u = 1; u <= n; ++u) {
for (auto v : adj[u]) {
ans = min(ans, max(f[u], g[v]) * 2 + 1);
}
}
cout << ans;
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
file("airplane");
auto start_time = chrono::steady_clock::now();
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
you_make_it();
auto end_time = chrono::steady_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |