oj.uz

답안 #1094688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094688 2024-09-30T09:49:11 Z akamizane Mecho (IOI09_mecho) C++17
84 / 100
 190 ms 11960 KB 
#include<bits/stdc++.h>
 
using namespace std;

using ll = long long;
using pii = pair<int,long long>;
using ld = long double;
 
#define int long long 
#define el cout << '\n'
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
template <class T1, class T2>bool chmax(T1 &a, T2 b){if (a < b) {a = b; return true;}return false;}
template <class T1, class T2>bool chmin(T1 &a, T2 b){if (a > b) {a = b; return true;}return false;}
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll mod = 1e9 + 7;

void solve(){
    int n, k;
    cin >> n >> k;
    string s[n];
    REP(i, n){
        cin >> s[i];
    }
    pii start, des;
    vector<vector<int>> dis(n, vector<int> (n ,1e9));
    queue<pii> q;
    REP(i, n){
        REP(j, n){
            if (s[i][j] == 'M'){
                start = {i, j};
            }
            if (s[i][j] == 'D'){
                des = {i, j};
            }
            if (s[i][j] == 'H'){
                q.push({i, j});
                dis[i][j] = 0;
            }
        }
    }
    int dx[4] = {0, 0, -1, 1};
    int dy[4] = {-1, 1, 0, 0};
    int mx = 0;
    while(q.size()){
        auto [x, y] = q.front();
        q.pop();
        for (int i = 0; i < 4; i++){
            int a = x + dx[i], b = y + dy[i];
            if (a < 0 || a >= n || b < 0 || b >= n) continue;
            if (s[a][b] == 'T' || s[a][b] == 'D') continue;
            if (dis[x][y] + 1 < dis[a][b]){
                dis[a][b] = dis[x][y] + 1;
                chmax(mx, dis[a][b]);
                q.push({a, b});
            } 
        }
    }
    // REP(i, n){
    //     REP(j, n){
    //         cerr << dis[i][j] << " ";
    //     }
    //     cerr << '\n';
    // }
    // cerr << '\n';
    auto check = [&](int m){
    queue<pii> que;
    que.push(start);
    vector<vector<int>> dis2(n, vector<int> (n, 1e9));
    dis2[start.fi][start.se] = 0;
    while(que.size()){
        auto [x, y] = que.front();
        que.pop();
        if (x == des.fi && y == des.se) break;
        for (int i = 0; i < 4; i++){
            int a = x + dx[i], b = y + dy[i];
            if (a < 0 || a >= n || b < 0 || b >= n) continue;
            if (s[a][b] == 'T') continue;
            int cur = dis2[x][y];
            
            if ((cur + 1) / k < dis[a][b] - m && cur + 1 < dis2[a][b]){
                dis2[a][b] = cur + 1;
                que.push({a, b});
            }
        }
    }
    // REP(i, n){
    //     REP(j, n){
    //         cerr << dis2[i][j] << " ";
    //     }
    //     cerr << '\n';
    // }
    return dis2[des.fi][des.se] != 1e9;
};
  if (!check(0)){
    cout << -1;
    return;
  }
  int l = -1, r = mx + 1;
  while(r - l > 1){
    int mid = (l + r) / 2;
    if (check(mid)) l = mid;
    else r = mid;
  }
  cout << l;
}
 
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tests = 1;
  //cin >> tests;
  for (int _ = 1; _ <= tests; _++){
    cerr << "- Case #" << _ << ": \n";
    solve();
    el;
  }
  return 0;
}

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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 110 ms 11896 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 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 348 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 464 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 7 ms 2716 KB Output is correct
34 Correct 6 ms 2668 KB Output is correct
35 Correct 31 ms 2644 KB Output is correct
36 Correct 9 ms 3356 KB Output is correct
37 Correct 8 ms 3328 KB Output is correct
38 Correct 30 ms 3364 KB Output is correct
39 Correct 11 ms 4124 KB Output is correct
40 Correct 12 ms 4140 KB Output is correct
41 Correct 43 ms 4060 KB Output is correct
42 Correct 14 ms 4972 KB Output is correct
43 Correct 13 ms 4964 KB Output is correct
44 Correct 47 ms 4932 KB Output is correct
45 Correct 16 ms 5916 KB Output is correct
46 Correct 17 ms 5908 KB Output is correct
47 Correct 60 ms 5840 KB Output is correct
48 Correct 20 ms 7028 KB Output is correct
49 Correct 19 ms 6964 KB Output is correct
50 Correct 71 ms 6888 KB Output is correct
51 Correct 24 ms 8104 KB Output is correct
52 Correct 24 ms 8060 KB Output is correct
53 Correct 85 ms 8028 KB Output is correct
54 Correct 31 ms 9276 KB Output is correct
55 Correct 28 ms 9268 KB Output is correct
56 Correct 99 ms 9204 KB Output is correct
57 Correct 31 ms 10588 KB Output is correct
58 Correct 29 ms 10588 KB Output is correct
59 Correct 118 ms 10480 KB Output is correct
60 Correct 37 ms 11960 KB Output is correct
61 Correct 34 ms 11908 KB Output is correct
62 Correct 127 ms 11884 KB Output is correct
63 Correct 109 ms 11896 KB Output is correct
64 Correct 190 ms 11876 KB Output is correct
65 Correct 172 ms 11860 KB Output is correct
66 Correct 128 ms 11884 KB Output is correct
67 Correct 30 ms 11604 KB Output is correct
68 Correct 61 ms 11920 KB Output is correct
69 Correct 50 ms 11924 KB Output is correct
70 Correct 51 ms 11904 KB Output is correct
71 Correct 47 ms 11908 KB Output is correct
72 Incorrect 42 ms 11940 KB Output isn't correct
73 Incorrect 47 ms 11868 KB Output isn't correct
74 Correct 87 ms 11892 KB Output is correct
75 Correct 89 ms 11860 KB Output is correct
76 Correct 94 ms 11908 KB Output is correct
77 Correct 103 ms 11892 KB Output is correct
78 Correct 26 ms 11868 KB Output is correct
79 Correct 84 ms 11912 KB Output is correct
80 Correct 99 ms 11900 KB Output is correct
81 Correct 86 ms 11876 KB Output is correct
82 Correct 79 ms 11920 KB Output is correct
83 Correct 116 ms 11916 KB Output is correct
84 Correct 101 ms 11932 KB Output is correct
85 Correct 89 ms 11880 KB Output is correct
86 Correct 106 ms 11900 KB Output is correct
87 Correct 95 ms 11892 KB Output is correct
88 Correct 106 ms 11896 KB Output is correct
89 Correct 120 ms 11904 KB Output is correct
90 Correct 109 ms 11856 KB Output is correct
91 Correct 113 ms 11868 KB Output is correct
92 Correct 109 ms 11888 KB Output is correct