oj.uz

답안 #1072470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072470 2024-08-23T19:37:57 Z 7again Mecho (IOI09_mecho) C++17
98 / 100
 518 ms 6408 KB 
#include <bits/stdc++.h>

using namespace std ;

const int N = 801 ;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};


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' && (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(inside(x , y) && val(mn[t.first][t.second] + 1 , mn2[x][y] - time) && 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 - l) / 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 344 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 410 ms 5992 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 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 Correct 1 ms 348 KB Output is 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 344 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 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 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 2 ms 456 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 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 3 ms 544 KB Output is correct
33 Correct 29 ms 1628 KB Output is correct
34 Correct 37 ms 1628 KB Output is correct
35 Correct 52 ms 1668 KB Output is correct
36 Correct 41 ms 2004 KB Output is correct
37 Correct 36 ms 1868 KB Output is correct
38 Correct 78 ms 2008 KB Output is correct
39 Correct 63 ms 2392 KB Output is correct
40 Correct 60 ms 2396 KB Output is correct
41 Correct 110 ms 2392 KB Output is correct
42 Correct 66 ms 2652 KB Output is correct
43 Correct 67 ms 2652 KB Output is correct
44 Correct 123 ms 2652 KB Output is correct
45 Correct 83 ms 3164 KB Output is correct
46 Correct 75 ms 3244 KB Output is correct
47 Correct 138 ms 3148 KB Output is correct
48 Correct 107 ms 3740 KB Output is correct
49 Correct 83 ms 3668 KB Output is correct
50 Correct 159 ms 3676 KB Output is correct
51 Correct 111 ms 4064 KB Output is correct
52 Correct 100 ms 4188 KB Output is correct
53 Correct 205 ms 4276 KB Output is correct
54 Correct 121 ms 4836 KB Output is correct
55 Correct 126 ms 4700 KB Output is correct
56 Correct 252 ms 4688 KB Output is correct
57 Correct 143 ms 5456 KB Output is correct
58 Correct 132 ms 5452 KB Output is correct
59 Correct 286 ms 5456 KB Output is correct
60 Correct 172 ms 6088 KB Output is correct
61 Correct 187 ms 5972 KB Output is correct
62 Correct 375 ms 6076 KB Output is correct
63 Correct 402 ms 6092 KB Output is correct
64 Correct 518 ms 6100 KB Output is correct
65 Correct 426 ms 5972 KB Output is correct
66 Correct 416 ms 6096 KB Output is correct
67 Correct 388 ms 5888 KB Output is correct
68 Correct 404 ms 6200 KB Output is correct
69 Correct 400 ms 5888 KB Output is correct
70 Correct 357 ms 6132 KB Output is correct
71 Correct 391 ms 5900 KB Output is correct
72 Correct 353 ms 5968 KB Output is correct
73 Correct 330 ms 6224 KB Output is correct
74 Correct 344 ms 6224 KB Output is correct
75 Correct 369 ms 6228 KB Output is correct
76 Correct 348 ms 6236 KB Output is correct
77 Correct 357 ms 6228 KB Output is correct
78 Correct 346 ms 6348 KB Output is correct
79 Correct 326 ms 6408 KB Output is correct
80 Correct 336 ms 6352 KB Output is correct
81 Correct 352 ms 6356 KB Output is correct
82 Correct 337 ms 6228 KB Output is correct
83 Correct 367 ms 6228 KB Output is correct
84 Correct 370 ms 6084 KB Output is correct
85 Correct 392 ms 6312 KB Output is correct
86 Correct 350 ms 6228 KB Output is correct
87 Correct 358 ms 6312 KB Output is correct
88 Correct 361 ms 6148 KB Output is correct
89 Correct 360 ms 6264 KB Output is correct
90 Correct 363 ms 6264 KB Output is correct
91 Correct 365 ms 6228 KB Output is correct
92 Correct 385 ms 6052 KB Output is correct