oj.uz

답안 #1098004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098004 2024-10-08T19:31:26 Z vjudge1 Mecho (IOI09_mecho) C++17
53 / 100
 154 ms 6456 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);
  vector <vector<int>> bdist(n, vector<int>(n, inf));
  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'));
  };
  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) && grid[l+i][c+j] != 'D' && bdist[l+i][c+j] > s + bdist[l][c]){
          queue.push(get_hash(l+i, c+j));
          bdist[l+i][c+j] = s + bdist[l][c];
        }
      }
    }
  }
  auto check = [&](int t){
    while(queue.size()) queue.pop();
    vector <vector<int>> dist(n, vector<int>(n, inf));
    dist[st/n][st%n] = s*t;
    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;
  };
  int l = 0, r = 1e3;
  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;
}  

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:109:5: note: in expansion of macro 'prs'
  109 |     prs(string(50, '-'));
      |     ^~~
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, '-'));
      |     ^~~

Subtask #1
53.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 88 ms 6256 KB Output is correct
8 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Correct 0 ms 348 KB Output is correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Correct 1 ms 348 KB Output is correct
27 Incorrect 0 ms 348 KB Output isn't correct
28 Correct 1 ms 348 KB Output is correct
29 Incorrect 1 ms 348 KB Output isn't correct
30 Incorrect 1 ms 348 KB Output isn't correct
31 Incorrect 2 ms 348 KB Output isn't correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Incorrect 10 ms 1560 KB Output isn't correct
34 Incorrect 15 ms 1576 KB Output isn't correct
35 Correct 21 ms 1556 KB Output is correct
36 Incorrect 12 ms 1792 KB Output isn't correct
37 Incorrect 21 ms 1884 KB Output isn't correct
38 Correct 26 ms 1880 KB Output is correct
39 Incorrect 25 ms 2252 KB Output isn't correct
40 Incorrect 36 ms 2308 KB Output isn't correct
41 Correct 34 ms 2260 KB Output is correct
42 Incorrect 19 ms 2740 KB Output isn't correct
43 Incorrect 33 ms 2728 KB Output isn't correct
44 Correct 43 ms 2732 KB Output is correct
45 Incorrect 34 ms 3180 KB Output isn't correct
46 Incorrect 40 ms 3176 KB Output isn't correct
47 Correct 59 ms 3212 KB Output is correct
48 Incorrect 29 ms 3720 KB Output isn't correct
49 Incorrect 46 ms 3696 KB Output isn't correct
50 Correct 64 ms 3712 KB Output is correct
51 Incorrect 56 ms 4188 KB Output isn't correct
52 Incorrect 53 ms 4188 KB Output isn't correct
53 Correct 77 ms 4268 KB Output is correct
54 Incorrect 37 ms 4888 KB Output isn't correct
55 Incorrect 67 ms 4848 KB Output isn't correct
56 Correct 87 ms 4852 KB Output is correct
57 Incorrect 42 ms 5536 KB Output isn't correct
58 Incorrect 91 ms 5508 KB Output isn't correct
59 Correct 105 ms 5516 KB Output is correct
60 Incorrect 54 ms 6216 KB Output isn't correct
61 Incorrect 79 ms 6228 KB Output isn't correct
62 Correct 117 ms 6232 KB Output is correct
63 Correct 94 ms 6180 KB Output is correct
64 Correct 154 ms 6180 KB Output is correct
65 Correct 137 ms 6212 KB Output is correct
66 Correct 122 ms 6188 KB Output is correct
67 Correct 92 ms 6180 KB Output is correct
68 Correct 43 ms 6232 KB Output is correct
69 Correct 39 ms 6456 KB Output is correct
70 Correct 38 ms 6236 KB Output is correct
71 Correct 32 ms 6244 KB Output is correct
72 Incorrect 36 ms 6196 KB Output isn't correct
73 Incorrect 64 ms 6228 KB Output isn't correct
74 Correct 59 ms 6200 KB Output is correct
75 Correct 65 ms 6244 KB Output is correct
76 Correct 62 ms 6248 KB Output is correct
77 Correct 58 ms 6244 KB Output is correct
78 Correct 66 ms 6236 KB Output is correct
79 Correct 51 ms 6232 KB Output is correct
80 Correct 57 ms 6260 KB Output is correct
81 Correct 66 ms 6236 KB Output is correct
82 Correct 63 ms 6224 KB Output is correct
83 Correct 80 ms 6256 KB Output is correct
84 Correct 74 ms 6248 KB Output is correct
85 Correct 70 ms 6252 KB Output is correct
86 Correct 74 ms 6256 KB Output is correct
87 Correct 72 ms 6244 KB Output is correct
88 Correct 81 ms 6216 KB Output is correct
89 Correct 84 ms 6236 KB Output is correct
90 Correct 84 ms 6244 KB Output is correct
91 Correct 80 ms 6216 KB Output is correct
92 Correct 78 ms 6236 KB Output is correct