oj.uz

Submission #1094683

# Submission time Handle Problem Language Result Execution time Memory
1094683 2024-09-30T09:43:26 Z akamizane Mecho (IOI09_mecho) C++17
84 / 100
 179 ms 6296 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using pii = pair<int,long long>;
using ld = long double;
 
#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){
    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 = dis[start.fi][start.se] + 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

# 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 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 98 ms 6228 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 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 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 0 ms 348 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 1 ms 348 KB Output is correct
24 Correct 0 ms 348 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 4 ms 1572 KB Output is correct
34 Correct 4 ms 1616 KB Output is correct
35 Correct 18 ms 1560 KB Output is correct
36 Correct 5 ms 1884 KB Output is correct
37 Correct 5 ms 1884 KB Output is correct
38 Correct 26 ms 1924 KB Output is correct
39 Correct 6 ms 2332 KB Output is correct
40 Correct 6 ms 2292 KB Output is correct
41 Correct 31 ms 2320 KB Output is correct
42 Correct 8 ms 2700 KB Output is correct
43 Correct 9 ms 2732 KB Output is correct
44 Correct 40 ms 2724 KB Output is correct
45 Correct 10 ms 3208 KB Output is correct
46 Correct 9 ms 3168 KB Output is correct
47 Correct 52 ms 3164 KB Output is correct
48 Correct 15 ms 3768 KB Output is correct
49 Correct 12 ms 3716 KB Output is correct
50 Correct 57 ms 3676 KB Output is correct
51 Correct 15 ms 4328 KB Output is correct
52 Correct 13 ms 4324 KB Output is correct
53 Correct 69 ms 4264 KB Output is correct
54 Correct 17 ms 4872 KB Output is correct
55 Correct 16 ms 4876 KB Output is correct
56 Correct 84 ms 4884 KB Output is correct
57 Correct 18 ms 5560 KB Output is correct
58 Correct 17 ms 5564 KB Output is correct
59 Correct 93 ms 5520 KB Output is correct
60 Correct 20 ms 6268 KB Output is correct
61 Correct 21 ms 6272 KB Output is correct
62 Correct 113 ms 6240 KB Output is correct
63 Correct 100 ms 6236 KB Output is correct
64 Correct 179 ms 6296 KB Output is correct
65 Correct 161 ms 6232 KB Output is correct
66 Correct 116 ms 6220 KB Output is correct
67 Correct 24 ms 5976 KB Output is correct
68 Correct 46 ms 6236 KB Output is correct
69 Correct 40 ms 6252 KB Output is correct
70 Correct 36 ms 6236 KB Output is correct
71 Correct 29 ms 6236 KB Output is correct
72 Incorrect 27 ms 6236 KB Output isn't correct
73 Incorrect 38 ms 6236 KB Output isn't correct
74 Correct 70 ms 6204 KB Output is correct
75 Correct 62 ms 6236 KB Output is correct
76 Correct 67 ms 6236 KB Output is correct
77 Correct 67 ms 6236 KB Output is correct
78 Correct 24 ms 6236 KB Output is correct
79 Correct 63 ms 6268 KB Output is correct
80 Correct 64 ms 6272 KB Output is correct
81 Correct 78 ms 6248 KB Output is correct
82 Correct 67 ms 6260 KB Output is correct
83 Correct 91 ms 6244 KB Output is correct
84 Correct 79 ms 6244 KB Output is correct
85 Correct 72 ms 6232 KB Output is correct
86 Correct 86 ms 6232 KB Output is correct
87 Correct 79 ms 6236 KB Output is correct
88 Correct 87 ms 6236 KB Output is correct
89 Correct 92 ms 6240 KB Output is correct
90 Correct 94 ms 6252 KB Output is correct
91 Correct 94 ms 6236 KB Output is correct
92 Correct 96 ms 6236 KB Output is correct