oj.uz

답안 #103995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103995 2019-04-03T16:17:06 Z Badral Mecho (IOI09_mecho) C++17
79 / 100
 353 ms 14448 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define pi pair<ll, ll>

char a[1015][1015];
ll dx[] = {0, 0, 0, 1, -1, -1, 1, 1, -1};
ll dy[] = {0, 1, -1, 0, 0, -1, -1, 1, 1};
ll bear[1105][1015], bee[1105][1015], xx = -1, yy = -1, xxx = -1, yyy = -1, n, kk;

bool can(ll k) {

    if ( k >= bee[xx][yy] ) return 0;

    for ( ll i = 1; i <= n; i++ ) 
        for ( ll j = 1; j <= n; j++ ) 
            bear[i][j] = INT_MAX;

    bear[xx][yy] = 0;

    queue < pi > q;
    
    q.push(make_pair(xx, yy));
        ll x, y;    
    while(!q.empty()) {
        tie(x, y) = q.front();
        q.pop();
        for(ll i = 1; i <= 4; i++) {
            ll x1 = x + dx[i], y1 = y + dy[i];
            if ( a[x1][y1] == 'D' ) return 1;
            if ( a[x1][y1] == 'G' && bear[x][y] + 1 < kk * ( bee[x1][y1] - k ) && bear[x1][y1] == INT_MAX ) {
                bear[x1][y1] = bear[x][y] + 1;
                q.push ( make_pair ( x1, y1 ) ); 
            }
        }
    }
    return 0;  
}

int main() {
    cin >> n >> kk;
    queue < pi > p;
    for(ll i = 1; i <= n; i++) {
        for(ll j = 1; j <= n; j++) {
            bee[i][j] = INT_MAX; 
            cin >>a[i][j];
            if ( a[i][j] == 'H' ) {p.push(make_pair(i, j)); bee[i][j] = 0;}
            if ( a[i][j] == 'M' ) xx = i, yy = j;
        }
    }

    while(!p.empty()) {
        ll x, y; tie(x, y) = p.front(); p.pop();
        for ( ll i = 1; i <= 4; i++ ) {
            ll x1 = x + dx[i], y1 = y + dy[i];

            if ( bee[x1][y1] == INT_MAX && ( a[x1][y1] == 'G' || a[x1][y1] == 'M' ) ) {
                bee[x1][y1] = bee[x][y] + 1; p.push ( make_pair ( x1, y1 ) );
            }
        }
    }

    ll k = 0, mm = n * n;
    for(ll i = mm/2; i >= 1; i /= 2) 
        while(i + k <= mm && can(i+k)) 
            k += i;

    cout << ( k == 0 ? -1 : k);

}

Subtask #1
79.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Incorrect 3 ms 384 KB Output isn't correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 200 ms 14200 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 428 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Incorrect 3 ms 512 KB Output isn't correct
14 Correct 3 ms 896 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 3 ms 896 KB Output is correct
27 Correct 3 ms 1024 KB Output is correct
28 Correct 3 ms 1024 KB Output is correct
29 Correct 3 ms 1024 KB Output is correct
30 Correct 3 ms 1024 KB Output is correct
31 Correct 4 ms 1024 KB Output is correct
32 Correct 3 ms 1024 KB Output is correct
33 Correct 16 ms 5376 KB Output is correct
34 Correct 14 ms 5376 KB Output is correct
35 Correct 38 ms 5376 KB Output is correct
36 Correct 20 ms 6428 KB Output is correct
37 Correct 21 ms 6400 KB Output is correct
38 Correct 51 ms 6400 KB Output is correct
39 Correct 23 ms 7552 KB Output is correct
40 Correct 23 ms 7552 KB Output is correct
41 Correct 65 ms 7584 KB Output is correct
42 Correct 25 ms 8696 KB Output is correct
43 Correct 29 ms 8704 KB Output is correct
44 Correct 83 ms 8848 KB Output is correct
45 Correct 36 ms 9592 KB Output is correct
46 Correct 30 ms 9592 KB Output is correct
47 Correct 103 ms 9664 KB Output is correct
48 Correct 44 ms 10508 KB Output is correct
49 Correct 36 ms 10492 KB Output is correct
50 Correct 129 ms 10488 KB Output is correct
51 Correct 39 ms 11384 KB Output is correct
52 Correct 46 ms 11384 KB Output is correct
53 Correct 165 ms 11384 KB Output is correct
54 Correct 53 ms 12168 KB Output is correct
55 Correct 47 ms 12152 KB Output is correct
56 Correct 183 ms 12124 KB Output is correct
57 Correct 62 ms 13048 KB Output is correct
58 Correct 67 ms 13048 KB Output is correct
59 Correct 234 ms 13148 KB Output is correct
60 Correct 61 ms 13816 KB Output is correct
61 Correct 56 ms 13816 KB Output is correct
62 Correct 257 ms 13860 KB Output is correct
63 Incorrect 161 ms 13944 KB Output isn't correct
64 Correct 353 ms 14040 KB Output is correct
65 Correct 273 ms 13816 KB Output is correct
66 Correct 282 ms 13992 KB Output is correct
67 Correct 196 ms 13984 KB Output is correct
68 Incorrect 98 ms 13944 KB Output isn't correct
69 Correct 109 ms 13988 KB Output is correct
70 Correct 105 ms 13960 KB Output is correct
71 Correct 92 ms 13852 KB Output is correct
72 Correct 83 ms 13816 KB Output is correct
73 Correct 97 ms 14400 KB Output is correct
74 Correct 175 ms 14420 KB Output is correct
75 Correct 193 ms 14392 KB Output is correct
76 Correct 180 ms 14400 KB Output is correct
77 Correct 191 ms 14400 KB Output is correct
78 Correct 174 ms 14412 KB Output is correct
79 Correct 118 ms 14320 KB Output is correct
80 Correct 126 ms 14316 KB Output is correct
81 Correct 163 ms 14328 KB Output is correct
82 Correct 131 ms 14448 KB Output is correct
83 Incorrect 166 ms 14344 KB Output isn't correct
84 Correct 169 ms 14300 KB Output is correct
85 Correct 209 ms 14200 KB Output is correct
86 Correct 175 ms 14372 KB Output is correct
87 Correct 171 ms 14228 KB Output is correct
88 Incorrect 155 ms 14340 KB Output isn't correct
89 Correct 185 ms 14324 KB Output is correct
90 Correct 196 ms 14332 KB Output is correct
91 Correct 224 ms 14324 KB Output is correct
92 Correct 209 ms 14196 KB Output is correct