oj.uz

Submission #581518

# Submission time Handle Problem Language Result Execution time Memory
581518 2022-06-22T17:22:55 Z Saeed_247 Mecho (IOI09_mecho) C++17
59 / 100
 669 ms 12272 KB 
#include <bits/stdc++.h>
using namespace std;
template<typename T> void dout(string name, T arg) {
    cerr << name << " = " << arg << "\e[39m" << endl;
}
template<typename T1, typename... T2> void dout(string names, T1 arg, T2... args) {
    cerr << names.substr(0, names.find(',')) << " = " << arg << " | ";
    dout(names.substr(names.find(',') + 2), args...);
}
#define debug(...) cerr << "\e[91m" << "[" << __LINE__ << ":" << __func__ << "]=> ", dout(#__VA_ARGS__,  __VA_ARGS__);

const pair<int, int> dir[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int N = 800;
bool visited[N][N];
long long n, s;
vector<vector<char>> arr;
vector<pair<long long, long long>> hives;
pair<long long, long long> m, d;
queue<pair<long long, long long>> q;

bool move(int x, int y) {
    return x >= 0 && y >= 0 && x < n && y < n;
}

bool check(long long tim, vector<vector<long long>>& dist, vector<vector<long long>>& swarm) {
    memset(visited, false, sizeof visited);
    while (q.size()) q.pop();
    q.push(m);
    visited[m.first][m.second] = true;
    while (!q.empty()) {
        auto [x, y] = q.front();
        if (q.front() == d) return true;
        q.pop();
        for (auto [xx, yy] : dir) if (move(x + xx, y + yy) && (arr[x + xx][y + yy] == 'G' || 
            arr[x + xx][y + yy] == 'D') && !visited[x + xx][y + yy] && (dist[x + xx][y + yy] + tim < swarm[x + xx][y + yy] || 
                (dist[x + xx][y + yy] + tim == swarm[x + xx][y + yy] && dist[d.first][d.second] == dist[x + xx][y + yy]))) {
                q.push({x + xx, y + yy});
                visited[x + xx][y + yy] = true;
        }
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> s;
    arr.resize(n, vector<char> (n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> arr[i][j];
            if (arr[i][j] == 'M') {
                m = {i, j};
            }
            if (arr[i][j] == 'H') {
                hives.push_back({i, j});
            }
            if (arr[i][j] == 'D') {
                d = {i, j};
            }
        }
    }

    vector<vector<long long>> dist(n, vector<long long>(n, 1e18)), swarm(n, vector<long long>(n, 1e18));
    dist[m.first][m.second] = 0;
    q.push(m);
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        for (auto [xx, yy] : dir) if (move(x + xx, y + yy) && (arr[x + xx][y + yy] == 'G' || 
            arr[x + xx][y + yy] == 'D') && dist[x + xx][y + yy] > dist[x][y] + 1) {
                dist[x + xx][y + yy] = dist[x][y] + 1;
                q.push({x + xx, y + yy});
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            dist[i][j] = dist[i][j] / s + (dist[i][j] % s != 0);
        }
    }
    for (auto [x, y] : hives) {
        swarm[x][y] = 0;
        q.push({x, y});
    }
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        for (auto [xx, yy] : dir) if (move(x + xx, y + yy) && (arr[x + xx][y + yy] == 'G' || arr[x + xx][y + yy] == 'M')
             && swarm[x + xx][y + yy] > swarm[x][y] + 1) {
                swarm[x + xx][y + yy] = swarm[x][y] + 1;
                q.push({x + xx, y + yy});
        }
    }

    long long l = -1e9, h = 1e9;
    while (h - l > 1) {
        long long mid = (h + l) / 2;
        if (check(mid, dist, swarm)) l = mid;
        else h = mid;
    }
    if (l < 0)
        cout << -1 << '\n';
    else 
        cout << l << '\n';
    return 0;
}

Subtask #1
59.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Incorrect 1 ms 852 KB Output isn't correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 136 ms 11800 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Incorrect 2 ms 852 KB Output isn't correct
10 Incorrect 1 ms 852 KB Output isn't correct
11 Incorrect 1 ms 852 KB Output isn't correct
12 Incorrect 1 ms 980 KB Output isn't correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 3 ms 980 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 952 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 7 ms 3028 KB Output is correct
34 Correct 8 ms 2900 KB Output is correct
35 Incorrect 23 ms 3028 KB Output isn't correct
36 Correct 9 ms 3540 KB Output is correct
37 Correct 10 ms 3540 KB Output is correct
38 Incorrect 32 ms 3644 KB Output isn't correct
39 Correct 13 ms 4308 KB Output is correct
40 Correct 12 ms 4308 KB Output is correct
41 Incorrect 61 ms 4272 KB Output isn't correct
42 Correct 15 ms 5076 KB Output is correct
43 Correct 13 ms 5076 KB Output is correct
44 Incorrect 51 ms 5060 KB Output isn't correct
45 Correct 16 ms 5936 KB Output is correct
46 Correct 16 ms 5940 KB Output is correct
47 Incorrect 71 ms 6032 KB Output isn't correct
48 Correct 19 ms 6996 KB Output is correct
49 Correct 18 ms 6996 KB Output is correct
50 Incorrect 88 ms 6996 KB Output isn't correct
51 Correct 24 ms 7944 KB Output is correct
52 Correct 23 ms 7956 KB Output is correct
53 Incorrect 115 ms 8140 KB Output isn't correct
54 Correct 27 ms 9072 KB Output is correct
55 Correct 25 ms 9092 KB Output is correct
56 Incorrect 115 ms 9220 KB Output isn't correct
57 Correct 29 ms 10288 KB Output is correct
58 Correct 29 ms 10368 KB Output is correct
59 Incorrect 153 ms 10288 KB Output isn't correct
60 Correct 41 ms 11672 KB Output is correct
61 Correct 32 ms 11724 KB Output is correct
62 Incorrect 149 ms 11684 KB Output isn't correct
63 Incorrect 669 ms 11688 KB Output isn't correct
64 Incorrect 267 ms 11692 KB Output isn't correct
65 Incorrect 257 ms 11596 KB Output isn't correct
66 Correct 181 ms 11692 KB Output is correct
67 Correct 616 ms 11616 KB Output is correct
68 Incorrect 616 ms 11724 KB Output isn't correct
69 Incorrect 79 ms 11720 KB Output isn't correct
70 Incorrect 76 ms 11632 KB Output isn't correct
71 Incorrect 69 ms 11636 KB Output isn't correct
72 Correct 69 ms 11720 KB Output is correct
73 Correct 91 ms 12260 KB Output is correct
74 Correct 99 ms 12236 KB Output is correct
75 Correct 100 ms 12236 KB Output is correct
76 Correct 93 ms 12236 KB Output is correct
77 Correct 101 ms 12272 KB Output is correct
78 Correct 444 ms 12204 KB Output is correct
79 Correct 96 ms 12096 KB Output is correct
80 Correct 98 ms 12120 KB Output is correct
81 Correct 101 ms 12172 KB Output is correct
82 Correct 102 ms 12216 KB Output is correct
83 Correct 112 ms 12128 KB Output is correct
84 Correct 113 ms 12128 KB Output is correct
85 Correct 104 ms 12108 KB Output is correct
86 Correct 129 ms 12016 KB Output is correct
87 Correct 128 ms 12128 KB Output is correct
88 Correct 109 ms 12084 KB Output is correct
89 Correct 119 ms 11976 KB Output is correct
90 Correct 174 ms 11976 KB Output is correct
91 Correct 129 ms 11988 KB Output is correct
92 Correct 114 ms 12020 KB Output is correct