oj.uz

답안 #1072478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072478 2024-08-23T19:46:57 Z 7again Mecho (IOI09_mecho) C++17
95 / 100
 407 ms 11408 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] ;
    int vis2[n + 4][n + 4] ;
    fill_n(&mn2[0][0] , (n + 4) * (n + 4) , 1e9) ;
    fill_n(&vis2[0][0] , (n + 4) * (n + 4) , 0) ;
    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 ;
                vis2[i][j] = 1 ;
            }
        }
    }
    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] && !vis2[x][y]) {
                mn2[x][y] = mn2[t.first][t.second] + 1 ;
                q2.push({x, y}) ;
                vis2[x][y] = 1 ;
            }
        }
    }

    int mn[n + 4][n + 4] ;
    int vis[n + 4][n + 4] ;
    fill_n(&mn[0][0] , (n + 4) * (n + 4) , 1e9 ) ;
    fill_n(&vis[0][0] , (n + 4) * (n + 4) , 0) ;
    queue <pair <int , int>> q ;
    mn[Honey.first][Honey.second] = 0 ;
    vis[Honey.first][Honey.second] = 1 ;
    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] && !vis[x][y]) {
                mn[x][y] = mn[t.first][t.second] + 1 ;
                q.push({x , y}) ;
                vis[x][y] = 1 ;
            }
        }
    }

    for(int i = 0 ; i < 4 ; i++){
        int x = Home.first + dx[i] ;
        int y = Home.second + dy[i] ;
        if(inside(x , y) && vis[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 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 312 ms 11100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 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 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 0 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 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 1 ms 344 KB Output is correct
33 Correct 24 ms 2628 KB Output is correct
34 Correct 21 ms 2652 KB Output is correct
35 Correct 42 ms 2652 KB Output is correct
36 Correct 32 ms 3160 KB Output is correct
37 Correct 29 ms 3160 KB Output is correct
38 Correct 62 ms 3160 KB Output is correct
39 Correct 42 ms 3932 KB Output is correct
40 Correct 37 ms 3844 KB Output is correct
41 Correct 77 ms 3928 KB Output is correct
42 Correct 52 ms 4696 KB Output is correct
43 Correct 47 ms 4784 KB Output is correct
44 Correct 98 ms 4784 KB Output is correct
45 Correct 65 ms 5468 KB Output is correct
46 Correct 59 ms 5468 KB Output is correct
47 Correct 111 ms 5468 KB Output is correct
48 Correct 74 ms 6492 KB Output is correct
49 Correct 72 ms 6480 KB Output is correct
50 Correct 132 ms 6592 KB Output is correct
51 Correct 90 ms 7516 KB Output is correct
52 Correct 81 ms 7448 KB Output is correct
53 Correct 171 ms 7512 KB Output is correct
54 Correct 106 ms 8532 KB Output is correct
55 Correct 97 ms 8528 KB Output is correct
56 Correct 191 ms 8540 KB Output is correct
57 Correct 125 ms 9728 KB Output is correct
58 Correct 107 ms 9812 KB Output is correct
59 Correct 225 ms 9804 KB Output is correct
60 Correct 137 ms 11160 KB Output is correct
61 Correct 122 ms 11160 KB Output is correct
62 Correct 263 ms 11088 KB Output is correct
63 Correct 333 ms 11164 KB Output is correct
64 Correct 407 ms 10984 KB Output is correct
65 Correct 365 ms 11100 KB Output is correct
66 Correct 344 ms 11088 KB Output is correct
67 Correct 340 ms 11088 KB Output is correct
68 Correct 341 ms 11092 KB Output is correct
69 Correct 348 ms 11016 KB Output is correct
70 Correct 360 ms 11092 KB Output is correct
71 Correct 350 ms 11184 KB Output is correct
72 Correct 319 ms 11088 KB Output is correct
73 Correct 284 ms 11348 KB Output is correct
74 Correct 304 ms 11348 KB Output is correct
75 Correct 327 ms 11344 KB Output is correct
76 Correct 307 ms 11260 KB Output is correct
77 Correct 302 ms 11240 KB Output is correct
78 Correct 318 ms 11408 KB Output is correct
79 Correct 288 ms 11340 KB Output is correct
80 Correct 291 ms 11348 KB Output is correct
81 Correct 321 ms 11344 KB Output is correct
82 Correct 320 ms 11356 KB Output is correct
83 Correct 348 ms 11372 KB Output is correct
84 Correct 308 ms 11236 KB Output is correct
85 Correct 331 ms 11372 KB Output is correct
86 Correct 314 ms 11348 KB Output is correct
87 Correct 350 ms 11376 KB Output is correct
88 Correct 342 ms 11088 KB Output is correct
89 Correct 325 ms 11092 KB Output is correct
90 Correct 321 ms 11092 KB Output is correct
91 Correct 313 ms 11328 KB Output is correct
92 Correct 326 ms 11328 KB Output is correct