oj.uz

답안 #1071961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071961 2024-08-23T12:46:32 Z 7again Mecho (IOI09_mecho) C++17
52 / 100
 388 ms 11936 KB 
#include <bits/stdc++.h>

using namespace std ;

const int N = 800 ;
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] != 'T') ;
}
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 ;
    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}) ;
            }
        }
    }
    if(mn[Home.first][Home.second] == 1e9)
        return  0 ;
    return  1 ;
}
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 + 1 < r) {
        int m = (l + r) / 2 ;
        if(ok(m))
            l = m ;
        else
            r = m ;
    }
    cout << l << endl ;
}

Subtask #1
52.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 281 ms 5972 KB Output isn't correct
8 Incorrect 1 ms 344 KB Output isn't correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Incorrect 1 ms 348 KB Output isn't 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 360 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 48 ms 1628 KB Output is correct
36 Correct 28 ms 1884 KB Output is correct
37 Correct 28 ms 1884 KB Output is correct
38 Correct 69 ms 1880 KB Output is correct
39 Correct 35 ms 2140 KB Output is correct
40 Correct 36 ms 2136 KB Output is correct
41 Correct 72 ms 2136 KB Output is correct
42 Correct 46 ms 2648 KB Output is correct
43 Runtime error 16 ms 5212 KB Execution killed with signal 11
44 Correct 91 ms 2716 KB Output is correct
45 Correct 57 ms 3204 KB Output is correct
46 Correct 55 ms 3164 KB Output is correct
47 Correct 117 ms 3160 KB Output is correct
48 Correct 66 ms 3696 KB Output is correct
49 Correct 73 ms 3600 KB Output is correct
50 Correct 138 ms 3676 KB Output is correct
51 Correct 81 ms 4188 KB Output is correct
52 Correct 75 ms 4188 KB Output is correct
53 Correct 165 ms 4232 KB Output is correct
54 Correct 95 ms 4792 KB Output is correct
55 Correct 88 ms 4696 KB Output is correct
56 Correct 202 ms 4696 KB Output is correct
57 Correct 105 ms 5400 KB Output is correct
58 Correct 103 ms 5208 KB Output is correct
59 Correct 218 ms 5408 KB Output is correct
60 Correct 139 ms 5976 KB Output is correct
61 Runtime error 38 ms 11744 KB Execution killed with signal 11
62 Runtime error 205 ms 11936 KB Execution killed with signal 11
63 Correct 315 ms 5968 KB Output is correct
64 Correct 388 ms 5972 KB Output is correct
65 Correct 338 ms 5972 KB Output is correct
66 Correct 322 ms 5972 KB Output is correct
67 Incorrect 319 ms 5968 KB Output isn't correct
68 Correct 309 ms 6124 KB Output is correct
69 Correct 300 ms 5972 KB Output is correct
70 Correct 316 ms 5968 KB Output is correct
71 Correct 309 ms 5972 KB Output is correct
72 Runtime error 187 ms 11856 KB Execution killed with signal 11
73 Incorrect 268 ms 6232 KB Output isn't correct
74 Correct 284 ms 6148 KB Output is correct
75 Correct 324 ms 6236 KB Output is correct
76 Correct 317 ms 6224 KB Output is correct
77 Correct 356 ms 6320 KB Output is correct
78 Incorrect 284 ms 6232 KB Output isn't correct
79 Correct 302 ms 6480 KB Output is correct
80 Correct 264 ms 6136 KB Output is correct
81 Correct 282 ms 6224 KB Output is correct
82 Correct 282 ms 6232 KB Output is correct
83 Correct 281 ms 6480 KB Output is correct
84 Correct 310 ms 6252 KB Output is correct
85 Correct 300 ms 6224 KB Output is correct
86 Correct 307 ms 6256 KB Output is correct
87 Correct 290 ms 6232 KB Output is correct
88 Correct 310 ms 6208 KB Output is correct
89 Correct 357 ms 5968 KB Output is correct
90 Correct 295 ms 5968 KB Output is correct
91 Correct 296 ms 5972 KB Output is correct
92 Correct 282 ms 5968 KB Output is correct