oj.uz

Submission #1098022

# Submission time Handle Problem Language Result Execution time Memory
1098022 2024-10-08T19:58:12 Z sexo69696969 Mecho (IOI09_mecho) C++17
84 / 100
 754 ms 12132 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 = [&](int 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'));
    };
    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;
  };
  int l = 0, r = 1e9;
  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: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, '-'));
      |     ^~~

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 642 ms 12036 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 3 ms 348 KB Output isn't correct
13 Incorrect 2 ms 348 KB Output isn't correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 1 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 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 456 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 2 ms 456 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 5 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 56 ms 2708 KB Output is correct
34 Correct 61 ms 2676 KB Output is correct
35 Correct 91 ms 2640 KB Output is correct
36 Correct 71 ms 3396 KB Output is correct
37 Correct 83 ms 3364 KB Output is correct
38 Correct 135 ms 3328 KB Output is correct
39 Correct 86 ms 4092 KB Output is correct
40 Correct 90 ms 4092 KB Output is correct
41 Correct 168 ms 4108 KB Output is correct
42 Correct 121 ms 4968 KB Output is correct
43 Correct 110 ms 4952 KB Output is correct
44 Correct 194 ms 4924 KB Output is correct
45 Correct 155 ms 5876 KB Output is correct
46 Correct 147 ms 5876 KB Output is correct
47 Correct 312 ms 5856 KB Output is correct
48 Correct 162 ms 6928 KB Output is correct
49 Correct 169 ms 6912 KB Output is correct
50 Correct 284 ms 6912 KB Output is correct
51 Correct 196 ms 8032 KB Output is correct
52 Correct 198 ms 8044 KB Output is correct
53 Correct 347 ms 8008 KB Output is correct
54 Correct 219 ms 9248 KB Output is correct
55 Correct 219 ms 9216 KB Output is correct
56 Correct 384 ms 9320 KB Output is correct
57 Correct 255 ms 10672 KB Output is correct
58 Correct 242 ms 10512 KB Output is correct
59 Correct 451 ms 10508 KB Output is correct
60 Correct 296 ms 11884 KB Output is correct
61 Correct 292 ms 11896 KB Output is correct
62 Correct 540 ms 11872 KB Output is correct
63 Correct 667 ms 11868 KB Output is correct
64 Correct 704 ms 11860 KB Output is correct
65 Correct 754 ms 11864 KB Output is correct
66 Correct 667 ms 11868 KB Output is correct
67 Correct 621 ms 11864 KB Output is correct
68 Correct 658 ms 11864 KB Output is correct
69 Correct 640 ms 11928 KB Output is correct
70 Correct 640 ms 11868 KB Output is correct
71 Correct 620 ms 11864 KB Output is correct
72 Incorrect 667 ms 11864 KB Output isn't correct
73 Incorrect 611 ms 11900 KB Output isn't correct
74 Correct 654 ms 11908 KB Output is correct
75 Correct 666 ms 11896 KB Output is correct
76 Correct 598 ms 11904 KB Output is correct
77 Correct 609 ms 11916 KB Output is correct
78 Correct 565 ms 11880 KB Output is correct
79 Correct 583 ms 11892 KB Output is correct
80 Correct 575 ms 11888 KB Output is correct
81 Correct 624 ms 12132 KB Output is correct
82 Correct 588 ms 11900 KB Output is correct
83 Correct 626 ms 11896 KB Output is correct
84 Correct 621 ms 11892 KB Output is correct
85 Correct 604 ms 11912 KB Output is correct
86 Correct 606 ms 11924 KB Output is correct
87 Correct 610 ms 11884 KB Output is correct
88 Correct 598 ms 11880 KB Output is correct
89 Correct 606 ms 11876 KB Output is correct
90 Correct 612 ms 11896 KB Output is correct
91 Correct 625 ms 11872 KB Output is correct
92 Correct 613 ms 11896 KB Output is correct