oj.uz

답안 #1098028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098028 2024-10-08T20:11:20 Z vjudge1 Mecho (IOI09_mecho) C++17
100 / 100
 723 ms 11440 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef local
  #include "debug.hpp"
  #define pr(...) debug(#__VA_ARGS__, __VA_ARGS__)
  #define prs(...) debug_nameless(__VA_ARGS__)
#else
  #define pr(...) 69
  #define prs(...) 69
#endif

#define endl '\n'

const int inf = 1e9;
const long long binf = 1e18;

void solve(int tc){
  int n, s;
  cin >> n >> s;
  int st = -1, ed = -1;
  vector <int> bees;
  auto get_hash = [&](int i, int j){
    return n*i + j;
  };
  vector <string> grid(n);
  for(int i = 0; i < n; i++){
    cin >> grid[i];
    for(int j = 0; j < n; j++){
      int hash = get_hash(i, j);
      if(grid[i][j] == 'M') st = hash;
      if(grid[i][j] == 'D') ed = hash;
      if(grid[i][j] == 'H') bees.push_back(hash);
    }
  }
  assert(bees.size() > 0 && st != -1 && ed != -1);
  auto check = [&](long long t){
    vector <vector<long long>> bdist(n, vector<long long>(n, binf));
    queue <int> queue;
    for(int b : bees){
      queue.push(b);
      bdist[b/n][b%n] = 0;
    }
    auto inside = [&](int l, int c){
      return (min(l, c) >= 0 && max(l, c) < n && (grid[l][c] == 'G' || grid[l][c] == 'D' || grid[l][c] == 'M'));
    };
    while(queue.size() > 0){
      int node = queue.front();
      queue.pop();
      int l = node/n, c = node%n;
      for(int i = -1; i <= 1; i++){
        for(int j = -1; j <= 1; j++){
          if(i*j != 0) continue;
          int delta = (bdist[l][c] < t ? 1 : s);
          if(inside(l+i, c+j) && grid[l+i][c+j] != 'D' && bdist[l+i][c+j] > delta + bdist[l][c]){
            queue.push(get_hash(l+i, c+j));
            bdist[l+i][c+j] = delta + bdist[l][c];
          }
        }
      }
    }
    while(queue.size()) queue.pop();
    vector <vector<long long>> dist(n, vector<long long>(n, binf));
    dist[st/n][st%n] = t;
    if(bdist[st/n][st%n] <= dist[st/n][st%n]) return false;
    queue.push(st);
    while(queue.size() > 0){
      int node = queue.front();
      queue.pop();
      int l = node/n, c = node%n;
      for(int i = -1; i <= 1; i++){
        for(int j = -1; j <= 1; j++){
          if(i*j != 0) continue;
          if(inside(l+i, c+j) && bdist[l+i][c+j] > 1 + dist[l][c] && 1+dist[l][c] < dist[l+i][c+j]){
            queue.push(get_hash(l+i, c+j));
            dist[l+i][c+j] = 1 + dist[l][c];
          }
        }
      }
    }
    int l = ed/n, c = ed%n;
    for(int i = -1; i <= 1; i++){
      for(int j = -1; j <= 1; j++){
        if(i*j != 0) continue;
        if(inside(l+i, c+j) && dist[l+i][c+j] < bdist[l+i][c+j]){
          return true;
        }
      }
    }
    return false;
  };
  long long l, r = 1e9;
  long long ans = -1;
  while(l <= r){
    long long mid = (l + r)/2;
    if(check(mid)){
      l = mid+1;
      ans = mid;
    }else{
      r = mid-1;
    }
  }
  cout << ans << endl;
}  

