oj.uz

Submission #1102465

# Submission time Handle Problem Language Result Execution time Memory
1102465 2024-10-18T07:40:22 Z modwwe Airplane (NOI23_airplane) C++17
100 / 100
 315 ms 28660 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e18;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
struct cmp{
 bool operator()(ib a,ib b)
  {
      return a.a>b.a;
  }
};
int dist1[200001];
int distn[200001];
int a[200001];
vector<int> v[200001];
 priority_queue<ib,vector<ib>,cmp>p ;
void dis(int gg,int c[])
 {
    p.push({0,gg});
     while(!p.empty())
     {
         ib x=p.top();
        p.pop();
          if(c[x.b]!=-1) continue;
          c[x.b]=max(a[x.b],x.a);
           for(auto f:v[x.b])
               if(c[f]==-1)
                   p.push({c[x.b]+1,f});
     }
 }
void phongbeo()
{
 cin>>n>>m;
  for(int i=1;i<=n;i++)
     cin>>a[i];
   for(int i=1;i<=m;i++)
 cin>>l>>r,v[l].pb(r),v[r].pb(l);
 memset(dist1,-1,sizeof dist1);
 memset(distn,-1,sizeof distn);
 dis(1,dist1);
  dis(n,distn);
  s4=inf;
  for(int i=1;i<=n;i++)
  {
       s4=min(s4,max(dist1[i],distn[i])*2);
       for(auto f:v[i])
        s4=min(s4,max(dist1[i],distn[f])*2+1);
  }
  cout<<s4;
}

Compilation message

