oj.uz

Submission #104089

# Submission time Handle Problem Language Result Execution time Memory
104089 2019-04-04T01:49:12 Z Badral Mecho (IOI09_mecho) C++17
100 / 100
 275 ms 8468 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 asdasd = 0;
 
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' ) {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() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    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;
    bool pppp = can(0);
    if ( !asdasd ) cout << -1;
    else cout << k;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:71:10: warning: unused variable 'pppp' [-Wunused-variable]
     bool pppp = can(0);
          ^~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 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 512 KB Output is correct
7 Correct 168 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 Correct 3 ms 768 KB Output is 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 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 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 896 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 1024 KB Output is correct
30 Correct 3 ms 1024 KB Output is correct
31 Correct 3 ms 1024 KB Output is correct
32 Correct 2 ms 1024 KB Output is correct
33 Correct 11 ms 3584 KB Output is correct
34 Correct 8 ms 3584 KB Output is correct
35 Correct 43 ms 3584 KB Output is correct
36 Correct 10 ms 4096 KB Output is correct
37 Correct 9 ms 4096 KB Output is correct
38 Correct 42 ms 4096 KB Output is correct
39 Correct 12 ms 4608 KB Output is correct
40 Correct 14 ms 4608 KB Output is correct
41 Correct 42 ms 4608 KB Output is correct
42 Correct 13 ms 4992 KB Output is correct
43 Correct 12 ms 4992 KB Output is correct
44 Correct 58 ms 5240 KB Output is correct
45 Correct 14 ms 5512 KB Output is correct
46 Correct 16 ms 5632 KB Output is correct
47 Correct 81 ms 5632 KB Output is correct
48 Correct 17 ms 6144 KB Output is correct
49 Correct 17 ms 6016 KB Output is correct
50 Correct 133 ms 6144 KB Output is correct
51 Correct 18 ms 6656 KB Output is correct
52 Correct 18 ms 6656 KB Output is correct
53 Correct 119 ms 6660 KB Output is correct
54 Correct 30 ms 7028 KB Output is correct
55 Correct 33 ms 7032 KB Output is correct
56 Correct 146 ms 7132 KB Output is correct
57 Correct 22 ms 7672 KB Output is correct
58 Correct 25 ms 7672 KB Output is correct
59 Correct 163 ms 7672 KB Output is correct
60 Correct 24 ms 8028 KB Output is correct
61 Correct 29 ms 8064 KB Output is correct
62 Correct 182 ms 8108 KB Output is correct
63 Correct 140 ms 8140 KB Output is correct
64 Correct 275 ms 8164 KB Output is correct
65 Correct 207 ms 8056 KB Output is correct
66 Correct 253 ms 8056 KB Output is correct
67 Correct 139 ms 8056 KB Output is correct
68 Correct 63 ms 8152 KB Output is correct
69 Correct 64 ms 8064 KB Output is correct
70 Correct 54 ms 8184 KB Output is correct
71 Correct 60 ms 8056 KB Output is correct
72 Correct 41 ms 8056 KB Output is correct
73 Correct 52 ms 8312 KB Output is correct
74 Correct 115 ms 8312 KB Output is correct
75 Correct 126 ms 8444 KB Output is correct
76 Correct 140 ms 8468 KB Output is correct
77 Correct 125 ms 8380 KB Output is correct
78 Correct 108 ms 8312 KB Output is correct
79 Correct 88 ms 8356 KB Output is correct
80 Correct 104 ms 8292 KB Output is correct
81 Correct 119 ms 8388 KB Output is correct
82 Correct 102 ms 8440 KB Output is correct
83 Correct 105 ms 8312 KB Output is correct
84 Correct 140 ms 8284 KB Output is correct
85 Correct 132 ms 8224 KB Output is correct
86 Correct 137 ms 8312 KB Output is correct
87 Correct 143 ms 8440 KB Output is correct
88 Correct 113 ms 8388 KB Output is correct
89 Correct 155 ms 8312 KB Output is correct
90 Correct 134 ms 8184 KB Output is correct
91 Correct 183 ms 8312 KB Output is correct
92 Correct 144 ms 8312 KB Output is correct