oj.uz

답안 #1072226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072226 2024-08-23T15:45:46 Z 7again Mecho (IOI09_mecho) C++17
98 / 100
 395 ms 6348 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] == 'G' || a[x][y] == 'M')) ;
}
bool val(int x , int y) {
    return  x / s < y ;
}
int ok(int time) {

    int mn2[n + 4][n + 4] ;
    fill_n(&mn2[0][0] , (n + 4) * (n + 4) , 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 + 4][n + 4] ;
    fill_n(&mn[0][0] , (n + 4) * (n + 4) , 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() {
    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 + 4 ;
    while(l <= r) {
        int m = (l + r) / 2 ;
        if(ok(m))
            l = m + 1 ;
        else
            r = m - 1 ;
    }
    cout << l - 1 << endl ;
}

Subtask #1
98.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 289 ms 5976 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is 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 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 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 1 ms 348 KB Output is correct
28 Correct 2 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 2 ms 348 KB Output is correct
33 Correct 21 ms 1684 KB Output is correct
34 Correct 20 ms 1688 KB Output is correct
35 Correct 45 ms 1628 KB Output is correct
36 Correct 28 ms 1884 KB Output is correct
37 Correct 30 ms 1880 KB Output is correct
38 Correct 54 ms 1880 KB Output is correct
39 Correct 37 ms 2396 KB Output is correct
40 Correct 42 ms 2396 KB Output is correct
41 Correct 72 ms 2396 KB Output is correct
42 Correct 45 ms 2648 KB Output is correct
43 Correct 51 ms 2648 KB Output is correct
44 Correct 89 ms 2652 KB Output is correct
45 Correct 56 ms 3164 KB Output is correct
46 Correct 63 ms 3248 KB Output is correct
47 Correct 104 ms 3164 KB Output is correct
48 Correct 66 ms 3676 KB Output is correct
49 Correct 63 ms 3672 KB Output is correct
50 Correct 126 ms 3672 KB Output is correct
51 Correct 79 ms 4184 KB Output is correct
52 Correct 77 ms 4272 KB Output is correct
53 Correct 163 ms 4176 KB Output is correct
54 Correct 90 ms 4696 KB Output is correct
55 Correct 89 ms 4696 KB Output is correct
56 Correct 181 ms 4852 KB Output is correct
57 Correct 103 ms 5468 KB Output is correct
58 Correct 104 ms 5468 KB Output is correct
59 Correct 213 ms 5460 KB Output is correct
60 Correct 118 ms 5980 KB Output is correct
61 Correct 116 ms 6092 KB Output is correct
62 Correct 239 ms 5980 KB Output is correct
63 Correct 320 ms 6104 KB Output is correct
64 Correct 395 ms 5980 KB Output is correct
65 Correct 349 ms 5968 KB Output is correct
66 Correct 331 ms 5968 KB Output is correct
67 Correct 324 ms 5968 KB Output is correct
68 Correct 308 ms 6128 KB Output is correct
69 Correct 327 ms 5968 KB Output is correct
70 Correct 303 ms 5916 KB Output is correct
71 Correct 330 ms 6124 KB Output is correct
72 Correct 295 ms 5972 KB Output is correct
73 Correct 275 ms 6308 KB Output is correct
74 Correct 290 ms 6224 KB Output is correct
75 Correct 314 ms 6224 KB Output is correct
76 Correct 296 ms 6228 KB Output is correct
77 Correct 299 ms 6228 KB Output is correct
78 Correct 294 ms 6120 KB Output is correct
79 Correct 269 ms 6228 KB Output is correct
80 Correct 278 ms 6224 KB Output is correct
81 Correct 274 ms 6232 KB Output is correct
82 Correct 293 ms 6348 KB Output is correct
83 Correct 292 ms 6224 KB Output is correct
84 Correct 315 ms 6224 KB Output is correct
85 Correct 302 ms 6312 KB Output is correct
86 Correct 284 ms 6228 KB Output is correct
87 Correct 290 ms 6224 KB Output is correct
88 Correct 318 ms 6228 KB Output is correct
89 Correct 319 ms 6228 KB Output is correct
90 Correct 349 ms 6268 KB Output is correct
91 Correct 302 ms 6048 KB Output is correct
92 Correct 320 ms 6232 KB Output is correct