oj.uz

답안 #1071924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071924 2024-08-23T12:28:01 Z 7again Mecho (IOI09_mecho) C++17
51 / 100
 337 ms 11860 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] != '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() {
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;
    cout.tie(0) ;

    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
51.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output isn't correct
7 Incorrect 267 ms 6232 KB Output isn't correct
8 Incorrect 1 ms 344 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Incorrect 1 ms 600 KB Output isn't correct
13 Incorrect 1 ms 524 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 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 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 19 ms 1628 KB Output is correct
34 Correct 17 ms 1628 KB Output is correct
35 Correct 43 ms 1672 KB Output is correct
36 Correct 25 ms 1884 KB Output is correct
37 Correct 26 ms 1880 KB Output is correct
38 Correct 49 ms 1884 KB Output is correct
39 Correct 30 ms 2140 KB Output is correct
40 Correct 31 ms 2136 KB Output is correct
41 Correct 68 ms 2392 KB Output is correct
42 Correct 44 ms 2652 KB Output is correct
43 Correct 39 ms 2652 KB Output is correct
44 Correct 83 ms 2792 KB Output is correct
45 Correct 50 ms 3164 KB Output is correct
46 Correct 49 ms 3164 KB Output is correct
47 Correct 101 ms 3160 KB Output is correct
48 Correct 57 ms 3676 KB Output is correct
49 Correct 56 ms 3676 KB Output is correct
50 Correct 128 ms 3676 KB Output is correct
51 Correct 72 ms 4188 KB Output is correct
52 Correct 67 ms 4184 KB Output is correct
53 Correct 154 ms 4168 KB Output is correct
54 Correct 80 ms 4700 KB Output is correct
55 Runtime error 20 ms 9308 KB Execution killed with signal 11
56 Correct 172 ms 4700 KB Output is correct
57 Correct 99 ms 5212 KB Output is correct
58 Correct 92 ms 5212 KB Output is correct
59 Correct 196 ms 5304 KB Output is correct
60 Correct 105 ms 5976 KB Output is correct
61 Correct 107 ms 6072 KB Output is correct
62 Runtime error 192 ms 11856 KB Execution killed with signal 11
63 Correct 299 ms 5888 KB Output is correct
64 Runtime error 112 ms 11816 KB Execution killed with signal 11
65 Correct 335 ms 5980 KB Output is correct
66 Correct 320 ms 6072 KB Output is correct
67 Incorrect 322 ms 5900 KB Output isn't correct
68 Correct 291 ms 5972 KB Output is correct
69 Correct 289 ms 5972 KB Output is correct
70 Runtime error 244 ms 11860 KB Execution killed with signal 11
71 Correct 306 ms 5980 KB Output is correct
72 Runtime error 180 ms 11856 KB Execution killed with signal 11
73 Incorrect 256 ms 6232 KB Output isn't correct
74 Correct 272 ms 6236 KB Output is correct
75 Correct 303 ms 6236 KB Output is correct
76 Correct 300 ms 6224 KB Output is correct
77 Correct 337 ms 6172 KB Output is correct
78 Incorrect 271 ms 6236 KB Output isn't correct
79 Correct 254 ms 6236 KB Output is correct
80 Correct 264 ms 6228 KB Output is correct
81 Correct 263 ms 6232 KB Output is correct
82 Correct 258 ms 6324 KB Output is correct
83 Correct 267 ms 6480 KB Output is correct
84 Correct 282 ms 6232 KB Output is correct
85 Correct 285 ms 6232 KB Output is correct
86 Correct 283 ms 6232 KB Output is correct
87 Correct 277 ms 6236 KB Output is correct
88 Correct 268 ms 6244 KB Output is correct
89 Correct 290 ms 6236 KB Output is correct
90 Correct 293 ms 6236 KB Output is correct
91 Correct 278 ms 6232 KB Output is correct
92 Correct 278 ms 6232 KB Output is correct