oj.uz

답안 #1102467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102467 2024-10-18T07:41:20 Z modwwe Airplane (NOI23_airplane) C++17
100 / 100
 243 ms 19000 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:37:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   37 | const int inf = 1e18;
      |                 ^~~~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7248 KB Output is correct
2 Correct 49 ms 13756 KB Output is correct
3 Correct 52 ms 13640 KB Output is correct
4 Correct 54 ms 13596 KB Output is correct
5 Correct 55 ms 13660 KB Output is correct
6 Correct 54 ms 13704 KB Output is correct
7 Correct 59 ms 13696 KB Output is correct
8 Correct 2 ms 7504 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7264 KB Output is correct
2 Correct 2 ms 7504 KB Output is correct
3 Correct 2 ms 7504 KB Output is correct
4 Correct 2 ms 7504 KB Output is correct
5 Correct 2 ms 7344 KB Output is correct
6 Correct 3 ms 7504 KB Output is correct
7 Correct 3 ms 7368 KB Output is correct
8 Correct 3 ms 7504 KB Output is correct
9 Correct 3 ms 7504 KB Output is correct
10 Correct 3 ms 7504 KB Output is correct
11 Correct 3 ms 7548 KB Output is correct
12 Correct 3 ms 7504 KB Output is correct
13 Correct 3 ms 7504 KB Output is correct
14 Correct 4 ms 7524 KB Output is correct
15 Correct 4 ms 7504 KB Output is correct
16 Correct 4 ms 7504 KB Output is correct
17 Correct 4 ms 7600 KB Output is correct
18 Correct 4 ms 7504 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7264 KB Output is correct
2 Correct 2 ms 7504 KB Output is correct
3 Correct 2 ms 7504 KB Output is correct
4 Correct 2 ms 7504 KB Output is correct
5 Correct 2 ms 7344 KB Output is correct
6 Correct 3 ms 7504 KB Output is correct
7 Correct 3 ms 7368 KB Output is correct
8 Correct 3 ms 7504 KB Output is correct
9 Correct 3 ms 7504 KB Output is correct
10 Correct 3 ms 7504 KB Output is correct
11 Correct 3 ms 7548 KB Output is correct
12 Correct 3 ms 7504 KB Output is correct
13 Correct 3 ms 7504 KB Output is correct
14 Correct 4 ms 7524 KB Output is correct
15 Correct 4 ms 7504 KB Output is correct
16 Correct 4 ms 7504 KB Output is correct
17 Correct 4 ms 7600 KB Output is correct
18 Correct 4 ms 7504 KB Output is correct
19 Correct 4 ms 7760 KB Output is correct
20 Correct 4 ms 7504 KB Output is correct
21 Correct 3 ms 7504 KB Output is correct
22 Correct 3 ms 7580 KB Output is correct
23 Correct 3 ms 7504 KB Output is correct
24 Correct 4 ms 7504 KB Output is correct
25 Correct 3 ms 7676 KB Output is correct
26 Correct 3 ms 7504 KB Output is correct
27 Correct 4 ms 7620 KB Output is correct
28 Correct 4 ms 7504 KB Output is correct
29 Correct 5 ms 7504 KB Output is correct
30 Correct 4 ms 7504 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7248 KB Output is correct
2 Correct 49 ms 13756 KB Output is correct
3 Correct 52 ms 13640 KB Output is correct
4 Correct 54 ms 13596 KB Output is correct
5 Correct 55 ms 13660 KB Output is correct
6 Correct 54 ms 13704 KB Output is correct
7 Correct 59 ms 13696 KB Output is correct
8 Correct 2 ms 7504 KB Output is correct
9 Correct 2 ms 7264 KB Output is correct
10 Correct 2 ms 7504 KB Output is correct
11 Correct 2 ms 7504 KB Output is correct
12 Correct 2 ms 7504 KB Output is correct
13 Correct 2 ms 7344 KB Output is correct
14 Correct 3 ms 7504 KB Output is correct
15 Correct 3 ms 7368 KB Output is correct
16 Correct 3 ms 7504 KB Output is correct
17 Correct 3 ms 7504 KB Output is correct
18 Correct 3 ms 7504 KB Output is correct
19 Correct 3 ms 7548 KB Output is correct
20 Correct 3 ms 7504 KB Output is correct
21 Correct 3 ms 7504 KB Output is correct
22 Correct 4 ms 7524 KB Output is correct
23 Correct 4 ms 7504 KB Output is correct
24 Correct 4 ms 7504 KB Output is correct
25 Correct 4 ms 7600 KB Output is correct
26 Correct 4 ms 7504 KB Output is correct
27 Correct 4 ms 7760 KB Output is correct
28 Correct 4 ms 7504 KB Output is correct
29 Correct 3 ms 7504 KB Output is correct
30 Correct 3 ms 7580 KB Output is correct
31 Correct 3 ms 7504 KB Output is correct
32 Correct 4 ms 7504 KB Output is correct
33 Correct 3 ms 7676 KB Output is correct
34 Correct 3 ms 7504 KB Output is correct
35 Correct 4 ms 7620 KB Output is correct
36 Correct 4 ms 7504 KB Output is correct
37 Correct 5 ms 7504 KB Output is correct
38 Correct 4 ms 7504 KB Output is correct
39 Correct 81 ms 13640 KB Output is correct
40 Correct 64 ms 13648 KB Output is correct
41 Correct 83 ms 13640 KB Output is correct
42 Correct 72 ms 13796 KB Output is correct
43 Correct 70 ms 13620 KB Output is correct
44 Correct 69 ms 13716 KB Output is correct
45 Correct 74 ms 13640 KB Output is correct
46 Correct 72 ms 13640 KB Output is correct
47 Correct 69 ms 13700 KB Output is correct
48 Correct 71 ms 13640 KB Output is correct
49 Correct 91 ms 13768 KB Output is correct
50 Correct 77 ms 13652 KB Output is correct
51 Correct 87 ms 13640 KB Output is correct
52 Correct 146 ms 15560 KB Output is correct
53 Correct 133 ms 15552 KB Output is correct
54 Correct 125 ms 15544 KB Output is correct
55 Correct 141 ms 15552 KB Output is correct
56 Correct 188 ms 18876 KB Output is correct
57 Correct 184 ms 19000 KB Output is correct
58 Correct 234 ms 18876 KB Output is correct
59 Correct 243 ms 18876 KB Output is correct
60 Correct 162 ms 18876 KB Output is correct
61 Correct 200 ms 18844 KB Output is correct
62 Correct 161 ms 18876 KB Output is correct
63 Correct 172 ms 18884 KB Output is correct
64 Correct 202 ms 18888 KB Output is correct
65 Correct 187 ms 18848 KB Output is correct
66 Correct 194 ms 18876 KB Output is correct
67 Correct 206 ms 18880 KB Output is correct