oj.uz

Submission #1094698

# Submission time Handle Problem Language Result Execution time Memory
1094698 2024-09-30T09:59:41 Z akamizane Mecho (IOI09_mecho) C++17
84 / 100
 201 ms 12080 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){
    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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 604 KB Output is correct
7 Correct 119 ms 12012 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 460 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 1 ms 348 KB Output is correct
23 Correct 0 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 464 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 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 6 ms 2668 KB Output is correct
34 Correct 6 ms 2732 KB Output is correct
35 Correct 24 ms 2660 KB Output is correct
36 Correct 9 ms 3372 KB Output is correct
37 Correct 9 ms 3340 KB Output is correct
38 Correct 31 ms 3356 KB Output is correct
39 Correct 11 ms 4120 KB Output is correct
40 Correct 11 ms 4132 KB Output is correct
41 Correct 40 ms 4060 KB Output is correct
42 Correct 13 ms 4972 KB Output is correct
43 Correct 13 ms 4972 KB Output is correct
44 Correct 52 ms 4944 KB Output is correct
45 Correct 17 ms 5916 KB Output is correct
46 Correct 16 ms 5920 KB Output is correct
47 Correct 59 ms 5904 KB Output is correct
48 Correct 20 ms 6916 KB Output is correct
49 Correct 21 ms 6924 KB Output is correct
50 Correct 77 ms 6984 KB Output is correct
51 Correct 25 ms 8092 KB Output is correct
52 Correct 25 ms 8104 KB Output is correct
53 Correct 88 ms 8056 KB Output is correct
54 Correct 30 ms 9348 KB Output is correct
55 Correct 30 ms 9292 KB Output is correct
56 Correct 114 ms 9272 KB Output is correct
57 Correct 37 ms 10588 KB Output is correct
58 Correct 33 ms 10592 KB Output is correct
59 Correct 126 ms 10596 KB Output is correct
60 Correct 41 ms 12044 KB Output is correct
61 Correct 39 ms 12024 KB Output is correct
62 Correct 155 ms 11928 KB Output is correct
63 Correct 139 ms 11868 KB Output is correct
64 Correct 201 ms 11924 KB Output is correct
65 Correct 159 ms 11940 KB Output is correct
66 Correct 134 ms 11924 KB Output is correct
67 Correct 26 ms 11868 KB Output is correct
68 Correct 66 ms 11992 KB Output is correct
69 Correct 69 ms 11988 KB Output is correct
70 Correct 54 ms 12080 KB Output is correct
71 Correct 71 ms 11968 KB Output is correct
72 Incorrect 48 ms 11972 KB Output isn't correct
73 Incorrect 68 ms 12016 KB Output isn't correct
74 Correct 89 ms 11988 KB Output is correct
75 Correct 98 ms 11960 KB Output is correct
76 Correct 85 ms 11996 KB Output is correct
77 Correct 87 ms 11904 KB Output is correct
78 Correct 25 ms 11860 KB Output is correct
79 Correct 80 ms 11908 KB Output is correct
80 Correct 90 ms 11964 KB Output is correct
81 Correct 98 ms 11972 KB Output is correct
82 Correct 89 ms 11952 KB Output is correct
83 Correct 107 ms 12076 KB Output is correct
84 Correct 104 ms 11960 KB Output is correct
85 Correct 108 ms 11964 KB Output is correct
86 Correct 111 ms 11980 KB Output is correct
87 Correct 122 ms 11944 KB Output is correct
88 Correct 116 ms 11972 KB Output is correct
89 Correct 122 ms 11956 KB Output is correct
90 Correct 114 ms 11932 KB Output is correct
91 Correct 117 ms 11948 KB Output is correct
92 Correct 123 ms 11976 KB Output is correct