oj.uz

답안 #583443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583443 2022-06-25T11:20:26 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
84 / 100
 747 ms 21040 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;
    if(curx==destx&&cury==desty) return true;
    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;
          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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 612 ms 20676 KB Output isn't correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 596 KB Output isn't correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 3 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 1 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 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 40 ms 5348 KB Output is correct
34 Correct 45 ms 5356 KB Output is correct
35 Correct 78 ms 5352 KB Output is correct
36 Correct 52 ms 6504 KB Output is correct
37 Correct 55 ms 6544 KB Output is correct
38 Correct 102 ms 6604 KB Output is correct
39 Correct 70 ms 7884 KB Output is correct
40 Correct 71 ms 7856 KB Output is correct
41 Correct 145 ms 7872 KB Output is correct
42 Correct 81 ms 9284 KB Output is correct
43 Correct 82 ms 9300 KB Output is correct
44 Correct 193 ms 9300 KB Output is correct
45 Correct 112 ms 10888 KB Output is correct
46 Correct 121 ms 10836 KB Output is correct
47 Correct 248 ms 10844 KB Output is correct
48 Correct 140 ms 12620 KB Output is correct
49 Correct 146 ms 12492 KB Output is correct
50 Correct 296 ms 12504 KB Output is correct
51 Correct 156 ms 14168 KB Output is correct
52 Correct 169 ms 14272 KB Output is correct
53 Correct 377 ms 14180 KB Output is correct
54 Correct 172 ms 16232 KB Output is correct
55 Correct 211 ms 16212 KB Output is correct
56 Correct 460 ms 16184 KB Output is correct
57 Correct 207 ms 18076 KB Output is correct
58 Correct 219 ms 18200 KB Output is correct
59 Correct 538 ms 18204 KB Output is correct
60 Correct 247 ms 20300 KB Output is correct
61 Correct 231 ms 20316 KB Output is correct
62 Correct 683 ms 20340 KB Output is correct
63 Correct 617 ms 20328 KB Output is correct
64 Correct 715 ms 20424 KB Output is correct
65 Correct 613 ms 20240 KB Output is correct
66 Correct 589 ms 20324 KB Output is correct
67 Correct 562 ms 20260 KB Output is correct
68 Correct 636 ms 20380 KB Output is correct
69 Correct 649 ms 20392 KB Output is correct
70 Correct 623 ms 20456 KB Output is correct
71 Correct 661 ms 20384 KB Output is correct
72 Correct 576 ms 20300 KB Output is correct
73 Correct 661 ms 20804 KB Output is correct
74 Correct 726 ms 21016 KB Output is correct
75 Correct 742 ms 20988 KB Output is correct
76 Correct 747 ms 20884 KB Output is correct
77 Correct 719 ms 21040 KB Output is correct
78 Correct 635 ms 20908 KB Output is correct
79 Correct 552 ms 20832 KB Output is correct
80 Correct 606 ms 20824 KB Output is correct
81 Correct 579 ms 20824 KB Output is correct
82 Correct 640 ms 20964 KB Output is correct
83 Correct 597 ms 20756 KB Output is correct
84 Correct 602 ms 20756 KB Output is correct
85 Correct 654 ms 20748 KB Output is correct
86 Correct 632 ms 20828 KB Output is correct
87 Correct 572 ms 20752 KB Output is correct
88 Correct 613 ms 20556 KB Output is correct
89 Correct 580 ms 20700 KB Output is correct
90 Correct 559 ms 20684 KB Output is correct
91 Correct 621 ms 20652 KB Output is correct
92 Correct 628 ms 20648 KB Output is correct