oj.uz

Submission #953976

# Submission time Handle Problem Language Result Execution time Memory
953976 2024-03-27T03:39:19 Z Github Mecho (IOI09_mecho) C++17
55 / 100
 125 ms 46160 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long

const ll MAXN = 810;
ll bee[MAXN][MAXN];
ll dist[MAXN][MAXN];
pair<ll,ll> parent[MAXN][MAXN];
bool vis[MAXN][MAXN];
ll dX[] = {1, -1, 0, 0};
ll dY[] = {0, 0, 1, -1};
pair<ll, ll> mencho, den;
vector<string> grid;
ll n, s;

bool compute(ll k){
    if (k >= bee[mencho.first][mencho.second]){
        return false;
    }
    for (ll i = 0; i < MAXN; i++){
        for (ll j = 0; j < MAXN; j++){
            dist[i][j] = 1e9;
            parent[i][j] = {-1, -1};
            vis[i][j] = false;
        }
    }
    queue<pair<ll, ll>> q;
    q.push(mencho);
    dist[mencho.first][mencho.second] = 0;
    while (!q.empty()){
        ll x = q.front().first, y = q.front().second; q.pop();
        vis[x][y] = true;
        if (make_pair(x, y) == den){
            break;
        }
        for (ll i = 0; i < 4; i++){
            ll nX = x + dX[i], nY = y+dY[i];
            if (nX < 0 || nX >= n || nY < 0 || nY >= n){
                continue;
            }
            if (grid[nX][nY] == 'T' || grid[nX][nY] == 'H' || grid[nX][nY] == 'D'){
                continue;
            }
            if (dist[nX][nY] > dist[x][y]+1 && !vis[nX][nY] && (bee[nX][nY]-k) > (dist[x][y]+1)/s){
                dist[nX][nY] = dist[x][y]+1;
                parent[nX][nY] = {x, y};
                q.push({nX, nY});
            }
        }
    }
    for (int i = 0; i < 4; i++){
        ll nX = den.first+dX[i], nY = den.second+dY[i];
        bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n, b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H';
        if (nX < 0 || nX >= n || nY < 0 || nY >= n) {
            continue;
        }
        if (grid[nX][nY] == 'T' || grid[nX][nY] == 'H'){
            continue;
        }
        if ((bee[nX][nY]-k) > (dist[nX][nY])/s){
            return true;
        }
    }
    return false;
}

