oj.uz

답안 #1072176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072176 2024-08-23T15:13:22 Z 7again Mecho (IOI09_mecho) C++17
90 / 100
 404 ms 12624 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][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 ;
    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 + 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
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 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 305 ms 6596 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 Correct 1 ms 444 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 0 ms 348 KB Output is correct
23 Correct 1 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 344 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 21 ms 1552 KB Output is correct
34 Correct 22 ms 1608 KB Output is correct
35 Correct 42 ms 1612 KB Output is correct
36 Correct 28 ms 2140 KB Output is correct
37 Correct 36 ms 2136 KB Output is correct
38 Runtime error 47 ms 3664 KB Execution killed with signal 11
39 Correct 37 ms 2568 KB Output is correct
40 Correct 36 ms 2396 KB Output is correct
41 Correct 74 ms 2396 KB Output is correct
42 Correct 49 ms 2904 KB Output is correct
43 Correct 48 ms 2904 KB Output is correct
44 Correct 90 ms 2904 KB Output is correct
45 Correct 61 ms 3416 KB Output is correct
46 Correct 55 ms 3416 KB Output is correct
47 Correct 106 ms 3512 KB Output is correct
48 Correct 66 ms 3932 KB Output is correct
49 Correct 69 ms 4052 KB Output is correct
50 Correct 128 ms 4060 KB Output is correct
51 Correct 79 ms 4444 KB Output is correct
52 Correct 85 ms 4688 KB Output is correct
53 Correct 158 ms 4440 KB Output is correct
54 Correct 91 ms 5212 KB Output is correct
55 Correct 89 ms 5204 KB Output is correct
56 Correct 189 ms 5436 KB Output is correct
57 Correct 104 ms 5824 KB Output is correct
58 Correct 126 ms 5956 KB Output is correct
59 Correct 210 ms 5968 KB Output is correct
60 Correct 129 ms 6480 KB Output is correct
61 Correct 118 ms 6492 KB Output is correct
62 Correct 240 ms 6480 KB Output is correct
63 Correct 324 ms 6688 KB Output is correct
64 Correct 404 ms 6480 KB Output is correct
65 Correct 359 ms 6492 KB Output is correct
66 Correct 330 ms 6492 KB Output is correct
67 Runtime error 125 ms 12564 KB Execution killed with signal 11
68 Runtime error 329 ms 12624 KB Execution killed with signal 11
69 Correct 328 ms 6480 KB Output is correct
70 Correct 304 ms 6488 KB Output is correct
71 Correct 318 ms 6484 KB Output is correct
72 Correct 301 ms 6800 KB Output is correct
73 Correct 279 ms 6740 KB Output is correct
74 Correct 290 ms 6952 KB Output is correct
75 Correct 313 ms 6736 KB Output is correct
76 Correct 287 ms 6788 KB Output is correct
77 Correct 303 ms 6960 KB Output is correct
78 Correct 305 ms 6856 KB Output is correct
79 Correct 267 ms 6748 KB Output is correct
80 Correct 269 ms 6740 KB Output is correct
81 Correct 273 ms 6740 KB Output is correct
82 Correct 323 ms 7052 KB Output is correct
83 Correct 282 ms 6736 KB Output is correct
84 Correct 291 ms 6888 KB Output is correct
85 Correct 300 ms 6744 KB Output is correct
86 Correct 282 ms 6740 KB Output is correct
87 Correct 296 ms 6712 KB Output is correct
88 Correct 293 ms 6736 KB Output is correct
89 Correct 297 ms 6996 KB Output is correct
90 Correct 283 ms 6736 KB Output is correct
91 Correct 288 ms 6740 KB Output is correct
92 Correct 310 ms 6792 KB Output is correct