oj.uz

Submission #583543

# Submission time Handle Problem Language Result Execution time Memory
583543 2022-06-25T14:27:24 Z Trent Mecho (IOI09_mecho) C++17
15 / 100
 219 ms 7064 KB 
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"

using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define open(g) string _name_ = g; freopen((_name_ + ".in").c_str(), "r", stdin); freopen((_name_ + ".out").c_str(), "w", stdout)
#define printArr(a, len) for(int asdf = 0; asdf < (len); ++asdf) cout << (a)[asdf] << ' '; cout << '\n';
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define forR(i, x) for(int i = 0; i < x; ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(i) i.begin(), i.end()
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
#define mii map<int, int>
#define umii unordered_map<int, int>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

const int MN = 810, INF = 1e9 + 10;
struct coord{int r, c;};
struct bear{int r, c, sl;};
bool vis[MN][MN];
int bee[MN][MN], ber[MN][MN]; // minimum # of minutes needed to end here
char grid[MN][MN];
int dir[4][2] = {{1, 0}, {0, 1}, {0, -1}, {-1, 0}};
int n, s;
int mr, mc;

bool ib(int r, int c){return 0 <= r && r < n && 0 <= c && c < n;}
bool iv(int r, int c){return ib(r, c) && grid[r][c] != 'T';}

// t = number of minutes bear eats
bool pos(int t){
    if(bee[mr][mc] == t) return false;
    deque<bear> bfs = {{mr, mc, 0}};
    forR(a, MN) forR(b, MN) vis[a][b] = false;
    forR(a, MN) forR(b, MN) ber[a][b] = 0;
    ber[mr][mc] = t;
    vis[mr][mc] = true;
    while(!bfs.empty()){
        auto [r, c, sl] = bfs.front();
        bfs.pop_front();
        if(grid[r][c] == 'D') {
            return true;
        }
        for(auto [rc, cc] : dir){
            auto [nr, nc] = pii{r+rc, c+cc};
            int dis = ber[r][c] + (sl == 0);
            int nsl = sl == 0 ? s - 1 : sl - 1;
            // cout << r << ' ' << c << ' ' << sl << ' ' << nr << ' ' << nc << ' ' << dis << ' ' << bee[nr][nc] << '\n';
            if(iv(nr, nc) && !vis[nr][nc] && (nsl != 0 || dis < bee[nr][nc])){
                ber[nr][nc] = dis;
                vis[nr][nc] = true;
                bfs.push_back({nr, nc, nsl});
            }
        }
    }
    return false;
}

signed main() {
    cin >> n >> s;
    deque<coord> bfs;
    forR(r, n) forR(c, n){
        cin >> grid[r][c];
        if(grid[r][c] == 'H') {
            bfs.push_back({r, c});
            vis[r][c] = true;
        } else if(grid[r][c] == 'M'){
            mr=r, mc=c;
        }
    }
    while(!bfs.empty()){
        auto [r, c] = bfs.front();
        bfs.pop_front();
        for(auto [cr, cc] : dir){
            auto [nr, nc] = pii {r + cr, c + cc};
            if(iv(nr, nc) && grid[nr][nc] != 'D' && !vis[nr][nc]){
                vis[nr][nc] = true;
                bee[nr][nc] = bee[r][c] + 1;
                bfs.push_back({nr, nc});
            }
        }
    }
    forR(r, MN) forR(c, MN) if(!vis[r][c]) bee[r][c] = INF;
    if(!pos(0)) cout << "-1\n";
    else {
        // TODO fix hi
        int lo=0, hi=MN * MN;
        while(hi - lo > 1){
            int mid = (lo + hi) / 2;
            if(pos(mid)) lo = mid;
            else hi = mid;
        }
        cout << lo << '\n';
    }
}

Subtask #1
15.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5972 KB Output is correct
2 Correct 5 ms 5972 KB Output is correct
3 Correct 4 ms 5972 KB Output is correct
4 Correct 6 ms 5972 KB Output is correct
5 Incorrect 5 ms 6052 KB Output isn't correct
6 Incorrect 5 ms 6100 KB Output isn't correct
7 Incorrect 122 ms 6796 KB Output isn't correct
8 Correct 3 ms 6100 KB Output is correct
9 Correct 7 ms 6100 KB Output is correct
10 Correct 6 ms 6100 KB Output is correct
11 Incorrect 7 ms 6100 KB Output isn't correct
12 Incorrect 6 ms 6088 KB Output isn't correct
13 Incorrect 5 ms 6100 KB Output isn't correct
14 Incorrect 5 ms 6100 KB Output isn't correct
15 Correct 5 ms 6100 KB Output is correct
16 Incorrect 5 ms 6100 KB Output isn't correct
17 Correct 5 ms 6100 KB Output is correct
18 Incorrect 6 ms 6100 KB Output isn't correct
19 Correct 5 ms 6100 KB Output is correct
20 Incorrect 5 ms 6100 KB Output isn't correct
21 Correct 5 ms 6100 KB Output is correct
22 Incorrect 5 ms 6100 KB Output isn't correct
23 Correct 5 ms 6100 KB Output is correct
24 Incorrect 6 ms 6060 KB Output isn't correct
25 Correct 5 ms 6132 KB Output is correct
26 Incorrect 6 ms 6100 KB Output isn't correct
27 Correct 5 ms 6100 KB Output is correct
28 Incorrect 6 ms 6100 KB Output isn't correct
29 Correct 6 ms 6100 KB Output is correct
30 Incorrect 6 ms 6100 KB Output isn't correct
31 Correct 6 ms 6100 KB Output is correct
32 Incorrect 6 ms 6028 KB Output isn't correct
33 Correct 12 ms 6328 KB Output is correct
34 Incorrect 13 ms 6272 KB Output isn't correct
35 Incorrect 33 ms 6356 KB Output isn't correct
36 Correct 18 ms 6368 KB Output is correct
37 Incorrect 17 ms 6320 KB Output isn't correct
38 Incorrect 46 ms 6396 KB Output isn't correct
39 Correct 19 ms 6444 KB Output is correct
40 Incorrect 18 ms 6440 KB Output isn't correct
41 Incorrect 47 ms 6356 KB Output isn't correct
42 Correct 21 ms 6368 KB Output is correct
43 Incorrect 25 ms 6432 KB Output isn't correct
44 Incorrect 81 ms 6472 KB Output isn't correct
45 Correct 24 ms 6504 KB Output is correct
46 Incorrect 24 ms 6476 KB Output isn't correct
47 Incorrect 76 ms 6524 KB Output isn't correct
48 Correct 28 ms 6428 KB Output is correct
49 Incorrect 31 ms 6536 KB Output isn't correct
50 Incorrect 91 ms 6548 KB Output isn't correct
51 Correct 34 ms 6536 KB Output is correct
52 Incorrect 34 ms 6524 KB Output isn't correct
53 Incorrect 97 ms 6588 KB Output isn't correct
54 Correct 35 ms 6604 KB Output is correct
55 Incorrect 37 ms 6600 KB Output isn't correct
56 Incorrect 111 ms 6628 KB Output isn't correct
57 Correct 40 ms 6556 KB Output is correct
58 Incorrect 42 ms 6568 KB Output isn't correct
59 Incorrect 135 ms 6604 KB Output isn't correct
60 Correct 47 ms 6612 KB Output is correct
61 Incorrect 48 ms 6692 KB Output isn't correct
62 Incorrect 155 ms 6764 KB Output isn't correct
63 Correct 148 ms 6740 KB Output is correct
64 Correct 219 ms 6656 KB Output is correct
65 Incorrect 202 ms 6704 KB Output isn't correct
66 Correct 199 ms 6700 KB Output is correct
67 Correct 69 ms 6708 KB Output is correct
68 Incorrect 84 ms 6672 KB Output isn't correct
69 Correct 101 ms 6604 KB Output is correct
70 Incorrect 73 ms 6688 KB Output isn't correct
71 Incorrect 81 ms 6684 KB Output isn't correct
72 Incorrect 75 ms 6732 KB Output isn't correct
73 Incorrect 90 ms 6940 KB Output isn't correct
74 Incorrect 130 ms 6984 KB Output isn't correct
75 Incorrect 100 ms 6860 KB Output isn't correct
76 Incorrect 97 ms 6980 KB Output isn't correct
77 Incorrect 92 ms 6916 KB Output isn't correct
78 Incorrect 112 ms 6860 KB Output isn't correct
79 Incorrect 162 ms 6956 KB Output isn't correct
80 Incorrect 97 ms 7064 KB Output isn't correct
81 Incorrect 98 ms 6864 KB Output isn't correct
82 Incorrect 88 ms 6860 KB Output isn't correct
83 Incorrect 114 ms 6912 KB Output isn't correct
84 Incorrect 163 ms 6860 KB Output isn't correct
85 Incorrect 109 ms 6904 KB Output isn't correct
86 Incorrect 101 ms 6884 KB Output isn't correct
87 Incorrect 105 ms 6868 KB Output isn't correct
88 Incorrect 121 ms 6984 KB Output isn't correct
89 Incorrect 147 ms 6768 KB Output isn't correct
90 Incorrect 121 ms 6860 KB Output isn't correct
91 Incorrect 125 ms 6832 KB Output isn't correct
92 Incorrect 133 ms 6800 KB Output isn't correct