oj.uz

답안 #850731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850731 2023-09-17T11:07:33 Z Forested Airplane (NOI23_airplane) C++17
100 / 100
 328 ms 24312 KB 
#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<i32> a(n);
    REP(i, n) {
        cin >> a[i];
    }
    Vec<Vec<i32>> g(n);
    REP(i, m) {
        i32 u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    const auto dijk = [&](i32 s) -> Vec<i32> {
        Vec<i32> dist(n, INF);
        priority_queue<pair<i32, i32>, Vec<pair<i32, i32>>, greater<>> pq;
        dist[s] = 0;
        pq.emplace(0, s);
        while (!pq.empty()) {
            auto [d, v] = pq.top();
            pq.pop();
            if (d > dist[v]) {
                continue;
            }
            for (i32 u : g[v]) {
                i32 t = d + max(a[u] - d, 1);
                if (chmin(dist[u], t)) {
                    pq.emplace(t, u);
                }
            }
        }
        return dist;
    };
    Vec<i32> dist0 = dijk(0), dist1 = dijk(n - 1);
    i32 ans = INF;
    REP(i, n) {
        chmin(ans, 2 * max(dist0[i], dist1[i]));
    }
    REP(u, n) {
        for (i32 v : g[u]) {
            chmin(ans, 2 * max(dist0[u], dist1[v]) + 1);
        }
    }
    cout << ans << '\n';
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 57 ms 16784 KB Output is correct
3 Correct 59 ms 17228 KB Output is correct
4 Correct 61 ms 17492 KB Output is correct
5 Correct 68 ms 18260 KB Output is correct
6 Correct 62 ms 17816 KB Output is correct
7 Correct 62 ms 18000 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 1 ms 500 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 684 KB Output is correct
30 Correct 2 ms 604 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 57 ms 16784 KB Output is correct
3 Correct 59 ms 17228 KB Output is correct
4 Correct 61 ms 17492 KB Output is correct
5 Correct 68 ms 18260 KB Output is correct
6 Correct 62 ms 17816 KB Output is correct
7 Correct 62 ms 18000 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 2 ms 644 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 500 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 684 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 116 ms 17868 KB Output is correct
40 Correct 90 ms 17172 KB Output is correct
41 Correct 88 ms 17136 KB Output is correct
42 Correct 117 ms 17224 KB Output is correct
43 Correct 88 ms 17136 KB Output is correct
44 Correct 89 ms 17252 KB Output is correct
45 Correct 120 ms 17280 KB Output is correct
46 Correct 91 ms 17100 KB Output is correct
47 Correct 92 ms 17116 KB Output is correct
48 Correct 94 ms 17188 KB Output is correct
49 Correct 114 ms 18124 KB Output is correct
50 Correct 147 ms 17748 KB Output is correct
51 Correct 135 ms 17748 KB Output is correct
52 Correct 165 ms 20788 KB Output is correct
53 Correct 142 ms 19696 KB Output is correct
54 Correct 170 ms 19512 KB Output is correct
55 Correct 166 ms 19852 KB Output is correct
56 Correct 328 ms 23116 KB Output is correct
57 Correct 230 ms 23344 KB Output is correct
58 Correct 274 ms 24280 KB Output is correct
59 Correct 203 ms 24312 KB Output is correct
60 Correct 191 ms 23952 KB Output is correct
61 Correct 280 ms 23628 KB Output is correct
62 Correct 201 ms 23128 KB Output is correct
63 Correct 220 ms 23232 KB Output is correct
64 Correct 190 ms 22992 KB Output is correct
65 Correct 186 ms 23148 KB Output is correct
66 Correct 213 ms 23172 KB Output is correct
67 Correct 229 ms 23592 KB Output is correct