oj.uz

답안 #583170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583170 2022-06-24T23:35:01 Z HeyYouNotYouYou Mecho (IOI09_mecho) C++14
22 / 100
 697 ms 16096 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 = 1 , r = n*n+1;
  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
22.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 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 547 ms 15548 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 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 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 2 ms 724 KB Output isn't correct
32 Correct 2 ms 724 KB Output is correct
33 Incorrect 38 ms 4324 KB Output isn't correct
34 Correct 35 ms 4308 KB Output is correct
35 Correct 60 ms 4324 KB Output is correct
36 Incorrect 47 ms 5384 KB Output isn't correct
37 Correct 47 ms 5308 KB Output is correct
38 Correct 86 ms 5204 KB Output is correct
39 Incorrect 70 ms 6228 KB Output isn't correct
40 Correct 58 ms 6264 KB Output is correct
41 Correct 101 ms 6228 KB Output is correct
42 Incorrect 88 ms 7328 KB Output isn't correct
43 Correct 91 ms 7328 KB Output is correct
44 Correct 132 ms 7336 KB Output is correct
45 Incorrect 96 ms 8460 KB Output isn't correct
46 Correct 116 ms 8460 KB Output is correct
47 Correct 221 ms 8476 KB Output is correct
48 Incorrect 109 ms 9676 KB Output isn't correct
49 Correct 134 ms 9668 KB Output is correct
50 Correct 296 ms 9692 KB Output is correct
51 Incorrect 138 ms 10864 KB Output isn't correct
52 Correct 153 ms 10996 KB Output is correct
53 Correct 333 ms 10976 KB Output is correct
54 Incorrect 176 ms 12340 KB Output isn't correct
55 Correct 193 ms 12236 KB Output is correct
56 Correct 365 ms 12348 KB Output is correct
57 Incorrect 223 ms 13788 KB Output isn't correct
58 Correct 197 ms 13788 KB Output is correct
59 Correct 483 ms 13796 KB Output is correct
60 Incorrect 218 ms 15436 KB Output isn't correct
61 Correct 235 ms 15312 KB Output is correct
62 Correct 514 ms 15436 KB Output is correct
63 Incorrect 581 ms 15336 KB Output isn't correct
64 Correct 617 ms 15308 KB Output is correct
65 Correct 549 ms 15336 KB Output is correct
66 Incorrect 565 ms 15372 KB Output isn't correct
67 Correct 543 ms 15332 KB Output is correct
68 Incorrect 541 ms 15384 KB Output isn't correct
69 Correct 555 ms 15388 KB Output is correct
70 Correct 579 ms 15472 KB Output is correct
71 Correct 569 ms 15444 KB Output is correct
72 Incorrect 580 ms 15384 KB Output isn't correct
73 Incorrect 549 ms 16044 KB Output isn't correct
74 Correct 591 ms 15936 KB Output is correct
75 Correct 697 ms 15940 KB Output is correct
76 Correct 607 ms 15936 KB Output is correct
77 Correct 659 ms 16096 KB Output is correct
78 Correct 521 ms 15976 KB Output is correct
79 Correct 505 ms 15984 KB Output is correct
80 Correct 470 ms 15848 KB Output is correct
81 Correct 642 ms 15852 KB Output is correct
82 Correct 555 ms 15900 KB Output is correct
83 Incorrect 458 ms 15692 KB Output isn't correct
84 Correct 601 ms 15776 KB Output is correct
85 Correct 519 ms 15780 KB Output is correct
86 Correct 535 ms 15720 KB Output is correct
87 Correct 586 ms 15820 KB Output is correct
88 Incorrect 543 ms 15656 KB Output isn't correct
89 Correct 533 ms 15604 KB Output is correct
90 Correct 563 ms 15664 KB Output is correct
91 Correct 555 ms 15656 KB Output is correct
92 Correct 516 ms 15656 KB Output is correct