oj.uz

Submission #966937

# Submission time Handle Problem Language Result Execution time Memory
966937 2024-04-20T16:13:34 Z TB_ Airplane (NOI23_airplane) C++17
100 / 100
 401 ms 36860 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vvl adj(3e5);

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, m, from, to;
    cin >> n >> m;
    vl h(n);
    fo(i, n) cin >> h[i];
    fo(i, m){
        cin >> from >> to;
        adj[--from].pb(--to);
        adj[to].pb(from);
    }
    priority_queue<pl> pq;
    vl a(n, -1), b(n, -1);
    pq.push({0, 0});
    ll pos, height;
    while(!pq.empty()){
        tie(height, pos) = pq.top();
        pq.pop();
        height = -height;
        if(a[pos] != -1) continue;
        // deb2(pos, height);
        a[pos] = height;
        for(auto &v : adj[pos]){
            if(a[v] != -1) continue;
            pq.push({-max(h[v], height+1), v});
        }
    }
    pq.push({0, n-1});
    while(!pq.empty()){
        tie(height, pos) = pq.top();
        pq.pop();
        height = -height;
        if(b[pos] != -1) continue;
        b[pos] = height;
        for(auto &v : adj[pos]){
            if(b[v] != -1) continue;
            pq.push({-max(h[v], height+1), v});
        }
    }
    ll ans = 1e18;
    fo(i, n){
        if(a[i] == b[i]) ans = min(ans, a[i]+b[i]);
        for(auto &v : adj[i]){
            if(a[i] == b[v]) ans = min(ans, a[i]+b[v]+1);
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 58 ms 21584 KB Output is correct
3 Correct 72 ms 21840 KB Output is correct
4 Correct 61 ms 22096 KB Output is correct
5 Correct 62 ms 22612 KB Output is correct
6 Correct 61 ms 22716 KB Output is correct
7 Correct 64 ms 22488 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 5 ms 7604 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 3 ms 7516 KB Output is correct
10 Correct 4 ms 7516 KB Output is correct
11 Correct 4 ms 7516 KB Output is correct
12 Correct 4 ms 7512 KB Output is correct
13 Correct 4 ms 7900 KB Output is correct
14 Correct 4 ms 7516 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 4 ms 7780 KB Output is correct
17 Correct 4 ms 7768 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 5 ms 7604 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 3 ms 7516 KB Output is correct
10 Correct 4 ms 7516 KB Output is correct
11 Correct 4 ms 7516 KB Output is correct
12 Correct 4 ms 7512 KB Output is correct
13 Correct 4 ms 7900 KB Output is correct
14 Correct 4 ms 7516 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 4 ms 7780 KB Output is correct
17 Correct 4 ms 7768 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 3 ms 7516 KB Output is correct
20 Correct 4 ms 7520 KB Output is correct
21 Correct 5 ms 7512 KB Output is correct
22 Correct 5 ms 7548 KB Output is correct
23 Correct 3 ms 7516 KB Output is correct
24 Correct 3 ms 7612 KB Output is correct
25 Correct 4 ms 7516 KB Output is correct
26 Correct 4 ms 7512 KB Output is correct
27 Correct 4 ms 7768 KB Output is correct
28 Correct 4 ms 7772 KB Output is correct
29 Correct 5 ms 7768 KB Output is correct
30 Correct 4 ms 7772 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 58 ms 21584 KB Output is correct
3 Correct 72 ms 21840 KB Output is correct
4 Correct 61 ms 22096 KB Output is correct
5 Correct 62 ms 22612 KB Output is correct
6 Correct 61 ms 22716 KB Output is correct
7 Correct 64 ms 22488 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 2 ms 7256 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 5 ms 7604 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 4 ms 7516 KB Output is correct
19 Correct 4 ms 7516 KB Output is correct
20 Correct 4 ms 7512 KB Output is correct
21 Correct 4 ms 7900 KB Output is correct
22 Correct 4 ms 7516 KB Output is correct
23 Correct 4 ms 7772 KB Output is correct
24 Correct 4 ms 7780 KB Output is correct
25 Correct 4 ms 7768 KB Output is correct
26 Correct 2 ms 7260 KB Output is correct
27 Correct 3 ms 7516 KB Output is correct
28 Correct 4 ms 7520 KB Output is correct
29 Correct 5 ms 7512 KB Output is correct
30 Correct 5 ms 7548 KB Output is correct
31 Correct 3 ms 7516 KB Output is correct
32 Correct 3 ms 7612 KB Output is correct
33 Correct 4 ms 7516 KB Output is correct
34 Correct 4 ms 7512 KB Output is correct
35 Correct 4 ms 7768 KB Output is correct
36 Correct 4 ms 7772 KB Output is correct
37 Correct 5 ms 7768 KB Output is correct
38 Correct 4 ms 7772 KB Output is correct
39 Correct 159 ms 23648 KB Output is correct
40 Correct 132 ms 22868 KB Output is correct
41 Correct 117 ms 23124 KB Output is correct
42 Correct 112 ms 22864 KB Output is correct
43 Correct 96 ms 22880 KB Output is correct
44 Correct 99 ms 22920 KB Output is correct
45 Correct 110 ms 22748 KB Output is correct
46 Correct 103 ms 22900 KB Output is correct
47 Correct 106 ms 22868 KB Output is correct
48 Correct 138 ms 22700 KB Output is correct
49 Correct 198 ms 23636 KB Output is correct
50 Correct 178 ms 23828 KB Output is correct
51 Correct 141 ms 23576 KB Output is correct
52 Correct 258 ms 29916 KB Output is correct
53 Correct 271 ms 28568 KB Output is correct
54 Correct 217 ms 28564 KB Output is correct
55 Correct 307 ms 28824 KB Output is correct
56 Correct 378 ms 35848 KB Output is correct
57 Correct 376 ms 36548 KB Output is correct
58 Correct 354 ms 36032 KB Output is correct
59 Correct 372 ms 35792 KB Output is correct
60 Correct 382 ms 36860 KB Output is correct
61 Correct 399 ms 35500 KB Output is correct
62 Correct 310 ms 36036 KB Output is correct
63 Correct 335 ms 36208 KB Output is correct
64 Correct 382 ms 35872 KB Output is correct
65 Correct 333 ms 35896 KB Output is correct
66 Correct 398 ms 35756 KB Output is correct
67 Correct 401 ms 35492 KB Output is correct