oj.uz

답안 #1072004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072004 2024-08-23T13:13:18 Z 7again Mecho (IOI09_mecho) C++17
59 / 100
 397 ms 12116 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 ;
    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
59.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Correct 1 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 332 ms 6152 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 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 Incorrect 1 ms 348 KB Output isn't correct
15 Correct 1 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 1 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 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 508 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 1624 KB Output is correct
34 Correct 36 ms 1596 KB Output is correct
35 Correct 66 ms 1628 KB Output is correct
36 Correct 44 ms 1884 KB Output is correct
37 Correct 54 ms 1888 KB Output is correct
38 Correct 59 ms 1880 KB Output is correct
39 Correct 40 ms 2380 KB Output is correct
40 Correct 36 ms 2140 KB Output is correct
41 Correct 105 ms 2356 KB Output is correct
42 Correct 46 ms 2652 KB Output is correct
43 Correct 77 ms 2652 KB Output is correct
44 Correct 108 ms 2648 KB Output is correct
45 Correct 80 ms 3148 KB Output is correct
46 Correct 65 ms 3160 KB Output is correct
47 Correct 155 ms 3068 KB Output is correct
48 Correct 73 ms 3672 KB Output is correct
49 Correct 73 ms 3700 KB Output is correct
50 Correct 194 ms 3924 KB Output is correct
51 Correct 93 ms 4188 KB Output is correct
52 Runtime error 27 ms 8028 KB Execution killed with signal 11
53 Correct 189 ms 4232 KB Output is correct
54 Correct 110 ms 4688 KB Output is correct
55 Correct 94 ms 4680 KB Output is correct
56 Correct 214 ms 4696 KB Output is correct
57 Correct 121 ms 5200 KB Output is correct
58 Correct 101 ms 5400 KB Output is correct
59 Correct 233 ms 5408 KB Output is correct
60 Correct 118 ms 6048 KB Output is correct
61 Correct 120 ms 5948 KB Output is correct
62 Runtime error 242 ms 12116 KB Execution killed with signal 11
63 Correct 307 ms 5968 KB Output is correct
64 Correct 397 ms 5972 KB Output is correct
65 Correct 361 ms 6044 KB Output is correct
66 Correct 392 ms 5848 KB Output is correct
67 Incorrect 315 ms 5840 KB Output isn't correct
68 Correct 332 ms 5880 KB Output is correct
69 Runtime error 246 ms 11764 KB Execution killed with signal 11
70 Correct 368 ms 5896 KB Output is correct
71 Runtime error 280 ms 12116 KB Execution killed with signal 11
72 Correct 309 ms 5856 KB Output is correct
73 Correct 306 ms 6324 KB Output is correct
74 Correct 331 ms 6224 KB Output is correct
75 Correct 347 ms 6224 KB Output is correct
76 Correct 343 ms 6328 KB Output is correct
77 Correct 322 ms 6124 KB Output is correct
78 Incorrect 301 ms 6104 KB Output isn't correct
79 Correct 273 ms 6224 KB Output is correct
80 Correct 297 ms 6228 KB Output is correct
81 Correct 299 ms 6228 KB Output is correct
82 Correct 287 ms 6300 KB Output is correct
83 Correct 315 ms 6136 KB Output is correct
84 Correct 330 ms 6224 KB Output is correct
85 Correct 317 ms 6260 KB Output is correct
86 Correct 314 ms 6236 KB Output is correct
87 Correct 292 ms 6260 KB Output is correct
88 Correct 285 ms 6024 KB Output is correct
89 Correct 305 ms 6120 KB Output is correct
90 Correct 300 ms 5968 KB Output is correct
91 Correct 294 ms 6088 KB Output is correct
92 Correct 287 ms 5968 KB Output is correct