oj.uz

Submission #583452

# Submission time Handle Problem Language Result Execution time Memory
583452 2022-06-25T11:28:07 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
84 / 100
 871 ms 20896 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];
int dx[4]={0,-1,1,0};
int dy[4]={-1,0,0,1};
struct node{
  int x, y, dist;
};
bool valid1(int x, int y){
  if(x>=0 && x<n && y>=0 && y<n && (x!=srcx || y!=srcy) && (x!=destx || y!=desty)) return true;
  return false;
}
bool valid(int x, int y){
  if(x>=0 && x<n && y>=0 && y<n) return true;
  return false;
}
bool check(int mins)
{
  vector<pair<int,int>>hives;
  int arr[n][n],arr2[n][n];
  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});
      }
    }
  }

 queue<pair<int,int>>qq;
  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;
}
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;
      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;
    }
  }
  int l = 0 , r = n*n;
  int ans=-1;
  while(l <= r)
  {
    int mid = (l+r)/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 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Correct 0 ms 224 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 588 ms 20552 KB Output isn't correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 1 ms 596 KB Output isn't correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 436 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 39 ms 5332 KB Output is correct
34 Correct 38 ms 5332 KB Output is correct
35 Correct 67 ms 5360 KB Output is correct
36 Correct 50 ms 6544 KB Output is correct
37 Correct 52 ms 6544 KB Output is correct
38 Correct 90 ms 6484 KB Output is correct
39 Correct 60 ms 7848 KB Output is correct
40 Correct 66 ms 7764 KB Output is correct
41 Correct 126 ms 7884 KB Output is correct
42 Correct 84 ms 9288 KB Output is correct
43 Correct 84 ms 9300 KB Output is correct
44 Correct 177 ms 9316 KB Output is correct
45 Correct 102 ms 10836 KB Output is correct
46 Correct 101 ms 10780 KB Output is correct
47 Correct 274 ms 10844 KB Output is correct
48 Correct 122 ms 12500 KB Output is correct
49 Correct 129 ms 12488 KB Output is correct
50 Correct 285 ms 12568 KB Output is correct
51 Correct 143 ms 14164 KB Output is correct
52 Correct 153 ms 14284 KB Output is correct
53 Correct 368 ms 14376 KB Output is correct
54 Correct 170 ms 16068 KB Output is correct
55 Correct 182 ms 16176 KB Output is correct
56 Correct 427 ms 16192 KB Output is correct
57 Correct 194 ms 18128 KB Output is correct
58 Correct 204 ms 18072 KB Output is correct
59 Correct 513 ms 18208 KB Output is correct
60 Correct 228 ms 20324 KB Output is correct
61 Correct 237 ms 20444 KB Output is correct
62 Correct 599 ms 20468 KB Output is correct
63 Correct 573 ms 20304 KB Output is correct
64 Correct 679 ms 20368 KB Output is correct
65 Correct 602 ms 20404 KB Output is correct
66 Correct 598 ms 20328 KB Output is correct
67 Correct 553 ms 20408 KB Output is correct
68 Correct 587 ms 20508 KB Output is correct
69 Correct 606 ms 20500 KB Output is correct
70 Correct 585 ms 20388 KB Output is correct
71 Correct 647 ms 20380 KB Output is correct
72 Correct 561 ms 20428 KB Output is correct
73 Correct 687 ms 20884 KB Output is correct
74 Correct 734 ms 20884 KB Output is correct
75 Correct 731 ms 20876 KB Output is correct
76 Correct 744 ms 20896 KB Output is correct
77 Correct 804 ms 20884 KB Output is correct
78 Correct 756 ms 20832 KB Output is correct
79 Correct 648 ms 20840 KB Output is correct
80 Correct 871 ms 20832 KB Output is correct
81 Correct 692 ms 20828 KB Output is correct
82 Correct 730 ms 20828 KB Output is correct
83 Correct 686 ms 20860 KB Output is correct
84 Correct 820 ms 20756 KB Output is correct
85 Correct 782 ms 20868 KB Output is correct
86 Correct 626 ms 20748 KB Output is correct
87 Correct 750 ms 20788 KB Output is correct
88 Correct 602 ms 20724 KB Output is correct
89 Correct 665 ms 20648 KB Output is correct
90 Correct 697 ms 20652 KB Output is correct
91 Correct 748 ms 20708 KB Output is correct
92 Correct 727 ms 20684 KB Output is correct