oj.uz

답안 #1094699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094699 2024-09-30T10:03:35 Z akamizane Mecho (IOI09_mecho) C++17
100 / 100
 203 ms 12156 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};
    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;
                q.push({a, b});
            } 
        }
    }
    // REP(i, n){
    //     REP(j, n){
    //         cerr << dis[i][j] << " ";
    //     }
    //     cerr << '\n';
    // }
    // cerr << '\n';
    auto check = [&](int m){
    if (dis[start.fi][start.se] <= m) return false;
    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 = n * n + 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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 109 ms 11884 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 1 ms 464 KB Output is correct
12 Correct 1 ms 404 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 464 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 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 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 6 ms 2668 KB Output is correct
34 Correct 5 ms 2656 KB Output is correct
35 Correct 21 ms 2652 KB Output is correct
36 Correct 7 ms 3348 KB Output is correct
37 Correct 8 ms 3320 KB Output is correct
38 Correct 28 ms 3364 KB Output is correct
39 Correct 10 ms 4120 KB Output is correct
40 Correct 9 ms 4136 KB Output is correct
41 Correct 38 ms 4060 KB Output is correct
42 Correct 12 ms 4960 KB Output is correct
43 Correct 12 ms 4996 KB Output is correct
44 Correct 49 ms 4952 KB Output is correct
45 Correct 16 ms 5908 KB Output is correct
46 Correct 12 ms 5892 KB Output is correct
47 Correct 67 ms 5836 KB Output is correct
48 Correct 16 ms 6968 KB Output is correct
49 Correct 16 ms 6952 KB Output is correct
50 Correct 66 ms 6932 KB Output is correct
51 Correct 20 ms 8020 KB Output is correct
52 Correct 17 ms 8052 KB Output is correct
53 Correct 85 ms 8004 KB Output is correct
54 Correct 27 ms 9228 KB Output is correct
55 Correct 23 ms 9244 KB Output is correct
56 Correct 94 ms 9172 KB Output is correct
57 Correct 30 ms 10584 KB Output is correct
58 Correct 30 ms 10572 KB Output is correct
59 Correct 124 ms 10504 KB Output is correct
60 Correct 33 ms 11952 KB Output is correct
61 Correct 29 ms 11904 KB Output is correct
62 Correct 129 ms 11868 KB Output is correct
63 Correct 116 ms 11852 KB Output is correct
64 Correct 203 ms 11980 KB Output is correct
65 Correct 148 ms 11872 KB Output is correct
66 Correct 133 ms 11836 KB Output is correct
67 Correct 27 ms 11724 KB Output is correct
68 Correct 53 ms 11924 KB Output is correct
69 Correct 53 ms 11896 KB Output is correct
70 Correct 40 ms 11996 KB Output is correct
71 Correct 47 ms 11936 KB Output is correct
72 Correct 37 ms 11856 KB Output is correct
73 Correct 37 ms 11860 KB Output is correct
74 Correct 84 ms 11908 KB Output is correct
75 Correct 92 ms 11868 KB Output is correct
76 Correct 76 ms 11908 KB Output is correct
77 Correct 81 ms 11884 KB Output is correct
78 Correct 27 ms 11864 KB Output is correct
79 Correct 72 ms 11900 KB Output is correct
80 Correct 79 ms 11900 KB Output is correct
81 Correct 86 ms 11876 KB Output is correct
82 Correct 78 ms 11896 KB Output is correct
83 Correct 95 ms 11896 KB Output is correct
84 Correct 91 ms 11920 KB Output is correct
85 Correct 92 ms 11912 KB Output is correct
86 Correct 89 ms 11904 KB Output is correct
87 Correct 92 ms 11908 KB Output is correct
88 Correct 106 ms 11888 KB Output is correct
89 Correct 112 ms 11868 KB Output is correct
90 Correct 132 ms 11892 KB Output is correct
91 Correct 108 ms 11896 KB Output is correct
92 Correct 117 ms 12156 KB Output is correct