oj.uz

Submission #1072200

# Submission time Handle Problem Language Result Execution time Memory
1072200 2024-08-23T15:32:06 Z 7again Mecho (IOI09_mecho) C++17
95 / 100
 378 ms 7004 KB 
#include <bits/stdc++.h>

using namespace std ;

const int N = 801 ;
int dx[]{0 , 0 , 1 , -1} ;
int dy[]{1 , -1 , 0 , 0} ;


int n , s ;
pair <int , int> Honey , Home ;
char a[N][N] ;

bool inside(int x , int y) {
    return (x >= 0 && y >= 0 && x < n && y < n && a[x][y] != 'T') ;
}
bool val(int x , int y) {
    return  x / s < y ;
}
int ok(int time) {

    int mn2[n + 1][n + 1] ;
    fill_n(&mn2[0][0] , (n + 1) * (n + 1) , 1e9) ;
    queue<pair <int , int>>  q2 ;
    for(int i = 0 ; i < n ; i++) {
        for(int j = 0 ; j < n ; j++) {
            if(a[i][j] == 'H') {
                q2.push({i, j}) ;
                mn2[i][j] = 0 ;
            }
        }
    }
    while(q2.size()) {
        pair <int , int> t = q2.front() ;
        q2.pop() ;
        for(int i = 0 ; i < 4 ; i++) {
            int x = t.first + dx[i] ;
            int y = t.second + dy[i] ;
            if(inside(x , y) &&  mn2[t.first][t.second] + 1 < mn2[x][y]) {
                mn2[x][y] = mn2[t.first][t.second] + 1 ;
                q2.push({x, y}) ;
            }
        }
    }

    int mn[n + 1][n + 1] ;
    fill_n(&mn[0][0] , (n + 1) * (n + 1) , 1e9 ) ;
    queue <pair <int , int>> q ;
    mn[Honey.first][Honey.second] = 0 ;
    if(mn2[Honey.first][Honey.second] > time)
        q.push(Honey) ;
    while(!q.empty()) {
        pair <int , int> t = q.front() ;
        q.pop() ;
        for(int i = 0 ; i < 4 ; i++) {
            int x = t.first + dx[i] ;
            int y = t.second + dy[i] ;
            if(val(mn[t.first][t.second] + 1 , mn2[x][y] - time) && inside(x , y) && mn[t.first][t.second] + 1 < mn[x][y]) {
                mn[x][y] = mn[t.first][t.second] + 1 ;
                q.push({x , y}) ;
            }
        }
    }
    for(int i = 0 ; i < 4 ; i++){
        int x = Home.first + dx[i] ;
        int y = Home.second + dy[i] ;
        if(inside(x , y) && val(mn[x][y] , mn2[x][y]  - time))
            return true ;
    }

    return false ;
}
int main() {
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;

    cin >> n >> s ;

    for(int i = 0 ; i < n ; i++) {
        for(int j = 0 ; j < n ; j++) {
            cin >> a[i][j] ;
            if(a[i][j] == 'M')
                Honey = {i , j} ;
            if(a[i][j] == 'D')
                Home = {i , j} ;
        }
    }

    int l = 0 , r = n * n + 777 ;
    while(l <= r) {
        int m = (l + r) / 2 ;
        if(ok(m))
            l = m + 1 ;
        else
            r = m - 1 ;
    }
    cout << l - 1 << "\n" ;
}

Subtask #1
95.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 273 ms 6748 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 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 1 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 0 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 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 1 ms 348 KB Output is correct
33 Correct 20 ms 1820 KB Output is correct
34 Correct 18 ms 1624 KB Output is correct
35 Correct 38 ms 1628 KB Output is correct
36 Correct 24 ms 2136 KB Output is correct
37 Correct 27 ms 2140 KB Output is correct
38 Correct 49 ms 2168 KB Output is correct
39 Correct 32 ms 2396 KB Output is correct
40 Correct 31 ms 2392 KB Output is correct
41 Correct 67 ms 2588 KB Output is correct
42 Correct 45 ms 2908 KB Output is correct
43 Correct 38 ms 2908 KB Output is correct
44 Correct 84 ms 2908 KB Output is correct
45 Correct 48 ms 3416 KB Output is correct
46 Correct 47 ms 3416 KB Output is correct
47 Correct 96 ms 3548 KB Output is correct
48 Correct 55 ms 3928 KB Output is correct
49 Correct 56 ms 3932 KB Output is correct
50 Correct 116 ms 3928 KB Output is correct
51 Correct 81 ms 4676 KB Output is correct
52 Correct 66 ms 4700 KB Output is correct
53 Correct 148 ms 4696 KB Output is correct
54 Correct 82 ms 5456 KB Output is correct
55 Correct 77 ms 5212 KB Output is correct
56 Correct 168 ms 5316 KB Output is correct
57 Correct 90 ms 5980 KB Output is correct
58 Correct 97 ms 5976 KB Output is correct
59 Correct 192 ms 5980 KB Output is correct
60 Correct 103 ms 6712 KB Output is correct
61 Correct 122 ms 6528 KB Output is correct
62 Correct 227 ms 6488 KB Output is correct
63 Correct 302 ms 6484 KB Output is correct
64 Correct 378 ms 6744 KB Output is correct
65 Correct 324 ms 6492 KB Output is correct
66 Correct 308 ms 6484 KB Output is correct
67 Correct 303 ms 6488 KB Output is correct
68 Correct 290 ms 6748 KB Output is correct
69 Correct 300 ms 6744 KB Output is correct
70 Correct 286 ms 6748 KB Output is correct
71 Correct 294 ms 6708 KB Output is correct
72 Correct 283 ms 6748 KB Output is correct
73 Correct 256 ms 6804 KB Output is correct
74 Correct 267 ms 7004 KB Output is correct
75 Correct 295 ms 7004 KB Output is correct
76 Correct 273 ms 6992 KB Output is correct
77 Correct 273 ms 6996 KB Output is correct
78 Correct 271 ms 6740 KB Output is correct
79 Correct 245 ms 6748 KB Output is correct
80 Correct 262 ms 6740 KB Output is correct
81 Correct 267 ms 6748 KB Output is correct
82 Correct 258 ms 6740 KB Output is correct
83 Correct 274 ms 6992 KB Output is correct
84 Correct 269 ms 6744 KB Output is correct
85 Correct 282 ms 6740 KB Output is correct
86 Correct 270 ms 6920 KB Output is correct
87 Correct 284 ms 6740 KB Output is correct
88 Correct 269 ms 6680 KB Output is correct
89 Correct 267 ms 6744 KB Output is correct
90 Correct 275 ms 6872 KB Output is correct
91 Correct 270 ms 6868 KB Output is correct
92 Correct 303 ms 6876 KB Output is correct