oj.uz

Submission #103996

# Submission time Handle Problem Language Result Execution time Memory
103996 2019-04-03T16:18:50 Z Badral Mecho (IOI09_mecho) C++17
84 / 100
 416 ms 14452 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;

}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 186 ms 14044 KB Output is correct
8 Incorrect 3 ms 512 KB Output isn't correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 896 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Incorrect 4 ms 896 KB Output isn't correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 2 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 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 2 ms 768 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 3 ms 1024 KB Output is correct
28 Correct 4 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 4 ms 1152 KB Output is correct
33 Correct 16 ms 5368 KB Output is correct
34 Correct 21 ms 5440 KB Output is correct
35 Correct 45 ms 5376 KB Output is correct
36 Correct 20 ms 6400 KB Output is correct
37 Correct 18 ms 6400 KB Output is correct
38 Correct 59 ms 6520 KB Output is correct
39 Correct 21 ms 7544 KB Output is correct
40 Correct 24 ms 7552 KB Output is correct
41 Correct 77 ms 7516 KB Output is correct
42 Correct 42 ms 8696 KB Output is correct
43 Correct 31 ms 8696 KB Output is correct
44 Correct 112 ms 8824 KB Output is correct
45 Correct 33 ms 9600 KB Output is correct
46 Correct 38 ms 9720 KB Output is correct
47 Correct 100 ms 9592 KB Output is correct
48 Correct 33 ms 10488 KB Output is correct
49 Correct 39 ms 10396 KB Output is correct
50 Correct 132 ms 10488 KB Output is correct
51 Correct 41 ms 11256 KB Output is correct
52 Correct 42 ms 11256 KB Output is correct
53 Correct 155 ms 11356 KB Output is correct
54 Correct 47 ms 12180 KB Output is correct
55 Correct 61 ms 12220 KB Output is correct
56 Correct 223 ms 12152 KB Output is correct
57 Correct 65 ms 13048 KB Output is correct
58 Correct 61 ms 12920 KB Output is correct
59 Correct 215 ms 13084 KB Output is correct
60 Correct 63 ms 13816 KB Output is correct
61 Correct 82 ms 13816 KB Output is correct
62 Correct 286 ms 13944 KB Output is correct
63 Correct 173 ms 13816 KB Output is correct
64 Correct 416 ms 13788 KB Output is correct
65 Correct 278 ms 13944 KB Output is correct
66 Correct 269 ms 13816 KB Output is correct
67 Incorrect 206 ms 13816 KB Output isn't correct
68 Correct 119 ms 14072 KB Output is correct
69 Correct 111 ms 13972 KB Output is correct
70 Correct 95 ms 13980 KB Output is correct
71 Correct 96 ms 13944 KB Output is correct
72 Correct 75 ms 13944 KB Output is correct
73 Correct 114 ms 14368 KB Output is correct
74 Correct 132 ms 14400 KB Output is correct
75 Correct 225 ms 14452 KB Output is correct
76 Correct 176 ms 14400 KB Output is correct
77 Correct 191 ms 14404 KB Output is correct
78 Incorrect 160 ms 14424 KB Output isn't correct
79 Correct 115 ms 14320 KB Output is correct
80 Correct 129 ms 14320 KB Output is correct
81 Correct 174 ms 14420 KB Output is correct
82 Correct 175 ms 14448 KB Output is correct
83 Correct 169 ms 14392 KB Output is correct
84 Correct 201 ms 14364 KB Output is correct
85 Correct 183 ms 14328 KB Output is correct
86 Correct 178 ms 14340 KB Output is correct
87 Correct 199 ms 14200 KB Output is correct
88 Correct 188 ms 14196 KB Output is correct
89 Correct 191 ms 14280 KB Output is correct
90 Correct 173 ms 14072 KB Output is correct
91 Correct 215 ms 14296 KB Output is correct
92 Correct 173 ms 14200 KB Output is correct