oj.uz

Submission #1071931

# Submission time Handle Problem Language Result Execution time Memory
1071931 2024-08-23T12:30:38 Z 7again Mecho (IOI09_mecho) C++17
54 / 100
 398 ms 8468 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][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
54.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Incorrect 282 ms 6052 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Correct 0 ms 344 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 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 1 ms 348 KB Output is correct
16 Correct 1 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 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 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 2 ms 344 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 34 ms 1648 KB Output is correct
34 Correct 19 ms 1628 KB Output is correct
35 Correct 43 ms 1624 KB Output is correct
36 Correct 31 ms 1880 KB Output is correct
37 Correct 51 ms 1880 KB Output is correct
38 Correct 97 ms 1880 KB Output is correct
39 Correct 61 ms 2348 KB Output is correct
40 Correct 35 ms 2140 KB Output is correct
41 Correct 74 ms 2140 KB Output is correct
42 Correct 79 ms 2764 KB Output is correct
43 Correct 50 ms 2680 KB Output is correct
44 Correct 99 ms 2768 KB Output is correct
45 Correct 99 ms 3160 KB Output is correct
46 Correct 55 ms 3164 KB Output is correct
47 Correct 109 ms 2992 KB Output is correct
48 Correct 91 ms 3676 KB Output is correct
49 Correct 93 ms 4176 KB Output is correct
50 Correct 166 ms 3928 KB Output is correct
51 Correct 118 ms 4440 KB Output is correct
52 Correct 79 ms 4440 KB Output is correct
53 Runtime error 166 ms 8468 KB Execution killed with signal 11
54 Correct 91 ms 5204 KB Output is correct
55 Correct 143 ms 5052 KB Output is correct
56 Correct 216 ms 5200 KB Output is correct
57 Correct 142 ms 5712 KB Output is correct
58 Correct 132 ms 5876 KB Output is correct
59 Correct 216 ms 5964 KB Output is correct
60 Correct 117 ms 6464 KB Output is correct
61 Correct 125 ms 6476 KB Output is correct
62 Correct 279 ms 6564 KB Output is correct
63 Correct 354 ms 6680 KB Output is correct
64 Correct 398 ms 6480 KB Output is correct
65 Correct 394 ms 6480 KB Output is correct
66 Correct 365 ms 6488 KB Output is correct
67 Incorrect 358 ms 6676 KB Output isn't correct
68 Correct 317 ms 6700 KB Output is correct
69 Correct 317 ms 6480 KB Output is correct
70 Correct 320 ms 6480 KB Output is correct
71 Correct 313 ms 6480 KB Output is correct
72 Incorrect 298 ms 6480 KB Output isn't correct
73 Incorrect 278 ms 6880 KB Output isn't correct
74 Correct 284 ms 6736 KB Output is correct
75 Correct 317 ms 6848 KB Output is correct
76 Correct 317 ms 6740 KB Output is correct
77 Correct 322 ms 6736 KB Output is correct
78 Incorrect 291 ms 6740 KB Output isn't correct
79 Correct 272 ms 6936 KB Output is correct
80 Correct 309 ms 6736 KB Output is correct
81 Correct 318 ms 6740 KB Output is correct
82 Correct 314 ms 6932 KB Output is correct
83 Correct 299 ms 6740 KB Output is correct
84 Correct 299 ms 6744 KB Output is correct
85 Correct 310 ms 6736 KB Output is correct
86 Correct 338 ms 6740 KB Output is correct
87 Correct 314 ms 6748 KB Output is correct
88 Correct 280 ms 6748 KB Output is correct
89 Correct 314 ms 6836 KB Output is correct
90 Correct 308 ms 6740 KB Output is correct
91 Correct 330 ms 6996 KB Output is correct
92 Correct 287 ms 6736 KB Output is correct