oj.uz

Submission #583540

# Submission time Handle Problem Language Result Execution time Memory
583540 2022-06-25T14:22:49 Z Trent Mecho (IOI09_mecho) C++17
0 / 100
 228 ms 7080 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){
    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);
            // cout << r << ' ' << c << ' ' << sl << ' ' << nr << ' ' << nc << ' ' << dis << ' ' << bee[nr][nc] << '\n';
            if(iv(nr, nc) && !vis[nr][nc] && (sl != 1 || dis < bee[nr][nc])){
                ber[nr][nc] = dis;
                vis[nr][nc] = true;
                if(sl == 0) {
                    bfs.push_back({nr, nc, s-1});
                } else bfs.push_back({nr, nc, sl-1});
            }
        }
    }
    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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 5972 KB Output isn't correct
2 Incorrect 5 ms 5972 KB Output isn't correct
3 Incorrect 5 ms 5972 KB Output isn't correct
4 Incorrect 5 ms 6056 KB Output isn't correct
5 Incorrect 5 ms 5972 KB Output isn't correct
6 Incorrect 5 ms 6100 KB Output isn't correct
7 Incorrect 127 ms 6812 KB Output isn't correct
8 Incorrect 5 ms 6100 KB Output isn't correct
9 Correct 5 ms 6100 KB Output is correct
10 Correct 5 ms 6100 KB Output is correct
11 Incorrect 5 ms 6100 KB Output isn't correct
12 Incorrect 6 ms 6100 KB Output isn't correct
13 Incorrect 7 ms 6100 KB Output isn't correct
14 Incorrect 6 ms 6100 KB Output isn't correct
15 Incorrect 5 ms 6144 KB Output isn't correct
16 Incorrect 5 ms 6100 KB Output isn't correct
17 Incorrect 5 ms 6100 KB Output isn't correct
18 Incorrect 5 ms 6100 KB Output isn't correct
19 Incorrect 5 ms 6068 KB Output isn't correct
20 Incorrect 5 ms 6100 KB Output isn't correct
21 Incorrect 5 ms 6020 KB Output isn't correct
22 Incorrect 6 ms 6100 KB Output isn't correct
23 Incorrect 5 ms 6060 KB Output isn't correct
24 Incorrect 6 ms 6128 KB Output isn't correct
25 Incorrect 6 ms 6132 KB Output isn't correct
26 Incorrect 6 ms 6064 KB Output isn't correct
27 Incorrect 5 ms 6100 KB Output isn't correct
28 Incorrect 5 ms 6024 KB Output isn't correct
29 Incorrect 6 ms 6100 KB Output isn't correct
30 Incorrect 6 ms 6100 KB Output isn't correct
31 Incorrect 5 ms 6144 KB Output isn't correct
32 Incorrect 5 ms 6100 KB Output isn't correct
33 Incorrect 14 ms 6260 KB Output isn't correct
34 Incorrect 13 ms 6356 KB Output isn't correct
35 Incorrect 34 ms 6348 KB Output isn't correct
36 Incorrect 15 ms 6284 KB Output isn't correct
37 Incorrect 15 ms 6356 KB Output isn't correct
38 Incorrect 45 ms 6388 KB Output isn't correct
39 Incorrect 17 ms 6324 KB Output isn't correct
40 Incorrect 19 ms 6356 KB Output isn't correct
41 Incorrect 62 ms 6536 KB Output isn't correct
42 Incorrect 20 ms 6400 KB Output isn't correct
43 Incorrect 26 ms 6476 KB Output isn't correct
44 Incorrect 65 ms 6484 KB Output isn't correct
45 Incorrect 23 ms 6484 KB Output isn't correct
46 Incorrect 23 ms 6484 KB Output isn't correct
47 Incorrect 84 ms 6512 KB Output isn't correct
48 Incorrect 33 ms 6440 KB Output isn't correct
49 Incorrect 29 ms 6484 KB Output isn't correct
50 Incorrect 98 ms 6604 KB Output isn't correct
51 Incorrect 33 ms 6512 KB Output isn't correct
52 Incorrect 33 ms 6580 KB Output isn't correct
53 Incorrect 113 ms 6584 KB Output isn't correct
54 Incorrect 35 ms 6600 KB Output isn't correct
55 Incorrect 36 ms 6516 KB Output isn't correct
56 Incorrect 128 ms 6732 KB Output isn't correct
57 Incorrect 40 ms 6616 KB Output isn't correct
58 Incorrect 40 ms 6604 KB Output isn't correct
59 Incorrect 140 ms 6588 KB Output isn't correct
60 Incorrect 43 ms 6624 KB Output isn't correct
61 Incorrect 45 ms 6672 KB Output isn't correct
62 Incorrect 172 ms 6720 KB Output isn't correct
63 Correct 146 ms 6700 KB Output is correct
64 Correct 228 ms 6604 KB Output is correct
65 Incorrect 199 ms 6600 KB Output isn't correct
66 Correct 186 ms 6640 KB Output is correct
67 Correct 64 ms 6620 KB Output is correct
68 Incorrect 85 ms 6632 KB Output isn't correct
69 Correct 106 ms 6940 KB Output is correct
70 Incorrect 74 ms 6728 KB Output isn't correct
71 Incorrect 77 ms 6604 KB Output isn't correct
72 Incorrect 76 ms 6688 KB Output isn't correct
73 Incorrect 89 ms 6876 KB Output isn't correct
74 Incorrect 160 ms 7080 KB Output isn't correct
75 Incorrect 99 ms 6936 KB Output isn't correct
76 Incorrect 97 ms 6968 KB Output isn't correct
77 Incorrect 94 ms 6936 KB Output isn't correct
78 Incorrect 120 ms 6916 KB Output isn't correct
79 Incorrect 174 ms 6940 KB Output isn't correct
80 Incorrect 96 ms 6924 KB Output isn't correct
81 Incorrect 102 ms 6864 KB Output isn't correct
82 Incorrect 97 ms 6896 KB Output isn't correct
83 Incorrect 119 ms 6848 KB Output isn't correct
84 Incorrect 178 ms 6824 KB Output isn't correct
85 Incorrect 112 ms 6860 KB Output isn't correct
86 Incorrect 118 ms 6932 KB Output isn't correct
87 Incorrect 119 ms 6912 KB Output isn't correct
88 Incorrect 129 ms 6844 KB Output isn't correct
89 Incorrect 167 ms 6860 KB Output isn't correct
90 Incorrect 133 ms 6756 KB Output isn't correct
91 Incorrect 134 ms 6836 KB Output isn't correct
92 Incorrect 124 ms 6800 KB Output isn't correct