oj.uz

Submission #103994

# Submission time Handle Problem Language Result Execution time Memory
103994 2019-04-03T16:16:15 Z Badral Mecho (IOI09_mecho) C++17
79 / 100
 362 ms 8568 KB 
#include<bits/stdc++.h>

using namespace std;
#define pi pair<int, int>

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

bool can(int k) {

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

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

    bear[xx][yy] = 0;

    queue < pi > q;
    
    q.push(make_pair(xx, yy));
        int x, y;    
    while(!q.empty()) {
        tie(x, y) = q.front();
        q.pop();
        for(int i = 1; i <= 4; i++) {
            int 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(int i = 1; i <= n; i++) {
        for(int 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()) {
        int x, y; tie(x, y) = p.front(); p.pop();
        for ( int i = 1; i <= 4; i++ ) {
            int 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 ) );
            }
        }
    }

    int k = 0, mm = n * n;
    for(int 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

# Verdict Execution time Memory 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 2 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 176 ms 8184 KB Output is correct
8 Correct 2 ms 512 KB Output is 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 2 ms 896 KB Output is correct
13 Incorrect 2 ms 512 KB Output isn't correct
14 Correct 2 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 640 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 3 ms 812 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 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 3 ms 896 KB Output is correct
30 Correct 3 ms 896 KB Output is correct
31 Correct 3 ms 1024 KB Output is correct
32 Correct 4 ms 1024 KB Output is correct
33 Correct 15 ms 3584 KB Output is correct
34 Correct 14 ms 3584 KB Output is correct
35 Correct 41 ms 3584 KB Output is correct
36 Correct 25 ms 4088 KB Output is correct
37 Correct 25 ms 4068 KB Output is correct
38 Correct 40 ms 4096 KB Output is correct
39 Correct 18 ms 4480 KB Output is correct
40 Correct 21 ms 4480 KB Output is correct
41 Correct 61 ms 4480 KB Output is correct
42 Correct 26 ms 5112 KB Output is correct
43 Correct 24 ms 5120 KB Output is correct
44 Correct 104 ms 5120 KB Output is correct
45 Correct 27 ms 5624 KB Output is correct
46 Correct 28 ms 5632 KB Output is correct
47 Correct 96 ms 5624 KB Output is correct
48 Correct 31 ms 5980 KB Output is correct
49 Correct 36 ms 6016 KB Output is correct
50 Correct 158 ms 6136 KB Output is correct
51 Correct 43 ms 6552 KB Output is correct
52 Correct 47 ms 6648 KB Output is correct
53 Correct 141 ms 6520 KB Output is correct
54 Correct 47 ms 7032 KB Output is correct
55 Correct 45 ms 7160 KB Output is correct
56 Correct 164 ms 7032 KB Output is correct
57 Correct 52 ms 7544 KB Output is correct
58 Correct 54 ms 7544 KB Output is correct
59 Correct 188 ms 7672 KB Output is correct
60 Correct 53 ms 8184 KB Output is correct
61 Correct 73 ms 8160 KB Output is correct
62 Correct 212 ms 8184 KB Output is correct
63 Incorrect 170 ms 8056 KB Output isn't correct
64 Correct 362 ms 8184 KB Output is correct
65 Correct 215 ms 8156 KB Output is correct
66 Correct 246 ms 8184 KB Output is correct
67 Correct 165 ms 8188 KB Output is correct
68 Incorrect 94 ms 8240 KB Output isn't correct
69 Correct 103 ms 8056 KB Output is correct
70 Correct 98 ms 8208 KB Output is correct
71 Correct 79 ms 8172 KB Output is correct
72 Correct 64 ms 8056 KB Output is correct
73 Correct 67 ms 8476 KB Output is correct
74 Correct 106 ms 8440 KB Output is correct
75 Correct 128 ms 8440 KB Output is correct
76 Correct 146 ms 8568 KB Output is correct
77 Correct 154 ms 8528 KB Output is correct
78 Correct 131 ms 8328 KB Output is correct
79 Correct 100 ms 8368 KB Output is correct
80 Correct 122 ms 8384 KB Output is correct
81 Correct 126 ms 8548 KB Output is correct
82 Correct 106 ms 8416 KB Output is correct
83 Incorrect 141 ms 8368 KB Output isn't correct
84 Correct 148 ms 8312 KB Output is correct
85 Correct 155 ms 8340 KB Output is correct
86 Correct 155 ms 8276 KB Output is correct
87 Correct 172 ms 8356 KB Output is correct
88 Incorrect 116 ms 8184 KB Output isn't correct
89 Correct 200 ms 8200 KB Output is correct
90 Correct 204 ms 8312 KB Output is correct
91 Correct 179 ms 8312 KB Output is correct
92 Correct 165 ms 8312 KB Output is correct