oj.uz

답안 #221439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221439 2020-04-10T05:52:35 Z tatyam Mecho (IOI09_mecho) C++17
57 / 100
 206 ms 6296 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int INF = 0x3fffffff;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
#define name2(a,b,c,...) c
#define rep1(b) for(int i = 0; i < b; i++)
#define rep2(i,b) for(int i = 0; i < b; i++)
#define rep(...) name2(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define each(i,a) for(auto&& i : a)
template<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, s;
    cin >> n >> s;
    vector<string> a(n);
    each(i, a) cin >> i;
    vector<vector<int>> bee(n, vector<int>(n, INF));
    queue<pii> q;
    rep(n) rep(j, n) if(a[i][j] == 'H'){
        bee[i][j] = 0;
        q.emplace(i, j);
    }
    while(q.size()){
        auto [x, y] = q.front();
        q.pop();
        rep(4){
            int x2 = x + dx[i], y2 = y + dy[i];
            if(x2 < 0 || y2 < 0 || x2 >= n || y2 >= n || a[x2][y2] != 'G') continue;
            if(chmin(bee[x2][y2], bee[x][y] + 1)) q.emplace(x2, y2);
        }
    }
    pii start, goal;
    rep(n) rep(j, n) if(a[i][j] == 'M') start = {i, j};
    rep(n) rep(j, n) if(a[i][j] == 'D') goal = {i, j};
    auto check = [&](int v) -> bool {
        vector<vector<int>> m(n, vector<int>(n, INF));
        m[start.first][start.second] = 0;
        q.push(start);
        while(q.size()){
            auto [x, y] = q.front();
            q.pop();
            int next = m[x][y] + 1;
            rep(4){
                int x2 = x + dx[i], y2 = y + dy[i];
                if(x2 < 0 || y2 < 0 || x2 >= n || y2 >= n || a[x2][y2] == 'T') continue;
                if(next / s + v < bee[x2][y2] && chmin(m[x2][y2], next)) q.emplace(x2, y2);
            }
        }
        return m[goal.first][goal.second] != INF;
    };
    int ok = -1, ng = 2047;
    while(ng - ok > 1){
        int cen = (ok + ng) / 2;
        if(check(cen)) ok = cen;
        else ng = cen;
    }
    cout << ok << endl;
}

Subtask #1
57.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 112 ms 6156 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Incorrect 5 ms 384 KB Output isn't correct
13 Incorrect 5 ms 384 KB Output isn't correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Incorrect 5 ms 384 KB Output isn't correct
28 Correct 5 ms 384 KB Output is correct
29 Incorrect 5 ms 384 KB Output isn't correct
30 Correct 5 ms 384 KB Output is correct
31 Incorrect 5 ms 384 KB Output isn't correct
32 Correct 5 ms 384 KB Output is correct
33 Incorrect 17 ms 1536 KB Output isn't correct
34 Incorrect 24 ms 1508 KB Output isn't correct
35 Correct 33 ms 1512 KB Output is correct
36 Incorrect 20 ms 1904 KB Output isn't correct
37 Incorrect 29 ms 1792 KB Output isn't correct
38 Correct 39 ms 1792 KB Output is correct
39 Incorrect 25 ms 2232 KB Output isn't correct
40 Incorrect 37 ms 2224 KB Output isn't correct
41 Correct 48 ms 2224 KB Output is correct
42 Incorrect 32 ms 2656 KB Output isn't correct
43 Incorrect 48 ms 2688 KB Output isn't correct
44 Correct 57 ms 2688 KB Output is correct
45 Incorrect 38 ms 3144 KB Output isn't correct
46 Incorrect 56 ms 3104 KB Output isn't correct
47 Correct 77 ms 3124 KB Output is correct
48 Incorrect 43 ms 3664 KB Output isn't correct
49 Incorrect 66 ms 3672 KB Output isn't correct
50 Correct 92 ms 3672 KB Output is correct
51 Incorrect 50 ms 4228 KB Output isn't correct
52 Incorrect 74 ms 4200 KB Output isn't correct
53 Correct 101 ms 4208 KB Output is correct
54 Incorrect 56 ms 4900 KB Output isn't correct
55 Incorrect 86 ms 4844 KB Output isn't correct
56 Correct 136 ms 4808 KB Output is correct
57 Incorrect 62 ms 5488 KB Output isn't correct
58 Incorrect 102 ms 5448 KB Output isn't correct
59 Correct 149 ms 5536 KB Output is correct
60 Incorrect 74 ms 6172 KB Output isn't correct
61 Incorrect 111 ms 6144 KB Output isn't correct
62 Correct 156 ms 6184 KB Output is correct
63 Correct 130 ms 6148 KB Output is correct
64 Correct 206 ms 6144 KB Output is correct
65 Correct 199 ms 6164 KB Output is correct
66 Correct 156 ms 6136 KB Output is correct
67 Correct 143 ms 6164 KB Output is correct
68 Correct 66 ms 6200 KB Output is correct
69 Correct 63 ms 6160 KB Output is correct
70 Correct 54 ms 6200 KB Output is correct
71 Correct 47 ms 6160 KB Output is correct
72 Incorrect 55 ms 6200 KB Output isn't correct
73 Incorrect 94 ms 6168 KB Output isn't correct
74 Correct 84 ms 6168 KB Output is correct
75 Correct 93 ms 6164 KB Output is correct
76 Correct 87 ms 6156 KB Output is correct
77 Correct 87 ms 6296 KB Output is correct
78 Correct 105 ms 6136 KB Output is correct
79 Correct 75 ms 6144 KB Output is correct
80 Correct 84 ms 6144 KB Output is correct
81 Correct 101 ms 6152 KB Output is correct
82 Correct 87 ms 6200 KB Output is correct
83 Correct 110 ms 6152 KB Output is correct
84 Correct 95 ms 6152 KB Output is correct
85 Correct 94 ms 6160 KB Output is correct
86 Correct 120 ms 6236 KB Output is correct
87 Correct 103 ms 6152 KB Output is correct
88 Correct 110 ms 6148 KB Output is correct
89 Correct 109 ms 6144 KB Output is correct
90 Correct 118 ms 6148 KB Output is correct
91 Correct 113 ms 6148 KB Output is correct
92 Correct 116 ms 6184 KB Output is correct