oj.uz

답안 #1072468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072468 2024-08-23T19:36:34 Z 7again Mecho (IOI09_mecho) C++17
95 / 100
 394 ms 6480 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') ;
}
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
95.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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 282 ms 6172 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 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 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 0 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 0 ms 348 KB Output is correct
21 Correct 0 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 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 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 23 ms 1628 KB Output is correct
34 Correct 20 ms 1688 KB Output is correct
35 Correct 48 ms 1628 KB Output is correct
36 Correct 30 ms 1880 KB Output is correct
37 Correct 28 ms 1884 KB Output is correct
38 Correct 50 ms 1884 KB Output is correct
39 Correct 53 ms 2648 KB Output is correct
40 Correct 35 ms 2396 KB Output is correct
41 Correct 85 ms 2396 KB Output is correct
42 Correct 49 ms 2652 KB Output is correct
43 Correct 42 ms 2652 KB Output is correct
44 Correct 84 ms 2648 KB Output is correct
45 Correct 59 ms 3164 KB Output is correct
46 Correct 53 ms 3160 KB Output is correct
47 Correct 105 ms 3244 KB Output is correct
48 Correct 71 ms 3672 KB Output is correct
49 Correct 62 ms 3672 KB Output is correct
50 Correct 120 ms 3676 KB Output is correct
51 Correct 84 ms 4184 KB Output is correct
52 Correct 78 ms 4188 KB Output is correct
53 Correct 152 ms 4184 KB Output is correct
54 Correct 100 ms 4688 KB Output is correct
55 Correct 109 ms 4852 KB Output is correct
56 Correct 172 ms 4700 KB Output is correct
57 Correct 113 ms 5468 KB Output is correct
58 Correct 105 ms 5204 KB Output is correct
59 Correct 209 ms 5460 KB Output is correct
60 Correct 141 ms 5980 KB Output is correct
61 Correct 112 ms 5980 KB Output is correct
62 Correct 228 ms 5972 KB Output is correct
63 Correct 313 ms 5972 KB Output is correct
64 Correct 394 ms 5868 KB Output is correct
65 Correct 337 ms 5980 KB Output is correct
66 Correct 319 ms 5976 KB Output is correct
67 Correct 320 ms 6100 KB Output is correct
68 Correct 300 ms 5912 KB Output is correct
69 Correct 331 ms 6224 KB Output is correct
70 Correct 295 ms 6124 KB Output is correct
71 Correct 312 ms 6132 KB Output is correct
72 Correct 288 ms 5972 KB Output is correct
73 Correct 301 ms 6224 KB Output is correct
74 Correct 266 ms 6304 KB Output is correct
75 Correct 297 ms 6228 KB Output is correct
76 Correct 278 ms 6468 KB Output is correct
77 Correct 276 ms 6224 KB Output is correct
78 Correct 308 ms 6228 KB Output is correct
79 Correct 259 ms 6224 KB Output is correct
80 Correct 281 ms 6228 KB Output is correct
81 Correct 276 ms 6480 KB Output is correct
82 Correct 264 ms 6224 KB Output is correct
83 Correct 280 ms 6236 KB Output is correct
84 Correct 276 ms 6316 KB Output is correct
85 Correct 302 ms 6224 KB Output is correct
86 Correct 279 ms 6480 KB Output is correct
87 Correct 288 ms 6096 KB Output is correct
88 Correct 293 ms 6360 KB Output is correct
89 Correct 286 ms 6204 KB Output is correct
90 Correct 277 ms 6252 KB Output is correct
91 Correct 281 ms 6232 KB Output is correct
92 Correct 291 ms 6028 KB Output is correct