oj.uz

답안 #583453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583453 2022-06-25T11:28:29 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
84 / 100
 769 ms 21112 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 - 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Incorrect 612 ms 20556 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 1 ms 340 KB Output is correct
12 Incorrect 2 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 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 3 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 42 ms 5352 KB Output is correct
34 Correct 38 ms 5332 KB Output is correct
35 Correct 94 ms 5360 KB Output is correct
36 Correct 54 ms 6544 KB Output is correct
37 Correct 55 ms 6556 KB Output is correct
38 Correct 100 ms 6552 KB Output is correct
39 Correct 78 ms 7856 KB Output is correct
40 Correct 77 ms 7784 KB Output is correct
41 Correct 138 ms 7872 KB Output is correct
42 Correct 93 ms 9280 KB Output is correct
43 Correct 86 ms 9300 KB Output is correct
44 Correct 204 ms 9296 KB Output is correct
45 Correct 145 ms 10828 KB Output is correct
46 Correct 125 ms 10836 KB Output is correct
47 Correct 240 ms 10948 KB Output is correct
48 Correct 131 ms 12436 KB Output is correct
49 Correct 165 ms 12388 KB Output is correct
50 Correct 322 ms 12512 KB Output is correct
51 Correct 162 ms 14272 KB Output is correct
52 Correct 160 ms 14284 KB Output is correct
53 Correct 396 ms 14292 KB Output is correct
54 Correct 181 ms 16176 KB Output is correct
55 Correct 198 ms 16168 KB Output is correct
56 Correct 484 ms 16188 KB Output is correct
57 Correct 204 ms 18188 KB Output is correct
58 Correct 224 ms 18260 KB Output is correct
59 Correct 539 ms 18112 KB Output is correct
60 Correct 255 ms 20324 KB Output is correct
61 Correct 246 ms 20408 KB Output is correct
62 Correct 665 ms 20232 KB Output is correct
63 Correct 636 ms 20328 KB Output is correct
64 Correct 748 ms 20332 KB Output is correct
65 Correct 636 ms 20332 KB Output is correct
66 Correct 591 ms 20328 KB Output is correct
67 Correct 563 ms 20332 KB Output is correct
68 Correct 587 ms 20392 KB Output is correct
69 Correct 610 ms 20392 KB Output is correct
70 Correct 580 ms 20392 KB Output is correct
71 Correct 628 ms 20428 KB Output is correct
72 Correct 563 ms 20388 KB Output is correct
73 Correct 667 ms 21008 KB Output is correct
74 Correct 673 ms 21112 KB Output is correct
75 Correct 769 ms 20952 KB Output is correct
76 Correct 684 ms 21048 KB Output is correct
77 Correct 707 ms 20880 KB Output is correct
78 Correct 608 ms 20832 KB Output is correct
79 Correct 584 ms 20976 KB Output is correct
80 Correct 624 ms 20936 KB Output is correct
81 Correct 594 ms 20988 KB Output is correct
82 Correct 590 ms 20964 KB Output is correct
83 Correct 592 ms 20868 KB Output is correct
84 Correct 599 ms 20684 KB Output is correct
85 Correct 622 ms 20864 KB Output is correct
86 Correct 588 ms 20924 KB Output is correct
87 Correct 610 ms 20880 KB Output is correct
88 Correct 572 ms 20792 KB Output is correct
89 Correct 570 ms 20760 KB Output is correct
90 Correct 591 ms 20656 KB Output is correct
91 Correct 585 ms 20640 KB Output is correct
92 Correct 678 ms 20648 KB Output is correct