oj.uz

Submission #583470

# Submission time Handle Problem Language Result Execution time Memory
583470 2022-06-25T11:41:16 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
84 / 100
 323 ms 21032 KB 
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 801,INF=1e12;
int n , o, srcx, srcy, destx, desty, ar[N][N],arr[N][N],arr2[N][N];
int dx[4]={0,-1,1,0};
int dy[4]={-1,0,0,1};
bool valid(int x, int y){
  if(x>=0 && x<n && y>=0 && y<n) return true;
  return false;
}

bool check(int mins)
{

 queue<pair<int,int>>qq;
  int vis[n][n];

  memset(vis,0,sizeof vis);
  memset(arr2,0,sizeof arr2);
  qq.push({srcx,srcy});
  vis[srcx][srcy]=1;
  if(arr[srcx][srcy]<=mins) return false;
  arr2[srcx][srcy]=0;
  while(!qq.empty()){
    int curx=qq.front().first;
    int cury=qq.front().second;
    qq.pop();
    for(int i = 0 ; i < 4; i ++)
    {
      int gox = curx+dx[i], goy = cury+dy[i];

      if(valid(gox,goy) && !vis[gox][goy] && ar[gox][goy]!=-1){
        if(arr[gox][goy] > floor((double)(arr2[curx][cury]+1)/(double)o)+mins){
        //  cout<<curx<<" "<<cury<<" "<<gox<<" "<<goy<<" "<<arr2[curx][cury]<<" "<<arr[gox][goy]-mins<<" "<<c<<" "<<arr2[curx][cury]+(c%o==0&&c>0)<<endl;
          vis[gox][goy]=1;
          arr2[gox][goy]=arr2[curx][cury]+1;
          if(gox==destx&&goy==desty) return true;
          qq.push({gox,goy});
        }
      }
    }
  }


  return false;
}

void bfs(){
  queue<pair<int,int>>q;
  int vis[n][n];
  memset(vis,0,sizeof vis);
  for(int i = 0 ; i < n ; i ++)
    for(int j = 0 ; j < n ; j ++)
      {
        if(ar[i][j]==1){
          q.push({i,j});
          vis[i][j]=1;
          arr[i][j]=0;
        }
      }

  while(!q.empty())
  {
    int curx=q.front().first;
    int cury=q.front().second;
    q.pop();
    for(int i = 0 ; i < 4; i ++)
    {
      int gox = curx+dx[i], goy = cury+dy[i];
      if(valid(gox,goy) && !vis[gox][goy] && !ar[gox][goy]){
        vis[gox][goy]=1;
        arr[gox][goy]=arr[curx][cury]+1;
        q.push({gox,goy});
      }
    }
  }

}