signed main(){
  ios_base::sync_with_stdio(0); cin.tie(0);

  int tt = 1;
  while(tt--){
    prs(string(50, '-'));
    solve(tt);
    prs(string(50, '-'));
  }

  return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:10:20: warning: statement has no effect [-Wunused-value]
   10 |   #define prs(...) 69
      |                    ^~
mecho.cpp:111:5: note: in expansion of macro 'prs'
  111 |     prs(string(50, '-'));
      |     ^~~
mecho.cpp:10:20: warning: statement has no effect [-Wunused-value]
   10 |   #define prs(...) 69
      |                    ^~
mecho.cpp:113:5: note: in expansion of macro 'prs'
  113 |     prs(string(50, '-'));
      |     ^~~
mecho.cpp: In function 'void solve(int)':
mecho.cpp:95:24: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   95 |     long long mid = (l + r)/2;
      |                     ~~~^~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 626 ms 11248 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 55 ms 2580 KB Output is correct
34 Correct 56 ms 2560 KB Output is correct
35 Correct 87 ms 2536 KB Output is correct
36 Correct 89 ms 3188 KB Output is correct
37 Correct 84 ms 3216 KB Output is correct
38 Correct 125 ms 3176 KB Output is correct
39 Correct 89 ms 3892 KB Output is correct
40 Correct 89 ms 3928 KB Output is correct
41 Correct 157 ms 3920 KB Output is correct
42 Correct 112 ms 4700 KB Output is correct
43 Correct 111 ms 4720 KB Output is correct
44 Correct 218 ms 4680 KB Output is correct
45 Correct 133 ms 5592 KB Output is correct
46 Correct 132 ms 5572 KB Output is correct
47 Correct 242 ms 5560 KB Output is correct
48 Correct 163 ms 6604 KB Output is correct
49 Correct 170 ms 6580 KB Output is correct
50 Correct 286 ms 6564 KB Output is correct
51 Correct 189 ms 7620 KB Output is correct
52 Correct 194 ms 7608 KB Output is correct
53 Correct 336 ms 7588 KB Output is correct
54 Correct 228 ms 8732 KB Output is correct
55 Correct 230 ms 8740 KB Output is correct
56 Correct 394 ms 8720 KB Output is correct
57 Correct 256 ms 9952 KB Output is correct
58 Correct 243 ms 9976 KB Output is correct
59 Correct 457 ms 9932 KB Output is correct
60 Correct 291 ms 11252 KB Output is correct
61 Correct 294 ms 11236 KB Output is correct
62 Correct 537 ms 11224 KB Output is correct
63 Correct 662 ms 11216 KB Output is correct
64 Correct 723 ms 11224 KB Output is correct
65 Correct 713 ms 11212 KB Output is correct
66 Correct 674 ms 11376 KB Output is correct
67 Correct 624 ms 11228 KB Output is correct
68 Correct 669 ms 11232 KB Output is correct
69 Correct 649 ms 11240 KB Output is correct
70 Correct 628 ms 11252 KB Output is correct
71 Correct 624 ms 11232 KB Output is correct
72 Correct 675 ms 11240 KB Output is correct
73 Correct 613 ms 11416 KB Output is correct
74 Correct 618 ms 11440 KB Output is correct
75 Correct 643 ms 11372 KB Output is correct
76 Correct 618 ms 11264 KB Output is correct
77 Correct 631 ms 11276 KB Output is correct
78 Correct 577 ms 11268 KB Output is correct
79 Correct 597 ms 11268 KB Output is correct
80 Correct 586 ms 11252 KB Output is correct
81 Correct 606 ms 11280 KB Output is correct
82 Correct 606 ms 11268 KB Output is correct
83 Correct 639 ms 11260 KB Output is correct
84 Correct 636 ms 11276 KB Output is correct
85 Correct 630 ms 11284 KB Output is correct
86 Correct 637 ms 11296 KB Output is correct
87 Correct 634 ms 11256 KB Output is correct
88 Correct 630 ms 11204 KB Output is correct
89 Correct 629 ms 11248 KB Output is correct
90 Correct 629 ms 11252 KB Output is correct
91 Correct 632 ms 11256 KB Output is correct
92 Correct 631 ms 11272 KB Output is correct