oj.uz

답안 #583152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583152 2022-06-24T22:47:30 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
30 / 100
 736 ms 16180 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];
  for(int i = 0 ; i < n ; i ++)
    for(int j = 0 ; j < n ; j ++)
      {
        arr[i][j]=ar[i][j];
        if(arr[i][j]==1) hives.push_back({i,j});
      }
  queue<pair<int,int>>q;
  int vis[n][n];
  memset(vis,0,sizeof vis);
  for(auto e : hives){
    q.push({e.first,e.second});
    vis[e.first][e.second]=1;
  }

  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] && !arr[gox][goy]){
        vis[gox][goy]=1;
        arr[gox][goy]=arr[curx][cury]+1;
        q.push({gox,goy});
      }
    }
  }

  memset(vis,0,sizeof vis);
  q.push({srcx,srcy});
  vis[srcx][srcy]=1;
  arr[srcx][srcy]=1;
  while(!q.empty()){
    int curx=q.front().first;
    int cury=q.front().second;
    if(curx==destx&&cury==desty) return true;
    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] && arr[gox][goy]!=-1){
        if(mins+(((arr[curx][cury])-1)/o)+1 < arr[gox][goy]){

          vis[gox][goy]=1;
          arr[gox][goy]=arr[curx][cury]+1;
          q.push({gox,goy});
        }
      }
    }
  }


  return false;
}
int32_t main()
{
  //freopen("abc.in", "r", stdin);
  cin >> n >> o;
  int id[n][n];
  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;
    if(check(mid))
    {
      l = mid+1;
      ans=mid;
    }
    else
    {
      r = mid-1;
    }
  }
  cout<<ans<<endl;
}

Compilation message

mecho.cpp: In function 'int32_t main()':
mecho.cpp:85:7: warning: unused variable 'id' [-Wunused-variable]
   85 |   int id[n][n];
      |       ^~

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 515 ms 15548 KB Output isn't correct
8 Incorrect 1 ms 340 KB Output isn't 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 Incorrect 2 ms 468 KB Output isn't correct
14 Correct 2 ms 596 KB Output is correct
15 Incorrect 1 ms 340 KB Output isn't correct
16 Correct 1 ms 340 KB Output is correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Correct 1 ms 340 KB Output is correct
19 Incorrect 0 ms 340 KB Output isn't correct
20 Correct 1 ms 340 KB Output is correct
21 Incorrect 1 ms 468 KB Output isn't correct
22 Correct 1 ms 468 KB Output is correct
23 Incorrect 1 ms 468 KB Output isn't correct
24 Correct 1 ms 468 KB Output is correct
25 Incorrect 2 ms 596 KB Output isn't correct
26 Correct 2 ms 596 KB Output is correct
27 Incorrect 1 ms 596 KB Output isn't correct
28 Correct 2 ms 596 KB Output is correct
29 Incorrect 2 ms 596 KB Output isn't correct
30 Correct 2 ms 596 KB Output is correct
31 Incorrect 3 ms 732 KB Output isn't correct
32 Correct 2 ms 724 KB Output is correct
33 Incorrect 39 ms 4308 KB Output isn't correct
34 Correct 39 ms 4308 KB Output is correct
35 Correct 74 ms 4400 KB Output is correct
36 Incorrect 52 ms 5204 KB Output isn't correct
37 Correct 48 ms 5204 KB Output is correct
38 Correct 84 ms 5300 KB Output is correct
39 Incorrect 65 ms 6160 KB Output isn't correct
40 Correct 63 ms 6272 KB Output is correct
41 Correct 138 ms 6284 KB Output is correct
42 Incorrect 84 ms 7328 KB Output isn't correct
43 Correct 86 ms 7452 KB Output is correct
44 Correct 154 ms 7340 KB Output is correct
45 Incorrect 105 ms 8408 KB Output isn't correct
46 Correct 112 ms 8548 KB Output is correct
47 Correct 176 ms 8476 KB Output is correct
48 Incorrect 125 ms 9672 KB Output isn't correct
49 Correct 140 ms 9676 KB Output is correct
50 Correct 230 ms 9692 KB Output is correct
51 Incorrect 151 ms 11064 KB Output isn't correct
52 Correct 177 ms 10964 KB Output is correct
53 Correct 321 ms 10980 KB Output is correct
54 Incorrect 181 ms 12336 KB Output isn't correct
55 Correct 210 ms 12236 KB Output is correct
56 Correct 371 ms 12360 KB Output is correct
57 Incorrect 211 ms 13788 KB Output isn't correct
58 Correct 194 ms 13780 KB Output is correct
59 Correct 469 ms 13804 KB Output is correct
60 Incorrect 234 ms 15312 KB Output isn't correct
61 Correct 211 ms 15308 KB Output is correct
62 Correct 545 ms 15332 KB Output is correct
63 Correct 523 ms 15336 KB Output is correct
64 Correct 703 ms 15356 KB Output is correct
65 Correct 556 ms 15336 KB Output is correct
66 Incorrect 601 ms 15336 KB Output isn't correct
67 Correct 541 ms 15336 KB Output is correct
68 Correct 551 ms 15384 KB Output is correct
69 Correct 576 ms 15512 KB Output is correct
70 Correct 558 ms 15480 KB Output is correct
71 Correct 596 ms 15492 KB Output is correct
72 Incorrect 570 ms 15376 KB Output isn't correct
73 Incorrect 547 ms 15940 KB Output isn't correct
74 Correct 708 ms 15952 KB Output is correct
75 Correct 594 ms 15972 KB Output is correct
76 Correct 736 ms 15940 KB Output is correct
77 Correct 715 ms 16180 KB Output is correct
78 Correct 619 ms 15852 KB Output is correct
79 Correct 591 ms 15988 KB Output is correct
80 Correct 576 ms 15948 KB Output is correct
81 Correct 593 ms 15900 KB Output is correct
82 Correct 499 ms 15980 KB Output is correct
83 Correct 534 ms 15784 KB Output is correct
84 Correct 567 ms 15788 KB Output is correct
85 Correct 555 ms 15776 KB Output is correct
86 Correct 613 ms 15776 KB Output is correct
87 Correct 548 ms 15836 KB Output is correct
88 Correct 629 ms 15664 KB Output is correct
89 Correct 580 ms 15684 KB Output is correct
90 Correct 489 ms 15660 KB Output is correct
91 Correct 559 ms 15664 KB Output is correct
92 Correct 620 ms 15740 KB Output is correct