oj.uz

답안 #583456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583456 2022-06-25T11:30:33 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
74 / 100
 1000 ms 21128 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 = 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
74.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 1 ms 212 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Incorrect 826 ms 20556 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 2 ms 596 KB Output isn't correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 4 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 468 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 3 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 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 61 ms 5296 KB Output is correct
34 Correct 61 ms 5332 KB Output is correct
35 Correct 109 ms 5332 KB Output is correct
36 Correct 83 ms 6588 KB Output is correct
37 Correct 84 ms 6540 KB Output is correct
38 Correct 164 ms 6556 KB Output is correct
39 Correct 103 ms 7856 KB Output is correct
40 Correct 106 ms 7764 KB Output is correct
41 Correct 176 ms 7764 KB Output is correct
42 Correct 128 ms 9200 KB Output is correct
43 Correct 124 ms 9300 KB Output is correct
44 Correct 314 ms 9308 KB Output is correct
45 Correct 153 ms 10824 KB Output is correct
46 Correct 155 ms 10832 KB Output is correct
47 Correct 324 ms 10864 KB Output is correct
48 Correct 185 ms 12500 KB Output is correct
49 Correct 183 ms 12488 KB Output is correct
50 Correct 452 ms 12508 KB Output is correct
51 Correct 217 ms 14276 KB Output is correct
52 Correct 230 ms 14192 KB Output is correct
53 Correct 557 ms 14292 KB Output is correct
54 Correct 246 ms 16228 KB Output is correct
55 Correct 266 ms 16176 KB Output is correct
56 Correct 651 ms 16184 KB Output is correct
57 Correct 293 ms 18184 KB Output is correct
58 Correct 307 ms 18192 KB Output is correct
59 Correct 825 ms 18208 KB Output is correct
60 Correct 337 ms 20320 KB Output is correct
61 Correct 369 ms 20320 KB Output is correct
62 Correct 875 ms 20464 KB Output is correct
63 Correct 826 ms 20332 KB Output is correct
64 Correct 881 ms 20328 KB Output is correct
65 Correct 957 ms 20332 KB Output is correct
66 Correct 831 ms 20328 KB Output is correct
67 Correct 767 ms 20328 KB Output is correct
68 Correct 958 ms 20384 KB Output is correct
69 Correct 938 ms 20384 KB Output is correct
70 Correct 896 ms 20388 KB Output is correct
71 Correct 934 ms 20512 KB Output is correct
72 Correct 922 ms 20408 KB Output is correct
73 Execution timed out 1093 ms 20888 KB Time limit exceeded
74 Execution timed out 1047 ms 21012 KB Time limit exceeded
75 Execution timed out 1075 ms 21128 KB Time limit exceeded
76 Execution timed out 1090 ms 20988 KB Time limit exceeded
77 Execution timed out 1073 ms 20952 KB Time limit exceeded
78 Correct 855 ms 20836 KB Output is correct
79 Correct 935 ms 20860 KB Output is correct
80 Correct 847 ms 20828 KB Output is correct
81 Correct 896 ms 20960 KB Output is correct
82 Correct 911 ms 20828 KB Output is correct
83 Correct 837 ms 20876 KB Output is correct
84 Correct 905 ms 20748 KB Output is correct
85 Correct 966 ms 20748 KB Output is correct
86 Correct 947 ms 20836 KB Output is correct
87 Correct 890 ms 20788 KB Output is correct
88 Correct 956 ms 20652 KB Output is correct
89 Execution timed out 1060 ms 20632 KB Time limit exceeded
90 Correct 881 ms 20648 KB Output is correct
91 Correct 975 ms 20776 KB Output is correct
92 Correct 844 ms 20788 KB Output is correct