oj.uz

답안 #221441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221441 2020-04-10T06:04:30 Z tatyam Mecho (IOI09_mecho) C++17
84 / 100
 211 ms 6356 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 = 0xfffff;
    while(ng - ok > 1){
        int cen = (ok + ng) / 2;
        if(check(cen)) ok = cen;
        else ng = cen;
    }
    cout << ok << endl;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 137 ms 6296 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 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 5 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 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 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 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 11 ms 1560 KB Output is correct
34 Correct 12 ms 1560 KB Output is correct
35 Correct 35 ms 1508 KB Output is correct
36 Correct 13 ms 1856 KB Output is correct
37 Correct 13 ms 1860 KB Output is correct
38 Correct 39 ms 1904 KB Output is correct
39 Correct 15 ms 2224 KB Output is correct
40 Correct 15 ms 2224 KB Output is correct
41 Correct 52 ms 2224 KB Output is correct
42 Correct 18 ms 2656 KB Output is correct
43 Correct 20 ms 2708 KB Output is correct
44 Correct 61 ms 2724 KB Output is correct
45 Correct 21 ms 3232 KB Output is correct
46 Correct 20 ms 3184 KB Output is correct
47 Correct 82 ms 3148 KB Output is correct
48 Correct 24 ms 3640 KB Output is correct
49 Correct 25 ms 3640 KB Output is correct
50 Correct 100 ms 3640 KB Output is correct
51 Correct 27 ms 4208 KB Output is correct
52 Correct 28 ms 4200 KB Output is correct
53 Correct 126 ms 4576 KB Output is correct
54 Correct 33 ms 4868 KB Output is correct
55 Correct 35 ms 4868 KB Output is correct
56 Correct 128 ms 4856 KB Output is correct
57 Correct 34 ms 5520 KB Output is correct
58 Correct 39 ms 5596 KB Output is correct
59 Correct 160 ms 5504 KB Output is correct
60 Correct 38 ms 6236 KB Output is correct
61 Correct 41 ms 6292 KB Output is correct
62 Correct 172 ms 6168 KB Output is correct
63 Correct 150 ms 6344 KB Output is correct
64 Correct 211 ms 6176 KB Output is correct
65 Correct 205 ms 6160 KB Output is correct
66 Correct 169 ms 6200 KB Output is correct
67 Correct 152 ms 6164 KB Output is correct
68 Correct 72 ms 6224 KB Output is correct
69 Correct 71 ms 6216 KB Output is correct
70 Correct 65 ms 6272 KB Output is correct
71 Correct 54 ms 6256 KB Output is correct
72 Incorrect 56 ms 6184 KB Output isn't correct
73 Incorrect 99 ms 6180 KB Output isn't correct
74 Correct 94 ms 6204 KB Output is correct
75 Correct 100 ms 6188 KB Output is correct
76 Correct 97 ms 6356 KB Output is correct
77 Correct 97 ms 6180 KB Output is correct
78 Correct 114 ms 6200 KB Output is correct
79 Correct 85 ms 6200 KB Output is correct
80 Correct 94 ms 6200 KB Output is correct
81 Correct 105 ms 6320 KB Output is correct
82 Correct 93 ms 6200 KB Output is correct
83 Correct 115 ms 6252 KB Output is correct
84 Correct 103 ms 6184 KB Output is correct
85 Correct 101 ms 6192 KB Output is correct
86 Correct 113 ms 6328 KB Output is correct
87 Correct 111 ms 6184 KB Output is correct
88 Correct 115 ms 6168 KB Output is correct
89 Correct 124 ms 6260 KB Output is correct
90 Correct 120 ms 6192 KB Output is correct
91 Correct 115 ms 6172 KB Output is correct
92 Correct 123 ms 6172 KB Output is correct