oj.uz

답안 #104004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104004 2019-04-03T16:36:22 Z Badral Mecho (IOI09_mecho) C++17
100 / 100
 360 ms 14488 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;
    bool ppp = can(0);
    if ( !asdasd ) cout << -1;
    else cout << k;
}

Compilation message

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

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 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 202 ms 14072 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 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 3 ms 640 KB Output is correct
19 Correct 2 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 2 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 3 ms 1024 KB Output is correct
32 Correct 3 ms 1024 KB Output is correct
33 Correct 19 ms 5504 KB Output is correct
34 Correct 16 ms 5348 KB Output is correct
35 Correct 39 ms 5496 KB Output is correct
36 Correct 20 ms 6372 KB Output is correct
37 Correct 19 ms 6520 KB Output is correct
38 Correct 66 ms 6484 KB Output is correct
39 Correct 45 ms 7544 KB Output is correct
40 Correct 21 ms 7544 KB Output is correct
41 Correct 64 ms 7552 KB Output is correct
42 Correct 25 ms 8676 KB Output is correct
43 Correct 29 ms 8832 KB Output is correct
44 Correct 100 ms 8704 KB Output is correct
45 Correct 33 ms 9596 KB Output is correct
46 Correct 36 ms 9592 KB Output is correct
47 Correct 124 ms 9672 KB Output is correct
48 Correct 51 ms 10492 KB Output is correct
49 Correct 53 ms 10488 KB Output is correct
50 Correct 158 ms 10488 KB Output is correct
51 Correct 41 ms 11256 KB Output is correct
52 Correct 44 ms 11460 KB Output is correct
53 Correct 168 ms 11384 KB Output is correct
54 Correct 55 ms 12180 KB Output is correct
55 Correct 50 ms 12152 KB Output is correct
56 Correct 193 ms 12152 KB Output is correct
57 Correct 55 ms 13048 KB Output is correct
58 Correct 74 ms 13048 KB Output is correct
59 Correct 224 ms 13048 KB Output is correct
60 Correct 55 ms 13816 KB Output is correct
61 Correct 61 ms 13820 KB Output is correct
62 Correct 244 ms 13944 KB Output is correct
63 Correct 206 ms 13944 KB Output is correct
64 Correct 360 ms 13816 KB Output is correct
65 Correct 283 ms 13944 KB Output is correct
66 Correct 275 ms 13916 KB Output is correct
67 Correct 207 ms 13688 KB Output is correct
68 Correct 123 ms 13944 KB Output is correct
69 Correct 112 ms 13932 KB Output is correct
70 Correct 86 ms 14072 KB Output is correct
71 Correct 105 ms 13816 KB Output is correct
72 Correct 100 ms 13944 KB Output is correct
73 Correct 89 ms 14372 KB Output is correct
74 Correct 150 ms 14372 KB Output is correct
75 Correct 181 ms 14272 KB Output is correct
76 Correct 178 ms 14476 KB Output is correct
77 Correct 180 ms 14400 KB Output is correct
78 Correct 161 ms 14488 KB Output is correct
79 Correct 136 ms 14320 KB Output is correct
80 Correct 154 ms 14324 KB Output is correct
81 Correct 182 ms 14384 KB Output is correct
82 Correct 160 ms 14392 KB Output is correct
83 Correct 157 ms 14328 KB Output is correct
84 Correct 187 ms 14456 KB Output is correct
85 Correct 213 ms 14328 KB Output is correct
86 Correct 194 ms 14456 KB Output is correct
87 Correct 202 ms 14456 KB Output is correct
88 Correct 164 ms 14168 KB Output is correct
89 Correct 277 ms 14324 KB Output is correct
90 Correct 276 ms 14200 KB Output is correct
91 Correct 223 ms 14196 KB Output is correct
92 Correct 241 ms 14328 KB Output is correct