oj.uz

답안 #583167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583167 2022-06-24T23:22:11 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
30 / 100
 618 ms 16168 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});
  if(arr[srcx][srcy]<=mins) return false;
  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:86:7: warning: unused variable 'id' [-Wunused-variable]
   86 |   int id[n][n];
      |       ^~

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 442 ms 15548 KB Output isn't correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 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 Incorrect 2 ms 468 KB Output isn't correct
14 Correct 2 ms 596 KB Output is correct
15 Incorrect 0 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 1 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 1 ms 596 KB Output isn't correct
26 Correct 1 ms 596 KB Output is correct
27 Incorrect 2 ms 596 KB Output isn't correct
28 Correct 1 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 2 ms 724 KB Output isn't correct
32 Correct 2 ms 724 KB Output is correct
33 Incorrect 39 ms 4392 KB Output isn't correct
34 Correct 38 ms 4396 KB Output is correct
35 Correct 58 ms 4396 KB Output is correct
36 Incorrect 45 ms 5204 KB Output isn't correct
37 Correct 50 ms 5236 KB Output is correct
38 Correct 80 ms 5300 KB Output is correct
39 Incorrect 63 ms 6228 KB Output isn't correct
40 Correct 64 ms 6228 KB Output is correct
41 Correct 113 ms 6280 KB Output is correct
42 Incorrect 78 ms 7328 KB Output isn't correct
43 Correct 74 ms 7252 KB Output is correct
44 Correct 134 ms 7380 KB Output is correct
45 Incorrect 100 ms 8464 KB Output isn't correct
46 Correct 89 ms 8408 KB Output is correct
47 Correct 163 ms 8488 KB Output is correct
48 Incorrect 114 ms 9688 KB Output isn't correct
49 Correct 115 ms 9684 KB Output is correct
50 Correct 205 ms 9816 KB Output is correct
51 Incorrect 135 ms 10968 KB Output isn't correct
52 Correct 146 ms 10964 KB Output is correct
53 Correct 265 ms 10980 KB Output is correct
54 Incorrect 161 ms 12340 KB Output isn't correct
55 Correct 175 ms 12336 KB Output is correct
56 Correct 328 ms 12236 KB Output is correct
57 Incorrect 180 ms 13788 KB Output isn't correct
58 Correct 187 ms 13780 KB Output is correct
59 Correct 416 ms 13772 KB Output is correct
60 Incorrect 215 ms 15312 KB Output isn't correct
61 Correct 216 ms 15312 KB Output is correct
62 Correct 497 ms 15328 KB Output is correct
63 Correct 528 ms 15336 KB Output is correct
64 Correct 613 ms 15336 KB Output is correct
65 Correct 540 ms 15336 KB Output is correct
66 Incorrect 556 ms 15336 KB Output isn't correct
67 Correct 514 ms 15340 KB Output is correct
68 Correct 533 ms 15500 KB Output is correct
69 Correct 588 ms 15512 KB Output is correct
70 Correct 551 ms 15408 KB Output is correct
71 Correct 537 ms 15420 KB Output is correct
72 Incorrect 522 ms 15384 KB Output isn't correct
73 Incorrect 577 ms 16044 KB Output isn't correct
74 Correct 579 ms 15948 KB Output is correct
75 Correct 576 ms 16168 KB Output is correct
76 Correct 618 ms 15936 KB Output is correct
77 Correct 542 ms 16164 KB Output is correct
78 Correct 484 ms 15820 KB Output is correct
79 Correct 477 ms 15856 KB Output is correct
80 Correct 498 ms 15984 KB Output is correct
81 Correct 474 ms 15856 KB Output is correct
82 Correct 460 ms 15848 KB Output is correct
83 Correct 458 ms 15776 KB Output is correct
84 Correct 478 ms 15776 KB Output is correct
85 Correct 487 ms 15872 KB Output is correct
86 Correct 501 ms 15776 KB Output is correct
87 Correct 481 ms 15832 KB Output is correct
88 Correct 458 ms 15652 KB Output is correct
89 Correct 477 ms 15716 KB Output is correct
90 Correct 463 ms 15712 KB Output is correct
91 Correct 531 ms 15664 KB Output is correct
92 Correct 490 ms 15612 KB Output is correct