oj.uz

답안 #581512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581512 2022-06-22T17:18:09 Z Saeed_247 Mecho (IOI09_mecho) C++17
54 / 100
 675 ms 12328 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' && 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
54.0 / 100.0

# 결과 실행 시간 메모리 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 127 ms 11852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Incorrect 1 ms 852 KB Output isn't correct
10 Incorrect 1 ms 852 KB Output isn't correct
11 Incorrect 2 ms 852 KB Output isn't correct
12 Incorrect 1 ms 980 KB Output isn't correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 3 ms 1028 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 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 852 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 2 ms 980 KB Output is correct
33 Correct 8 ms 2900 KB Output is correct
34 Correct 8 ms 3028 KB Output is correct
35 Incorrect 29 ms 3028 KB Output isn't correct
36 Correct 10 ms 3572 KB Output is correct
37 Correct 8 ms 3540 KB Output is correct
38 Incorrect 34 ms 3556 KB Output isn't correct
39 Correct 13 ms 4308 KB Output is correct
40 Correct 12 ms 4252 KB Output is correct
41 Incorrect 41 ms 4272 KB Output isn't correct
42 Correct 13 ms 5076 KB Output is correct
43 Correct 16 ms 5076 KB Output is correct
44 Incorrect 56 ms 5156 KB Output isn't correct
45 Correct 17 ms 5936 KB Output is correct
46 Correct 16 ms 6036 KB Output is correct
47 Incorrect 73 ms 6044 KB Output isn't correct
48 Correct 21 ms 6996 KB Output is correct
49 Correct 24 ms 6900 KB Output is correct
50 Incorrect 89 ms 6896 KB Output isn't correct
51 Correct 24 ms 7932 KB Output is correct
52 Correct 21 ms 7944 KB Output is correct
53 Incorrect 93 ms 7960 KB Output isn't correct
54 Correct 27 ms 9144 KB Output is correct
55 Correct 30 ms 9136 KB Output is correct
56 Incorrect 135 ms 9180 KB Output isn't correct
57 Correct 31 ms 10288 KB Output is correct
58 Correct 30 ms 10272 KB Output is correct
59 Incorrect 135 ms 10376 KB Output isn't correct
60 Correct 34 ms 11596 KB Output is correct
61 Correct 31 ms 11604 KB Output is correct
62 Incorrect 163 ms 11584 KB Output isn't correct
63 Incorrect 675 ms 11692 KB Output isn't correct
64 Incorrect 242 ms 11592 KB Output isn't correct
65 Incorrect 235 ms 11688 KB Output isn't correct
66 Correct 166 ms 11692 KB Output is correct
67 Correct 627 ms 11696 KB Output is correct
68 Incorrect 618 ms 11744 KB Output isn't correct
69 Incorrect 88 ms 11724 KB Output isn't correct
70 Incorrect 84 ms 11712 KB Output isn't correct
71 Incorrect 80 ms 11748 KB Output isn't correct
72 Incorrect 67 ms 11720 KB Output isn't correct
73 Incorrect 99 ms 12280 KB Output isn't correct
74 Correct 106 ms 12224 KB Output is correct
75 Correct 110 ms 12240 KB Output is correct
76 Correct 103 ms 12256 KB Output is correct
77 Correct 98 ms 12276 KB Output is correct
78 Correct 445 ms 12328 KB Output is correct
79 Correct 110 ms 12108 KB Output is correct
80 Correct 94 ms 12128 KB Output is correct
81 Correct 103 ms 12128 KB Output is correct
82 Correct 100 ms 12108 KB Output is correct
83 Correct 113 ms 12004 KB Output is correct
84 Correct 118 ms 12120 KB Output is correct
85 Correct 114 ms 12128 KB Output is correct
86 Correct 122 ms 12020 KB Output is correct
87 Correct 197 ms 12060 KB Output is correct
88 Correct 115 ms 11988 KB Output is correct
89 Correct 126 ms 11980 KB Output is correct
90 Correct 155 ms 11980 KB Output is correct
91 Correct 133 ms 12244 KB Output is correct
92 Correct 129 ms 12008 KB Output is correct