oj.uz

Submission #998251

# Submission time Handle Problem Language Result Execution time Memory
998251 2024-06-13T12:40:49 Z cpptowin Airplane (NOI23_airplane) C++17
100 / 100
 246 ms 64792 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(),x.end()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n,m,a[maxn],l[maxn],r[maxn];
vi ke[maxn];
void dij(int inp,int d[],int n)
{
    fo(i,1,n) d[i] = inf;
    d[inp] = 0;
    priority_queue<pii,vii,greater<pii>> q;
    q.push({0,inp});
    while(q.size())
    {
        auto [du,u] = q.top();
        q.pop();
        if(d[u] != du) continue;
        for(int v : ke[u])
        {   
            int val = max(du + 1,a[v]);
            if(minimize(d[v],val))
            {
                q.push({d[v],v});
            }
        }
    }
}
pii edge[maxn];
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    fo(i,1,n) cin >> a[i];
    fo(i,1,m)
    {
        int u,v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
        edge[i] = {u,v};
    }
    dij(1,l,n);
    dij(n,r,n);
    int ans = inf;
    fo(i,1,n) 
    {
        minimize(ans,max(l[i],r[i]) * 2);
    }
    fo(i,1,m)
    {
        auto [u,v] = edge[i];
        minimize(ans,max(l[u],r[v]) * 2 + 1);
        minimize(ans,max(r[u],l[v]) * 2 + 1);
    }
    cout << ans;
}

Compilation message

Main.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 51 ms 45748 KB Output is correct
3 Correct 51 ms 45764 KB Output is correct
4 Correct 56 ms 49492 KB Output is correct
5 Correct 62 ms 50000 KB Output is correct
6 Correct 57 ms 49900 KB Output is correct
7 Correct 60 ms 49904 KB Output is correct
8 Correct 5 ms 29016 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 4 ms 29020 KB Output is correct
3 Correct 4 ms 29020 KB Output is correct
4 Correct 5 ms 29192 KB Output is correct
5 Correct 4 ms 29020 KB Output is correct
6 Correct 5 ms 29144 KB Output is correct
7 Correct 6 ms 29124 KB Output is correct
8 Correct 5 ms 29272 KB Output is correct
9 Correct 4 ms 29192 KB Output is correct
10 Correct 6 ms 29272 KB Output is correct
11 Correct 5 ms 29276 KB Output is correct
12 Correct 6 ms 29152 KB Output is correct
13 Correct 6 ms 29276 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 7 ms 29532 KB Output is correct
16 Correct 6 ms 29276 KB Output is correct
17 Correct 6 ms 29272 KB Output is correct
18 Correct 5 ms 29020 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 4 ms 29020 KB Output is correct
3 Correct 4 ms 29020 KB Output is correct
4 Correct 5 ms 29192 KB Output is correct
5 Correct 4 ms 29020 KB Output is correct
6 Correct 5 ms 29144 KB Output is correct
7 Correct 6 ms 29124 KB Output is correct
8 Correct 5 ms 29272 KB Output is correct
9 Correct 4 ms 29192 KB Output is correct
10 Correct 6 ms 29272 KB Output is correct
11 Correct 5 ms 29276 KB Output is correct
12 Correct 6 ms 29152 KB Output is correct
13 Correct 6 ms 29276 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 7 ms 29532 KB Output is correct
16 Correct 6 ms 29276 KB Output is correct
17 Correct 6 ms 29272 KB Output is correct
18 Correct 5 ms 29020 KB Output is correct
19 Correct 5 ms 29276 KB Output is correct
20 Correct 5 ms 29144 KB Output is correct
21 Correct 5 ms 29276 KB Output is correct
22 Correct 5 ms 29224 KB Output is correct
23 Correct 5 ms 29200 KB Output is correct
24 Correct 5 ms 29276 KB Output is correct
25 Correct 5 ms 29276 KB Output is correct
26 Correct 5 ms 29276 KB Output is correct
27 Correct 5 ms 29276 KB Output is correct
28 Correct 6 ms 29276 KB Output is correct
29 Correct 6 ms 29408 KB Output is correct
30 Correct 6 ms 29276 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 51 ms 45748 KB Output is correct
3 Correct 51 ms 45764 KB Output is correct
4 Correct 56 ms 49492 KB Output is correct
5 Correct 62 ms 50000 KB Output is correct
6 Correct 57 ms 49900 KB Output is correct
7 Correct 60 ms 49904 KB Output is correct
8 Correct 5 ms 29016 KB Output is correct
9 Correct 4 ms 29020 KB Output is correct
10 Correct 4 ms 29020 KB Output is correct
11 Correct 4 ms 29020 KB Output is correct
12 Correct 5 ms 29192 KB Output is correct
13 Correct 4 ms 29020 KB Output is correct
14 Correct 5 ms 29144 KB Output is correct
15 Correct 6 ms 29124 KB Output is correct
16 Correct 5 ms 29272 KB Output is correct
17 Correct 4 ms 29192 KB Output is correct
18 Correct 6 ms 29272 KB Output is correct
19 Correct 5 ms 29276 KB Output is correct
20 Correct 6 ms 29152 KB Output is correct
21 Correct 6 ms 29276 KB Output is correct
22 Correct 6 ms 29276 KB Output is correct
23 Correct 7 ms 29532 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct
25 Correct 6 ms 29272 KB Output is correct
26 Correct 5 ms 29020 KB Output is correct
27 Correct 5 ms 29276 KB Output is correct
28 Correct 5 ms 29144 KB Output is correct
29 Correct 5 ms 29276 KB Output is correct
30 Correct 5 ms 29224 KB Output is correct
31 Correct 5 ms 29200 KB Output is correct
32 Correct 5 ms 29276 KB Output is correct
33 Correct 5 ms 29276 KB Output is correct
34 Correct 5 ms 29276 KB Output is correct
35 Correct 5 ms 29276 KB Output is correct
36 Correct 6 ms 29276 KB Output is correct
37 Correct 6 ms 29408 KB Output is correct
38 Correct 6 ms 29276 KB Output is correct
39 Correct 122 ms 51172 KB Output is correct
40 Correct 85 ms 50144 KB Output is correct
41 Correct 87 ms 50256 KB Output is correct
42 Correct 84 ms 50256 KB Output is correct
43 Correct 92 ms 50256 KB Output is correct
44 Correct 92 ms 50256 KB Output is correct
45 Correct 90 ms 50116 KB Output is correct
46 Correct 86 ms 50256 KB Output is correct
47 Correct 87 ms 50256 KB Output is correct
48 Correct 83 ms 50260 KB Output is correct
49 Correct 112 ms 51024 KB Output is correct
50 Correct 100 ms 50780 KB Output is correct
51 Correct 107 ms 50896 KB Output is correct
52 Correct 180 ms 58956 KB Output is correct
53 Correct 160 ms 57904 KB Output is correct
54 Correct 151 ms 57824 KB Output is correct
55 Correct 192 ms 58140 KB Output is correct
56 Correct 213 ms 63060 KB Output is correct
57 Correct 198 ms 63164 KB Output is correct
58 Correct 217 ms 64192 KB Output is correct
59 Correct 217 ms 64184 KB Output is correct
60 Correct 188 ms 64792 KB Output is correct
61 Correct 215 ms 63676 KB Output is correct
62 Correct 192 ms 62940 KB Output is correct
63 Correct 192 ms 62944 KB Output is correct
64 Correct 195 ms 62932 KB Output is correct
65 Correct 205 ms 59944 KB Output is correct
66 Correct 208 ms 60112 KB Output is correct
67 Correct 246 ms 63160 KB Output is correct