oj.uz

답안 #103998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103998 2019-04-03T16:21:32 Z Badral Mecho (IOI09_mecho) C++17
79 / 100
 317 ms 14528 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 asdasd = 0;

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' ) {asdasd = 1; 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;
    if ( !asdasd ) cout << -1;
    else cout << k;

}

Subtask #1
79.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 220 ms 14096 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 896 KB Output is correct
13 Incorrect 3 ms 640 KB Output isn't correct
14 Correct 3 ms 896 KB Output is correct
15 Correct 3 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 640 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 3 ms 768 KB Output is correct
22 Correct 2 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 4 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 4 ms 1024 KB Output is correct
30 Correct 5 ms 1024 KB Output is correct
31 Correct 3 ms 1024 KB Output is correct
32 Correct 3 ms 1024 KB Output is correct
33 Correct 16 ms 5368 KB Output is correct
34 Correct 19 ms 5376 KB Output is correct
35 Correct 48 ms 5376 KB Output is correct
36 Correct 19 ms 6400 KB Output is correct
37 Correct 21 ms 6528 KB Output is correct
38 Correct 63 ms 6476 KB Output is correct
39 Correct 32 ms 7544 KB Output is correct
40 Correct 28 ms 7548 KB Output is correct
41 Correct 85 ms 7516 KB Output is correct
42 Correct 31 ms 8696 KB Output is correct
43 Correct 30 ms 8704 KB Output is correct
44 Correct 110 ms 8824 KB Output is correct
45 Correct 38 ms 9700 KB Output is correct
46 Correct 31 ms 9720 KB Output is correct
47 Correct 116 ms 9592 KB Output is correct
48 Correct 35 ms 10496 KB Output is correct
49 Correct 45 ms 10616 KB Output is correct
50 Correct 146 ms 10492 KB Output is correct
51 Correct 41 ms 11340 KB Output is correct
52 Correct 45 ms 11256 KB Output is correct
53 Correct 170 ms 11384 KB Output is correct
54 Correct 54 ms 12068 KB Output is correct
55 Correct 56 ms 12152 KB Output is correct
56 Correct 197 ms 12152 KB Output is correct
57 Correct 57 ms 12920 KB Output is correct
58 Correct 59 ms 12920 KB Output is correct
59 Correct 218 ms 13048 KB Output is correct
60 Correct 53 ms 13816 KB Output is correct
61 Correct 59 ms 13816 KB Output is correct
62 Correct 245 ms 13916 KB Output is correct
63 Incorrect 164 ms 13888 KB Output isn't correct
64 Correct 317 ms 13816 KB Output is correct
65 Correct 252 ms 13944 KB Output is correct
66 Correct 243 ms 13884 KB Output is correct
67 Correct 182 ms 13816 KB Output is correct
68 Incorrect 90 ms 13916 KB Output isn't correct
69 Correct 109 ms 13948 KB Output is correct
70 Correct 77 ms 13944 KB Output is correct
71 Correct 82 ms 13852 KB Output is correct
72 Correct 74 ms 13944 KB Output is correct
73 Correct 78 ms 14528 KB Output is correct
74 Correct 150 ms 14400 KB Output is correct
75 Correct 180 ms 14272 KB Output is correct
76 Correct 140 ms 14276 KB Output is correct
77 Correct 171 ms 14400 KB Output is correct
78 Correct 133 ms 14448 KB Output is correct
79 Correct 133 ms 14320 KB Output is correct
80 Correct 134 ms 14372 KB Output is correct
81 Correct 200 ms 14448 KB Output is correct
82 Correct 176 ms 14320 KB Output is correct
83 Incorrect 156 ms 14300 KB Output isn't correct
84 Correct 183 ms 14328 KB Output is correct
85 Correct 221 ms 14328 KB Output is correct
86 Correct 180 ms 14332 KB Output is correct
87 Correct 210 ms 14456 KB Output is correct
88 Incorrect 150 ms 14324 KB Output isn't correct
89 Correct 180 ms 14196 KB Output is correct
90 Correct 195 ms 14320 KB Output is correct
91 Correct 254 ms 14296 KB Output is correct
92 Correct 192 ms 14196 KB Output is correct