oj.uz

Submission #1098018

# Submission time Handle Problem Language Result Execution time Memory
1098018 2024-10-08T19:52:13 Z vjudge1 Mecho (IOI09_mecho) C++17
84 / 100
 871 ms 12096 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];
          }
        }
      }
    }
    for(int i = 0; i < n; i++)
    // pr(bdist[i]);
    //morte
    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;
  };
  check(3);
  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:115:5: note: in expansion of macro 'prs'
  115 |     prs(string(50, '-'));
      |     ^~~
mecho.cpp:10:20: warning: statement has no effect [-Wunused-value]
   10 |   #define prs(...) 69
      |                    ^~
mecho.cpp:117:5: note: in expansion of macro 'prs'
  117 |     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 0 ms 348 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 807 ms 11892 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 2 ms 532 KB Output isn't correct
13 Incorrect 3 ms 512 KB Output isn't correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 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 1 ms 348 KB Output is correct
24 Correct 1 ms 504 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 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 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 66 ms 2688 KB Output is correct
34 Correct 69 ms 2700 KB Output is correct
35 Correct 109 ms 2664 KB Output is correct
36 Correct 85 ms 3352 KB Output is correct
37 Correct 86 ms 3336 KB Output is correct
38 Correct 153 ms 3324 KB Output is correct
39 Correct 115 ms 4100 KB Output is correct
40 Correct 111 ms 4124 KB Output is correct
41 Correct 199 ms 4076 KB Output is correct
42 Correct 136 ms 4956 KB Output is correct
43 Correct 135 ms 4956 KB Output is correct
44 Correct 243 ms 4920 KB Output is correct
45 Correct 170 ms 5876 KB Output is correct
46 Correct 163 ms 5856 KB Output is correct
47 Correct 296 ms 5864 KB Output is correct
48 Correct 207 ms 6900 KB Output is correct
49 Correct 207 ms 6916 KB Output is correct
50 Correct 351 ms 6908 KB Output is correct
51 Correct 237 ms 8016 KB Output is correct
52 Correct 234 ms 8016 KB Output is correct
53 Correct 426 ms 8032 KB Output is correct
54 Correct 261 ms 9216 KB Output is correct
55 Correct 269 ms 9212 KB Output is correct
56 Correct 498 ms 9212 KB Output is correct
57 Correct 304 ms 10516 KB Output is correct
58 Correct 304 ms 10528 KB Output is correct
59 Correct 594 ms 10480 KB Output is correct
60 Correct 358 ms 11876 KB Output is correct
61 Correct 369 ms 11884 KB Output is correct
62 Correct 671 ms 11856 KB Output is correct
63 Correct 813 ms 11868 KB Output is correct
64 Correct 825 ms 11852 KB Output is correct
65 Correct 838 ms 11844 KB Output is correct
66 Correct 789 ms 11844 KB Output is correct
67 Correct 723 ms 11868 KB Output is correct
68 Correct 773 ms 11860 KB Output is correct
69 Correct 807 ms 11864 KB Output is correct
70 Correct 758 ms 11848 KB Output is correct
71 Correct 784 ms 11844 KB Output is correct
72 Incorrect 848 ms 11840 KB Output isn't correct
73 Incorrect 856 ms 11900 KB Output isn't correct
74 Correct 861 ms 11912 KB Output is correct
75 Correct 819 ms 11892 KB Output is correct
76 Correct 810 ms 11912 KB Output is correct
77 Correct 850 ms 11880 KB Output is correct
78 Correct 795 ms 11900 KB Output is correct
79 Correct 784 ms 11900 KB Output is correct
80 Correct 791 ms 11896 KB Output is correct
81 Correct 809 ms 11908 KB Output is correct
82 Correct 780 ms 11868 KB Output is correct
83 Correct 841 ms 11872 KB Output is correct
84 Correct 797 ms 11904 KB Output is correct
85 Correct 777 ms 11876 KB Output is correct
86 Correct 848 ms 12020 KB Output is correct
87 Correct 834 ms 11888 KB Output is correct
88 Correct 814 ms 12096 KB Output is correct
89 Correct 810 ms 11888 KB Output is correct
90 Correct 871 ms 11872 KB Output is correct
91 Correct 827 ms 11892 KB Output is correct
92 Correct 810 ms 12096 KB Output is correct