oj.uz

답안 #1072184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072184 2024-08-23T15:17:11 Z 7again Mecho (IOI09_mecho) C++17
86 / 100
 355 ms 6344 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 + 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() {
    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 = -1 , r = n * n + 1 ;
    while(l <= r) {
        int m = (l + r) / 2 ;
        if(ok(m))
            l = m + 1 ;
        else
            r = m - 1 ;
    }
    cout << l - 1 << endl ;
}

Subtask #1
86.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 348 KB Output isn't correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 294 ms 6172 KB Output is correct
8 Correct 0 ms 348 KB Output is 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 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Correct 1 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 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 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 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 21 ms 1628 KB Output is correct
34 Correct 20 ms 1628 KB Output is correct
35 Correct 40 ms 1672 KB Output is correct
36 Correct 27 ms 1884 KB Output is correct
37 Correct 26 ms 2008 KB Output is correct
38 Correct 57 ms 1884 KB Output is correct
39 Correct 34 ms 2140 KB Output is correct
40 Correct 36 ms 2140 KB Output is correct
41 Correct 67 ms 2140 KB Output is correct
42 Correct 47 ms 2652 KB Output is correct
43 Correct 44 ms 2648 KB Output is correct
44 Correct 88 ms 2652 KB Output is correct
45 Correct 58 ms 3164 KB Output is correct
46 Correct 51 ms 3164 KB Output is correct
47 Correct 103 ms 3164 KB Output is correct
48 Correct 63 ms 3676 KB Output is correct
49 Correct 64 ms 3676 KB Output is correct
50 Correct 127 ms 3716 KB Output is correct
51 Correct 85 ms 4184 KB Output is correct
52 Correct 75 ms 4176 KB Output is correct
53 Correct 146 ms 4184 KB Output is correct
54 Correct 88 ms 4700 KB Output is correct
55 Correct 87 ms 4696 KB Output is correct
56 Correct 220 ms 4700 KB Output is correct
57 Correct 106 ms 5212 KB Output is correct
58 Correct 101 ms 5208 KB Output is correct
59 Correct 207 ms 5200 KB Output is correct
60 Correct 126 ms 5972 KB Output is correct
61 Correct 115 ms 5980 KB Output is correct
62 Correct 243 ms 6068 KB Output is correct
63 Correct 328 ms 5968 KB Output is correct
64 Correct 355 ms 5816 KB Output is correct
65 Correct 350 ms 5972 KB Output is correct
66 Correct 350 ms 5968 KB Output is correct
67 Incorrect 321 ms 5968 KB Output isn't correct
68 Correct 310 ms 5968 KB Output is correct
69 Correct 325 ms 5976 KB Output is correct
70 Correct 302 ms 5972 KB Output is correct
71 Correct 296 ms 5972 KB Output is correct
72 Correct 323 ms 5972 KB Output is correct
73 Correct 286 ms 6224 KB Output is correct
74 Correct 299 ms 6340 KB Output is correct
75 Correct 316 ms 6344 KB Output is correct
76 Correct 312 ms 6336 KB Output is correct
77 Correct 312 ms 6340 KB Output is correct
78 Incorrect 280 ms 6224 KB Output isn't correct
79 Correct 271 ms 6224 KB Output is correct
80 Correct 279 ms 6228 KB Output is correct
81 Correct 300 ms 6228 KB Output is correct
82 Correct 269 ms 6232 KB Output is correct
83 Correct 297 ms 6220 KB Output is correct
84 Correct 281 ms 6232 KB Output is correct
85 Correct 282 ms 6228 KB Output is correct
86 Correct 294 ms 6272 KB Output is correct
87 Correct 291 ms 6224 KB Output is correct
88 Correct 285 ms 6228 KB Output is correct
89 Correct 287 ms 6228 KB Output is correct
90 Correct 284 ms 6228 KB Output is correct
91 Correct 306 ms 6224 KB Output is correct
92 Correct 305 ms 6228 KB Output is correct