oj.uz

Submission #1071962

# Submission time Handle Problem Language Result Execution time Memory
1071962 2024-08-23T12:47:24 Z 7again Mecho (IOI09_mecho) C++17
51 / 100
 381 ms 11956 KB 
#include <bits/stdc++.h>

using namespace std ;

const int N = 800 ;
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 ;
}
bool ok(int time) {

    int mn2[n][n] ;
    fill_n(&mn2[0][0] , n*n , 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][n] ;
    fill_n(&mn[0][0] , n * n , 1e9 ) ;
    queue <pair <int , int>> q ;
    mn[Honey.first][Honey.second] = 0 ;
    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}) ;
            }
        }
    }
    if(mn[Home.first][Home.second] == 1e9)
        return  0 ;
    return  1 ;
}
int main() {
    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 + 1 ;
    while(l + 1 < r) {
        int m = (l + r) / 2 ;
        if(ok(m))
            l = m ;
        else
            r = m ;
    }
    cout << l << endl ;
}

Subtask #1
51.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 314 ms 5996 KB Output isn't correct
8 Incorrect 1 ms 348 KB Output isn't 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 1 ms 348 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Incorrect 1 ms 348 KB Output isn't 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 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 1 ms 348 KB Output is correct
24 Correct 0 ms 348 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 524 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 21 ms 1664 KB Output is correct
34 Correct 26 ms 1668 KB Output is correct
35 Correct 41 ms 1624 KB Output is correct
36 Correct 27 ms 2136 KB Output is correct
37 Correct 28 ms 1884 KB Output is correct
38 Correct 67 ms 1880 KB Output is correct
39 Correct 34 ms 2140 KB Output is correct
40 Correct 34 ms 2332 KB Output is correct
41 Correct 71 ms 2356 KB Output is correct
42 Correct 44 ms 2652 KB Output is correct
43 Correct 46 ms 2756 KB Output is correct
44 Correct 88 ms 2652 KB Output is correct
45 Correct 57 ms 3164 KB Output is correct
46 Correct 62 ms 3164 KB Output is correct
47 Correct 104 ms 3216 KB Output is correct
48 Correct 63 ms 3676 KB Output is correct
49 Correct 61 ms 3676 KB Output is correct
50 Correct 132 ms 3704 KB Output is correct
51 Correct 81 ms 4188 KB Output is correct
52 Correct 75 ms 4184 KB Output is correct
53 Correct 155 ms 4184 KB Output is correct
54 Correct 90 ms 4784 KB Output is correct
55 Correct 94 ms 4812 KB Output is correct
56 Runtime error 156 ms 9304 KB Execution killed with signal 11
57 Correct 103 ms 5264 KB Output is correct
58 Correct 101 ms 5212 KB Output is correct
59 Runtime error 186 ms 10524 KB Execution killed with signal 11
60 Correct 119 ms 5976 KB Output is correct
61 Correct 119 ms 5980 KB Output is correct
62 Correct 234 ms 5972 KB Output is correct
63 Correct 302 ms 5968 KB Output is correct
64 Correct 381 ms 5980 KB Output is correct
65 Runtime error 126 ms 11856 KB Execution killed with signal 11
66 Correct 327 ms 6044 KB Output is correct
67 Incorrect 334 ms 6044 KB Output isn't correct
68 Correct 296 ms 5968 KB Output is correct
69 Runtime error 249 ms 11956 KB Execution killed with signal 11
70 Correct 308 ms 5972 KB Output is correct
71 Runtime error 300 ms 11860 KB Execution killed with signal 11
72 Incorrect 298 ms 5972 KB Output isn't correct
73 Incorrect 267 ms 6332 KB Output isn't correct
74 Correct 291 ms 6324 KB Output is correct
75 Correct 308 ms 6224 KB Output is correct
76 Correct 314 ms 6320 KB Output is correct
77 Correct 308 ms 6228 KB Output is correct
78 Incorrect 277 ms 6232 KB Output isn't correct
79 Correct 268 ms 6300 KB Output is correct
80 Correct 271 ms 6224 KB Output is correct
81 Correct 286 ms 6232 KB Output is correct
82 Correct 268 ms 6292 KB Output is correct
83 Correct 317 ms 6256 KB Output is correct
84 Correct 294 ms 6252 KB Output is correct
85 Correct 306 ms 6264 KB Output is correct
86 Correct 302 ms 6228 KB Output is correct
87 Correct 280 ms 6260 KB Output is correct
88 Correct 289 ms 5968 KB Output is correct
89 Correct 328 ms 6212 KB Output is correct
90 Correct 298 ms 6220 KB Output is correct
91 Correct 298 ms 5972 KB Output is correct
92 Correct 291 ms 6212 KB Output is correct