oj.uz

답안 #583172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583172 2022-06-25T00:18:08 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
30 / 100
 666 ms 21096 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];
  for(int i = 0 ; i < n ; i ++)
    for(int j = 0 ; j < n ; j ++)
      {
        arr[i][j]=ar[i][j]; arr2[i][j]=1;
        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});
      }
    }
  }

 queue<pair<pair<int,int>,int>>qq;
  memset(vis,0,sizeof vis);
  qq.push({{srcx,srcy},0});
  vis[srcx][srcy]=1;
  if(arr[srcx][srcy]<=mins) return false;
  arr[srcx][srcy]=1;
  while(!qq.empty()){
    int curx=qq.front().first.first;
    int cury=qq.front().first.second;
    int c = 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] && arr[gox][goy]!=-1){

        if(mins+arr2[curx][cury]+(c%o==0&&c>0) < arr[gox][goy]){
          vis[gox][goy]=1;
          if(c%o!=0||!c)
          arr2[gox][goy]=arr2[curx][cury];
          else
          arr2[gox][goy]=arr2[curx][cury]+1;
          qq.push({{gox,goy},c+1});
        }
      }
    }
  }


  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:91:7: warning: unused variable 'id' [-Wunused-variable]
   91 |   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 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Incorrect 467 ms 20532 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 0 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 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 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 2 ms 596 KB Output is correct
29 Incorrect 2 ms 724 KB Output isn't correct
30 Correct 2 ms 724 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 42 ms 5372 KB Output isn't correct
34 Correct 41 ms 5376 KB Output is correct
35 Correct 67 ms 5368 KB Output is correct
36 Incorrect 51 ms 6544 KB Output isn't correct
37 Correct 48 ms 6564 KB Output is correct
38 Correct 92 ms 6564 KB Output is correct
39 Incorrect 63 ms 7852 KB Output isn't correct
40 Correct 63 ms 7860 KB Output is correct
41 Correct 124 ms 7876 KB Output is correct
42 Incorrect 79 ms 9296 KB Output isn't correct
43 Correct 82 ms 9300 KB Output is correct
44 Correct 173 ms 9292 KB Output is correct
45 Incorrect 101 ms 10832 KB Output isn't correct
46 Correct 105 ms 10836 KB Output is correct
47 Correct 191 ms 10848 KB Output is correct
48 Incorrect 123 ms 12492 KB Output isn't correct
49 Correct 128 ms 12508 KB Output is correct
50 Correct 246 ms 12644 KB Output is correct
51 Incorrect 144 ms 14372 KB Output isn't correct
52 Correct 149 ms 14396 KB Output is correct
53 Correct 297 ms 14536 KB Output is correct
54 Incorrect 164 ms 16076 KB Output isn't correct
55 Correct 180 ms 16176 KB Output is correct
56 Correct 378 ms 16216 KB Output is correct
57 Incorrect 186 ms 18192 KB Output isn't correct
58 Correct 198 ms 18156 KB Output is correct
59 Correct 446 ms 18204 KB Output is correct
60 Incorrect 223 ms 20316 KB Output isn't correct
61 Correct 219 ms 20328 KB Output is correct
62 Correct 496 ms 20348 KB Output is correct
63 Correct 535 ms 20476 KB Output is correct
64 Correct 653 ms 20444 KB Output is correct
65 Correct 556 ms 20352 KB Output is correct
66 Incorrect 627 ms 20356 KB Output isn't correct
67 Correct 533 ms 20556 KB Output is correct
68 Correct 547 ms 20396 KB Output is correct
69 Correct 576 ms 20396 KB Output is correct
70 Correct 560 ms 20396 KB Output is correct
71 Correct 552 ms 20428 KB Output is correct
72 Incorrect 518 ms 20400 KB Output isn't correct
73 Incorrect 521 ms 21096 KB Output isn't correct
74 Correct 621 ms 20948 KB Output is correct
75 Correct 666 ms 20956 KB Output is correct
76 Correct 603 ms 20956 KB Output is correct
77 Correct 591 ms 21084 KB Output is correct
78 Correct 534 ms 20916 KB Output is correct
79 Correct 513 ms 20944 KB Output is correct
80 Correct 520 ms 20880 KB Output is correct
81 Correct 505 ms 20888 KB Output is correct
82 Correct 516 ms 20984 KB Output is correct
83 Correct 490 ms 20684 KB Output is correct
84 Correct 498 ms 20792 KB Output is correct
85 Correct 564 ms 20912 KB Output is correct
86 Correct 510 ms 20792 KB Output is correct
87 Correct 510 ms 20944 KB Output is correct
88 Correct 483 ms 20684 KB Output is correct
89 Correct 492 ms 20676 KB Output is correct
90 Correct 519 ms 20700 KB Output is correct
91 Correct 475 ms 20672 KB Output is correct
92 Correct 530 ms 20796 KB Output is correct