Main.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9808 KB Output is correct
2 Correct 51 ms 15944 KB Output is correct
3 Correct 54 ms 15944 KB Output is correct
4 Correct 53 ms 15944 KB Output is correct
5 Correct 53 ms 15952 KB Output is correct
6 Correct 58 ms 15944 KB Output is correct
7 Correct 55 ms 15944 KB Output is correct
8 Correct 3 ms 9976 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9984 KB Output is correct
2 Correct 4 ms 9808 KB Output is correct
3 Correct 3 ms 9808 KB Output is correct
4 Correct 3 ms 9808 KB Output is correct
5 Correct 3 ms 9808 KB Output is correct
6 Correct 4 ms 9808 KB Output is correct
7 Correct 4 ms 9808 KB Output is correct
8 Correct 4 ms 9808 KB Output is correct
9 Correct 3 ms 9808 KB Output is correct
10 Correct 4 ms 9976 KB Output is correct
11 Correct 3 ms 9808 KB Output is correct
12 Correct 3 ms 9808 KB Output is correct
13 Correct 4 ms 9868 KB Output is correct
14 Correct 4 ms 9808 KB Output is correct
15 Correct 4 ms 10064 KB Output is correct
16 Correct 5 ms 9808 KB Output is correct
17 Correct 4 ms 9808 KB Output is correct
18 Correct 3 ms 9856 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9984 KB Output is correct
2 Correct 4 ms 9808 KB Output is correct
3 Correct 3 ms 9808 KB Output is correct
4 Correct 3 ms 9808 KB Output is correct
5 Correct 3 ms 9808 KB Output is correct
6 Correct 4 ms 9808 KB Output is correct
7 Correct 4 ms 9808 KB Output is correct
8 Correct 4 ms 9808 KB Output is correct
9 Correct 3 ms 9808 KB Output is correct
10 Correct 4 ms 9976 KB Output is correct
11 Correct 3 ms 9808 KB Output is correct
12 Correct 3 ms 9808 KB Output is correct
13 Correct 4 ms 9868 KB Output is correct
14 Correct 4 ms 9808 KB Output is correct
15 Correct 4 ms 10064 KB Output is correct
16 Correct 5 ms 9808 KB Output is correct
17 Correct 4 ms 9808 KB Output is correct
18 Correct 3 ms 9856 KB Output is correct
19 Correct 4 ms 9808 KB Output is correct
20 Correct 4 ms 9808 KB Output is correct
21 Correct 4 ms 9820 KB Output is correct
22 Correct 4 ms 9940 KB Output is correct
23 Correct 5 ms 9820 KB Output is correct
24 Correct 4 ms 9976 KB Output is correct
25 Correct 4 ms 9808 KB Output is correct
26 Correct 4 ms 9808 KB Output is correct
27 Correct 4 ms 9808 KB Output is correct
28 Correct 5 ms 9808 KB Output is correct
29 Correct 5 ms 10064 KB Output is correct
30 Correct 5 ms 10064 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9808 KB Output is correct
2 Correct 51 ms 15944 KB Output is correct
3 Correct 54 ms 15944 KB Output is correct
4 Correct 53 ms 15944 KB Output is correct
5 Correct 53 ms 15952 KB Output is correct
6 Correct 58 ms 15944 KB Output is correct
7 Correct 55 ms 15944 KB Output is correct
8 Correct 3 ms 9976 KB Output is correct
9 Correct 4 ms 9984 KB Output is correct
10 Correct 4 ms 9808 KB Output is correct
11 Correct 3 ms 9808 KB Output is correct
12 Correct 3 ms 9808 KB Output is correct
13 Correct 3 ms 9808 KB Output is correct
14 Correct 4 ms 9808 KB Output is correct
15 Correct 4 ms 9808 KB Output is correct
16 Correct 4 ms 9808 KB Output is correct
17 Correct 3 ms 9808 KB Output is correct
18 Correct 4 ms 9976 KB Output is correct
19 Correct 3 ms 9808 KB Output is correct
20 Correct 3 ms 9808 KB Output is correct
21 Correct 4 ms 9868 KB Output is correct
22 Correct 4 ms 9808 KB Output is correct
23 Correct 4 ms 10064 KB Output is correct
24 Correct 5 ms 9808 KB Output is correct
25 Correct 4 ms 9808 KB Output is correct
26 Correct 3 ms 9856 KB Output is correct
27 Correct 4 ms 9808 KB Output is correct
28 Correct 4 ms 9808 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9940 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9976 KB Output is correct
33 Correct 4 ms 9808 KB Output is correct
34 Correct 4 ms 9808 KB Output is correct
35 Correct 4 ms 9808 KB Output is correct
36 Correct 5 ms 9808 KB Output is correct
37 Correct 5 ms 10064 KB Output is correct
38 Correct 5 ms 10064 KB Output is correct
39 Correct 96 ms 16968 KB Output is correct
40 Correct 76 ms 16992 KB Output is correct
41 Correct 80 ms 16996 KB Output is correct
42 Correct 79 ms 16968 KB Output is correct
43 Correct 93 ms 16968 KB Output is correct
44 Correct 85 ms 16968 KB Output is correct
45 Correct 84 ms 16968 KB Output is correct
46 Correct 91 ms 16968 KB Output is correct
47 Correct 77 ms 16976 KB Output is correct
48 Correct 84 ms 16968 KB Output is correct
49 Correct 104 ms 17008 KB Output is correct
50 Correct 88 ms 17140 KB Output is correct
51 Correct 81 ms 16968 KB Output is correct
52 Correct 211 ms 22972 KB Output is correct
53 Correct 205 ms 22972 KB Output is correct
54 Correct 183 ms 22972 KB Output is correct
55 Correct 174 ms 22972 KB Output is correct
56 Correct 227 ms 28600 KB Output is correct
57 Correct 230 ms 28612 KB Output is correct
58 Correct 315 ms 28436 KB Output is correct
59 Correct 300 ms 28612 KB Output is correct
60 Correct 218 ms 28660 KB Output is correct
61 Correct 240 ms 28508 KB Output is correct
62 Correct 226 ms 28616 KB Output is correct
63 Correct 211 ms 28484 KB Output is correct
64 Correct 212 ms 28600 KB Output is correct
65 Correct 188 ms 28472 KB Output is correct
66 Correct 222 ms 28452 KB Output is correct
67 Correct 227 ms 28600 KB Output is correct