oj.uz

Submission #1098030

# Submission time Handle Problem Language Result Execution time Memory
1098030 2024-10-08T20:14:22 Z sexo69696969 Mecho (IOI09_mecho) C++14
100 / 100
 148 ms 6524 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' || 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;
        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;
    if(dist[st/n][st%n] >= bdist[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;
  };
  int l = 0, r = 1e6;
  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:110:5: note: in expansion of macro 'prs'
  110 |     prs(string(50, '-'));
      |     ^~~
mecho.cpp:10:20: warning: statement has no effect [-Wunused-value]
   10 |   #define prs(...) 69
      |                    ^~
mecho.cpp:112:5: note: in expansion of macro 'prs'
  112 |     prs(string(50, '-'));
      |     ^~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 83 ms 6296 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 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 7 ms 1572 KB Output is correct
34 Correct 6 ms 1568 KB Output is correct
35 Correct 20 ms 1620 KB Output is correct
36 Correct 6 ms 1884 KB Output is correct
37 Correct 6 ms 1884 KB Output is correct
38 Correct 26 ms 1884 KB Output is correct
39 Correct 7 ms 2276 KB Output is correct
40 Correct 8 ms 2276 KB Output is correct
41 Correct 32 ms 2344 KB Output is correct
42 Correct 10 ms 2732 KB Output is correct
43 Correct 11 ms 2700 KB Output is correct
44 Correct 43 ms 2720 KB Output is correct
45 Correct 11 ms 3212 KB Output is correct
46 Correct 11 ms 3212 KB Output is correct
47 Correct 67 ms 3180 KB Output is correct
48 Correct 13 ms 3712 KB Output is correct
49 Correct 15 ms 3708 KB Output is correct
50 Correct 85 ms 3736 KB Output is correct
51 Correct 20 ms 4184 KB Output is correct
52 Correct 16 ms 4324 KB Output is correct
53 Correct 75 ms 4312 KB Output is correct
54 Correct 18 ms 4924 KB Output is correct
55 Correct 21 ms 4924 KB Output is correct
56 Correct 87 ms 4924 KB Output is correct
57 Correct 20 ms 5576 KB Output is correct
58 Correct 20 ms 5580 KB Output is correct
59 Correct 99 ms 5528 KB Output is correct
60 Correct 22 ms 6268 KB Output is correct
61 Correct 22 ms 6292 KB Output is correct
62 Correct 116 ms 6224 KB Output is correct
63 Correct 95 ms 6260 KB Output is correct
64 Correct 148 ms 6248 KB Output is correct
65 Correct 143 ms 6212 KB Output is correct
66 Correct 123 ms 6228 KB Output is correct
67 Correct 98 ms 6236 KB Output is correct
68 Correct 49 ms 6280 KB Output is correct
69 Correct 61 ms 6260 KB Output is correct
70 Correct 44 ms 6272 KB Output is correct
71 Correct 37 ms 6264 KB Output is correct
72 Correct 34 ms 6264 KB Output is correct
73 Correct 41 ms 6360 KB Output is correct
74 Correct 60 ms 6268 KB Output is correct
75 Correct 66 ms 6284 KB Output is correct
76 Correct 63 ms 6304 KB Output is correct
77 Correct 64 ms 6256 KB Output is correct
78 Correct 68 ms 6288 KB Output is correct
79 Correct 56 ms 6260 KB Output is correct
80 Correct 63 ms 6276 KB Output is correct
81 Correct 68 ms 6276 KB Output is correct
82 Correct 53 ms 6264 KB Output is correct
83 Correct 81 ms 6320 KB Output is correct
84 Correct 70 ms 6356 KB Output is correct
85 Correct 70 ms 6304 KB Output is correct
86 Correct 79 ms 6512 KB Output is correct
87 Correct 75 ms 6268 KB Output is correct
88 Correct 78 ms 6232 KB Output is correct
89 Correct 78 ms 6268 KB Output is correct
90 Correct 82 ms 6248 KB Output is correct
91 Correct 92 ms 6268 KB Output is correct
92 Correct 89 ms 6524 KB Output is correct