oj.uz

답안 #1098005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098005 2024-10-08T19:33:08 Z vjudge1 Mecho (IOI09_mecho) C++17
84 / 100
 209 ms 11484 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<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;
        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<long long>> dist(n, vector<long long>(n, binf));
    dist[st/n][st%n] = (long long)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 = 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: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 344 KB Output is correct
2 Correct 1 ms 344 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 344 KB Output is correct
7 Correct 123 ms 11452 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 1 ms 348 KB Output isn't correct
13 Incorrect 1 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 344 KB Output is correct
18 Correct 0 ms 344 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 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 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 1 ms 348 KB Output is correct
33 Correct 10 ms 2536 KB Output is correct
34 Correct 10 ms 2536 KB Output is correct
35 Correct 26 ms 2648 KB Output is correct
36 Correct 13 ms 3244 KB Output is correct
37 Correct 15 ms 3244 KB Output is correct
38 Correct 36 ms 3172 KB Output is correct
39 Correct 16 ms 3972 KB Output is correct
40 Correct 17 ms 3972 KB Output is correct
41 Correct 50 ms 3972 KB Output is correct
42 Correct 20 ms 4684 KB Output is correct
43 Correct 19 ms 4684 KB Output is correct
44 Correct 59 ms 4740 KB Output is correct
45 Correct 24 ms 5676 KB Output is correct
46 Correct 25 ms 5676 KB Output is correct
47 Correct 80 ms 5600 KB Output is correct
48 Correct 30 ms 6632 KB Output is correct
49 Correct 30 ms 6636 KB Output is correct
50 Correct 84 ms 6600 KB Output is correct
51 Correct 34 ms 7728 KB Output is correct
52 Correct 36 ms 7808 KB Output is correct
53 Correct 103 ms 7616 KB Output is correct
54 Correct 48 ms 8844 KB Output is correct
55 Correct 45 ms 8892 KB Output is correct
56 Correct 123 ms 8832 KB Output is correct
57 Correct 47 ms 10028 KB Output is correct
58 Correct 56 ms 10084 KB Output is correct
59 Correct 138 ms 10016 KB Output is correct
60 Correct 55 ms 11484 KB Output is correct
61 Correct 53 ms 11316 KB Output is correct
62 Correct 155 ms 11400 KB Output is correct
63 Correct 136 ms 11324 KB Output is correct
64 Correct 209 ms 11344 KB Output is correct
65 Correct 190 ms 11360 KB Output is correct
66 Correct 149 ms 11324 KB Output is correct
67 Correct 132 ms 11412 KB Output is correct
68 Correct 88 ms 11420 KB Output is correct
69 Correct 80 ms 11400 KB Output is correct
70 Correct 71 ms 11364 KB Output is correct
71 Correct 69 ms 11376 KB Output is correct
72 Incorrect 71 ms 11340 KB Output isn't correct
73 Incorrect 102 ms 11360 KB Output isn't correct
74 Correct 98 ms 11392 KB Output is correct
75 Correct 106 ms 11460 KB Output is correct
76 Correct 102 ms 11380 KB Output is correct
77 Correct 101 ms 11260 KB Output is correct
78 Correct 103 ms 11440 KB Output is correct
79 Correct 90 ms 11448 KB Output is correct
80 Correct 98 ms 11484 KB Output is correct
81 Correct 109 ms 11360 KB Output is correct
82 Correct 93 ms 11360 KB Output is correct
83 Correct 113 ms 11400 KB Output is correct
84 Correct 107 ms 11368 KB Output is correct
85 Correct 104 ms 11412 KB Output is correct
86 Correct 114 ms 11360 KB Output is correct
87 Correct 110 ms 11424 KB Output is correct
88 Correct 123 ms 11364 KB Output is correct
89 Correct 116 ms 11224 KB Output is correct
90 Correct 118 ms 11392 KB Output is correct
91 Correct 121 ms 11240 KB Output is correct
92 Correct 122 ms 11372 KB Output is correct