int32_t main()
{
  //freopen("abc.in", "r", stdin);
  cin >> n >> o;
  for(int i = 0 ; i < n ; i ++){
    for(int j = 0 ; j < n ; j ++){
      char x; cin >> x;
      arr[i][j]=1e9;
      ar[i][j] = (x=='H'?1:((x=='G'||x=='D'||x=='M')?0:-1));
      if(x=='M') srcx=i, srcy=j;
      if(x=='D') destx=i, desty=j;
    }
  }
  bfs();
  int l = 0 , r = 1e9;
  int ans=-1;
  while(l <= r)
  {
    int mid = l + (r - l) / 2;;
  //  cout<<mid<<endl;
    if(check(mid))
    {
      l = mid+1;
      ans=mid;
    }
    else
    {
      r = mid-1;
    }
  }
  cout<<ans<<endl;
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5332 KB Output is correct
2 Incorrect 7 ms 5360 KB Output isn't correct
3 Correct 7 ms 5372 KB Output is correct
4 Incorrect 7 ms 5352 KB Output isn't correct
5 Correct 8 ms 5388 KB Output is correct
6 Incorrect 8 ms 5332 KB Output isn't correct
7 Incorrect 179 ms 20464 KB Output isn't correct
8 Correct 9 ms 5460 KB Output is correct
9 Correct 8 ms 5452 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct
11 Correct 7 ms 5460 KB Output is correct
12 Incorrect 7 ms 5844 KB Output isn't correct
13 Correct 7 ms 5796 KB Output is correct
14 Correct 7 ms 5844 KB Output is correct
15 Correct 7 ms 5496 KB Output is correct
16 Correct 6 ms 5460 KB Output is correct
17 Correct 10 ms 5460 KB Output is correct
18 Correct 8 ms 5460 KB Output is correct
19 Correct 8 ms 5580 KB Output is correct
20 Correct 10 ms 5588 KB Output is correct
21 Correct 9 ms 5684 KB Output is correct
22 Correct 8 ms 5684 KB Output is correct
23 Correct 7 ms 5776 KB Output is correct
24 Correct 8 ms 5716 KB Output is correct
25 Correct 7 ms 5844 KB Output is correct
26 Correct 9 ms 5884 KB Output is correct
27 Correct 7 ms 5944 KB Output is correct
28 Correct 7 ms 5844 KB Output is correct
29 Correct 8 ms 6004 KB Output is correct
30 Correct 9 ms 6000 KB Output is correct
31 Correct 7 ms 5972 KB Output is correct
32 Correct 8 ms 5960 KB Output is correct
33 Correct 24 ms 10668 KB Output is correct
34 Correct 24 ms 10676 KB Output is correct
35 Correct 50 ms 10660 KB Output is correct
36 Correct 23 ms 11604 KB Output is correct
37 Correct 25 ms 11600 KB Output is correct
38 Correct 56 ms 11604 KB Output is correct
39 Correct 27 ms 12524 KB Output is correct
40 Correct 30 ms 12500 KB Output is correct
41 Correct 74 ms 12492 KB Output is correct
42 Correct 32 ms 13540 KB Output is correct
43 Correct 36 ms 13504 KB Output is correct
44 Correct 85 ms 13552 KB Output is correct
45 Correct 50 ms 14668 KB Output is correct
46 Correct 51 ms 14692 KB Output is correct
47 Correct 117 ms 14572 KB Output is correct
48 Correct 49 ms 15572 KB Output is correct
49 Correct 45 ms 15644 KB Output is correct
50 Correct 137 ms 15640 KB Output is correct
51 Correct 58 ms 16772 KB Output is correct
52 Correct 54 ms 16768 KB Output is correct
53 Correct 154 ms 16712 KB Output is correct
54 Correct 66 ms 17868 KB Output is correct
55 Correct 73 ms 17984 KB Output is correct
56 Correct 190 ms 17916 KB Output is correct
57 Correct 74 ms 19112 KB Output is correct
58 Correct 75 ms 19124 KB Output is correct
59 Correct 231 ms 19132 KB Output is correct
60 Correct 79 ms 20436 KB Output is correct
61 Correct 82 ms 20244 KB Output is correct
62 Correct 237 ms 20352 KB Output is correct
63 Correct 215 ms 20360 KB Output is correct
64 Correct 285 ms 20300 KB Output is correct
65 Correct 323 ms 20428 KB Output is correct
66 Correct 211 ms 20364 KB Output is correct
67 Correct 196 ms 20364 KB Output is correct
68 Correct 136 ms 20420 KB Output is correct
69 Correct 143 ms 20300 KB Output is correct
70 Correct 104 ms 20484 KB Output is correct
71 Correct 109 ms 20392 KB Output is correct
72 Correct 117 ms 20388 KB Output is correct
73 Correct 155 ms 20920 KB Output is correct
74 Correct 151 ms 20732 KB Output is correct
75 Correct 162 ms 20912 KB Output is correct
76 Correct 154 ms 21032 KB Output is correct
77 Correct 175 ms 20652 KB Output is correct
78 Correct 163 ms 20836 KB Output is correct
79 Correct 137 ms 20800 KB Output is correct
80 Correct 153 ms 20920 KB Output is correct
81 Correct 175 ms 20856 KB Output is correct
82 Correct 142 ms 20848 KB Output is correct
83 Correct 174 ms 20776 KB Output is correct
84 Correct 165 ms 20904 KB Output is correct
85 Correct 169 ms 20776 KB Output is correct
86 Correct 160 ms 20748 KB Output is correct
87 Correct 157 ms 20752 KB Output is correct
88 Correct 165 ms 20688 KB Output is correct
89 Correct 166 ms 20684 KB Output is correct
90 Correct 171 ms 20684 KB Output is correct
91 Correct 173 ms 20820 KB Output is correct
92 Correct 164 ms 20636 KB Output is correct