int main() {
    speedup
    cin >> n >> s;
    grid.resize(n);
    vector<pair<ll, ll>> start;
    for (ll i = 0; i < n; i++){
        string st; cin >> st;
        grid[i] = st;
        for (ll j = 0; j < n; j++){
            if (st[j] == 'H'){
                start.push_back({i, j});
            }else if (st[j] == 'M'){
                mencho = {i, j};
            }else if (st[j] == 'D'){
                den = {i, j};
            }
        }
    }
    for (ll i = 0; i < MAXN; i++){
        for (ll j = 0; j < MAXN; j++){
            bee[i][j] = 1e9;
            vis[i][j] = false;
        }
    }
    queue<pair<ll, ll>> q;
    for (pair<ll, ll> p: start){
        bee[p.first][p.second] = 0;
        q.push({p.first, p.second});
    }
    while (!q.empty()){
        ll x = q.front().first, y = q.front().second; q.pop();
        vis[x][y] = true;
        for (ll i = 0; i < 4; i++){
            ll nX = x + dX[i], nY = y+dY[i];
            if (nX < 0 || nX >= n || nY < 0 || nY >= n || grid[nX][nY] == 'T' || grid[nX][nY] == 'D'){
                continue;
            }
            if (bee[nX][nY] > bee[x][y]+1 && !vis[nX][nY]){
                bee[nX][nY] = bee[x][y]+1;
                q.push({nX, nY});
            }
        }
    }
    ll l = 0, h = 1e9, mid, ans = -1;
    while (l <= h){
        mid = (l+h)/2;
        if (compute(mid)){
            ans = mid;
            l = mid+1;
        }else{
            h = mid-1;
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

mecho.cpp: In function 'bool compute(long long int)':
mecho.cpp:63:14: warning: unused variable 'b1' [-Wunused-variable]
   63 |         bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n, b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H';
      |              ^~
mecho.cpp:63:59: warning: unused variable 'b2' [-Wunused-variable]
   63 |         bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n, b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H';
      |                                                           ^~

Subtask #1
55.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 21592 KB Output is correct
2 Correct 8 ms 21852 KB Output is correct
3 Correct 5 ms 21592 KB Output is correct
4 Correct 6 ms 21596 KB Output is correct
5 Incorrect 6 ms 21596 KB Output isn't correct
6 Runtime error 24 ms 43492 KB Execution killed with signal 11
7 Correct 115 ms 22364 KB Output is correct
8 Runtime error 21 ms 43352 KB Execution killed with signal 11
9 Runtime error 22 ms 43356 KB Execution killed with signal 11
10 Runtime error 21 ms 43352 KB Execution killed with signal 11
11 Runtime error 21 ms 43352 KB Execution killed with signal 11
12 Correct 8 ms 21592 KB Output is correct
13 Correct 4 ms 21596 KB Output is correct
14 Correct 7 ms 21596 KB Output is correct
15 Correct 8 ms 21596 KB Output is correct
16 Correct 8 ms 21596 KB Output is correct
17 Correct 9 ms 21456 KB Output is correct
18 Correct 7 ms 21596 KB Output is correct
19 Correct 9 ms 21596 KB Output is correct
20 Correct 7 ms 21596 KB Output is correct
21 Correct 11 ms 21596 KB Output is correct
22 Correct 6 ms 21596 KB Output is correct
23 Correct 8 ms 21596 KB Output is correct
24 Correct 9 ms 21596 KB Output is correct
25 Correct 10 ms 21648 KB Output is correct
26 Correct 8 ms 21596 KB Output is correct
27 Correct 9 ms 21648 KB Output is correct
28 Correct 7 ms 21648 KB Output is correct
29 Correct 10 ms 21596 KB Output is correct
30 Correct 10 ms 21596 KB Output is correct
31 Correct 13 ms 21648 KB Output is correct
32 Correct 8 ms 21596 KB Output is correct
33 Correct 17 ms 21596 KB Output is correct
34 Correct 14 ms 21776 KB Output is correct
35 Runtime error 26 ms 43848 KB Execution killed with signal 11
36 Correct 13 ms 21828 KB Output is correct
37 Correct 12 ms 21596 KB Output is correct
38 Runtime error 28 ms 43868 KB Execution killed with signal 11
39 Correct 17 ms 22104 KB Output is correct
40 Correct 13 ms 21856 KB Output is correct
41 Runtime error 31 ms 43836 KB Execution killed with signal 11
42 Correct 12 ms 21852 KB Output is correct
43 Correct 10 ms 21848 KB Output is correct
44 Runtime error 29 ms 44144 KB Execution killed with signal 11
45 Correct 19 ms 21848 KB Output is correct
46 Correct 14 ms 21852 KB Output is correct
47 Runtime error 33 ms 44040 KB Execution killed with signal 11
48 Correct 20 ms 21848 KB Output is correct
49 Correct 20 ms 21852 KB Output is correct
50 Runtime error 33 ms 44368 KB Execution killed with signal 11
51 Correct 20 ms 22108 KB Output is correct
52 Correct 24 ms 22360 KB Output is correct
53 Runtime error 35 ms 44368 KB Execution killed with signal 11
54 Correct 25 ms 22108 KB Output is correct
55 Correct 26 ms 22108 KB Output is correct
56 Runtime error 39 ms 44540 KB Execution killed with signal 11
57 Correct 21 ms 22108 KB Output is correct
58 Correct 15 ms 22232 KB Output is correct
59 Runtime error 42 ms 44772 KB Execution killed with signal 11
60 Correct 22 ms 22376 KB Output is correct
61 Correct 22 ms 22108 KB Output is correct
62 Runtime error 47 ms 44884 KB Execution killed with signal 11
63 Runtime error 38 ms 44880 KB Execution killed with signal 11
64 Runtime error 40 ms 44884 KB Execution killed with signal 11
65 Runtime error 38 ms 44892 KB Execution killed with signal 11
66 Runtime error 38 ms 44884 KB Execution killed with signal 11
67 Runtime error 41 ms 45140 KB Execution killed with signal 11
68 Runtime error 40 ms 44880 KB Execution killed with signal 11
69 Runtime error 39 ms 44904 KB Execution killed with signal 11
70 Runtime error 42 ms 44888 KB Execution killed with signal 11
71 Runtime error 40 ms 44912 KB Execution killed with signal 11
72 Runtime error 42 ms 44892 KB Execution killed with signal 11
73 Runtime error 44 ms 45900 KB Execution killed with signal 11
74 Runtime error 40 ms 45876 KB Execution killed with signal 11
75 Runtime error 41 ms 46160 KB Execution killed with signal 11
76 Runtime error 39 ms 45904 KB Execution killed with signal 11
77 Runtime error 41 ms 45908 KB Execution killed with signal 11
78 Correct 68 ms 22840 KB Output is correct
79 Correct 53 ms 22832 KB Output is correct
80 Correct 57 ms 22848 KB Output is correct
81 Correct 65 ms 22616 KB Output is correct
82 Correct 53 ms 22872 KB Output is correct
83 Correct 111 ms 22872 KB Output is correct
84 Correct 82 ms 22608 KB Output is correct
85 Correct 93 ms 22760 KB Output is correct
86 Correct 92 ms 22616 KB Output is correct
87 Correct 96 ms 22756 KB Output is correct
88 Correct 109 ms 22868 KB Output is correct
89 Correct 105 ms 22620 KB Output is correct
90 Correct 125 ms 22648 KB Output is correct
91 Correct 108 ms 22608 KB Output is correct
92 Correct 114 ms 22656 KB Output is correct