oj.uz

답안 #1072019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072019 2024-08-23T13:23:43 Z 7again Mecho (IOI09_mecho) C++17
60 / 100
 393 ms 12120 KB 
#include <bits/stdc++.h>
 
using namespace std ;
 
const int N = 1000 ;
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 ;
    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(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
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 348 KB Output isn't correct
7 Incorrect 277 ms 6144 KB Output isn't correct
8 Incorrect 0 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 1 ms 344 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Correct 1 ms 348 KB Output is 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 1 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 1 ms 348 KB Output is correct
21 Correct 1 ms 344 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 21 ms 1728 KB Output is correct
34 Correct 19 ms 1624 KB Output is correct
35 Correct 40 ms 1624 KB Output is correct
36 Correct 35 ms 1880 KB Output is correct
37 Correct 29 ms 1884 KB Output is correct
38 Correct 54 ms 2060 KB Output is correct
39 Correct 34 ms 2392 KB Output is correct
40 Correct 35 ms 2424 KB Output is correct
41 Runtime error 62 ms 4688 KB Execution killed with signal 11
42 Correct 44 ms 2856 KB Output is correct
43 Correct 43 ms 2648 KB Output is correct
44 Correct 87 ms 2864 KB Output is correct
45 Correct 66 ms 3164 KB Output is correct
46 Correct 55 ms 3164 KB Output is correct
47 Correct 105 ms 3164 KB Output is correct
48 Correct 62 ms 3672 KB Output is correct
49 Correct 61 ms 3676 KB Output is correct
50 Correct 148 ms 3924 KB Output is correct
51 Correct 81 ms 4188 KB Output is correct
52 Correct 77 ms 4184 KB Output is correct
53 Runtime error 135 ms 8332 KB Execution killed with signal 11
54 Correct 93 ms 4932 KB Output is correct
55 Correct 89 ms 4688 KB Output is correct
56 Correct 185 ms 4956 KB Output is correct
57 Correct 101 ms 5456 KB Output is correct
58 Correct 100 ms 5456 KB Output is correct
59 Correct 205 ms 5352 KB Output is correct
60 Correct 114 ms 6200 KB Output is correct
61 Correct 116 ms 5968 KB Output is correct
62 Correct 238 ms 6212 KB Output is correct
63 Correct 303 ms 5976 KB Output is correct
64 Correct 393 ms 5968 KB Output is correct
65 Correct 332 ms 5968 KB Output is correct
66 Correct 338 ms 6204 KB Output is correct
67 Incorrect 313 ms 5972 KB Output isn't correct
68 Correct 301 ms 6124 KB Output is correct
69 Correct 295 ms 6048 KB Output is correct
70 Correct 312 ms 6236 KB Output is correct
71 Runtime error 271 ms 12120 KB Execution killed with signal 11
72 Correct 288 ms 6040 KB Output is correct
73 Correct 271 ms 6484 KB Output is correct
74 Correct 279 ms 6332 KB Output is correct
75 Correct 302 ms 6480 KB Output is correct
76 Correct 354 ms 6480 KB Output is correct
77 Correct 303 ms 6488 KB Output is correct
78 Incorrect 282 ms 6452 KB Output isn't correct
79 Correct 264 ms 6456 KB Output is correct
80 Correct 269 ms 6232 KB Output is correct
81 Correct 268 ms 6444 KB Output is correct
82 Correct 298 ms 6452 KB Output is correct
83 Correct 276 ms 6312 KB Output is correct
84 Correct 289 ms 6200 KB Output is correct
85 Correct 303 ms 6480 KB Output is correct
86 Correct 294 ms 6236 KB Output is correct
87 Correct 277 ms 6236 KB Output is correct
88 Correct 276 ms 6224 KB Output is correct
89 Correct 295 ms 6364 KB Output is correct
90 Correct 297 ms 6228 KB Output is correct
91 Correct 283 ms 6140 KB Output is correct
92 Correct 283 ms 6368 KB Output is correct