oj.uz

답안 #1098029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098029 2024-10-08T20:13:27 Z sexo69696969 Mecho (IOI09_mecho) C++14
84 / 100
 153 ms 6320 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;
    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: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
84.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 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 85 ms 6268 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't 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 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 5 ms 1572 KB Output is correct
34 Correct 6 ms 1572 KB Output is correct
35 Correct 20 ms 1584 KB Output is correct
36 Correct 7 ms 1884 KB Output is correct
37 Correct 6 ms 1884 KB Output is correct
38 Correct 26 ms 1920 KB Output is correct
39 Correct 7 ms 2276 KB Output is correct
40 Correct 11 ms 2356 KB Output is correct
41 Correct 35 ms 2288 KB Output is correct
42 Correct 14 ms 2732 KB Output is correct
43 Correct 16 ms 2696 KB Output is correct
44 Correct 45 ms 2792 KB Output is correct
45 Correct 12 ms 3208 KB Output is correct
46 Correct 12 ms 3180 KB Output is correct
47 Correct 54 ms 3244 KB Output is correct
48 Correct 15 ms 3780 KB Output is correct
49 Correct 14 ms 3768 KB Output is correct
50 Correct 67 ms 3728 KB Output is correct
51 Correct 16 ms 4184 KB Output is correct
52 Correct 17 ms 4324 KB Output is correct
53 Correct 76 ms 4320 KB Output is correct
54 Correct 21 ms 4924 KB Output is correct
55 Correct 23 ms 4924 KB Output is correct
56 Correct 89 ms 4924 KB Output is correct
57 Correct 21 ms 5564 KB Output is correct
58 Correct 30 ms 5572 KB Output is correct
59 Correct 99 ms 5552 KB Output is correct
60 Correct 23 ms 6264 KB Output is correct
61 Correct 23 ms 6264 KB Output is correct
62 Correct 116 ms 6256 KB Output is correct
63 Correct 109 ms 6260 KB Output is correct
64 Correct 146 ms 6212 KB Output is correct
65 Correct 153 ms 6220 KB Output is correct
66 Correct 121 ms 6260 KB Output is correct
67 Correct 100 ms 6244 KB Output is correct
68 Correct 51 ms 6260 KB Output is correct
69 Correct 48 ms 6256 KB Output is correct
70 Correct 45 ms 6320 KB Output is correct
71 Correct 38 ms 6268 KB Output is correct
72 Incorrect 35 ms 6312 KB Output isn't correct
73 Incorrect 39 ms 6304 KB Output isn't correct
74 Correct 61 ms 6272 KB Output is correct
75 Correct 67 ms 6280 KB Output is correct
76 Correct 61 ms 6296 KB Output is correct
77 Correct 66 ms 6264 KB Output is correct
78 Correct 70 ms 6268 KB Output is correct
79 Correct 58 ms 6264 KB Output is correct
80 Correct 64 ms 6256 KB Output is correct
81 Correct 69 ms 6236 KB Output is correct
82 Correct 68 ms 6268 KB Output is correct
83 Correct 104 ms 6252 KB Output is correct
84 Correct 71 ms 6292 KB Output is correct
85 Correct 70 ms 6288 KB Output is correct
86 Correct 76 ms 6292 KB Output is correct
87 Correct 74 ms 6276 KB Output is correct
88 Correct 80 ms 6236 KB Output is correct
89 Correct 82 ms 6268 KB Output is correct
90 Correct 85 ms 6268 KB Output is correct
91 Correct 81 ms 6236 KB Output is correct
92 Correct 80 ms 6296 KB Output is correct