답안 #581491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581491	2022-06-22T17:05:36 Z	Saeed_247	Mecho (IOI09_mecho)	C++17	47 / 100	223 ms	12280 KB

mecho

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

Subtask #1

47.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	Correct	2 ms	852 KB	Output is correct
6	Correct	1 ms	852 KB	Output is correct
7	Correct	114 ms	11892 KB	Output is correct
8	Incorrect	1 ms	852 KB	Output isn't correct
9	Incorrect	1 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	1 ms	980 KB	Output is correct
14	Incorrect	2 ms	980 KB	Output isn't correct
15	Correct	1 ms	852 KB	Output is correct
16	Correct	1 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	980 KB	Output is correct
22	Correct	1 ms	980 KB	Output is correct
23	Correct	2 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	1 ms	980 KB	Output is correct
27	Correct	1 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	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	8 ms	2920 KB	Output is correct
34	Correct	7 ms	3028 KB	Output is correct
35	Incorrect	24 ms	3156 KB	Output isn't correct
36	Correct	9 ms	3540 KB	Output is correct
37	Correct	9 ms	3540 KB	Output is correct
38	Incorrect	32 ms	3540 KB	Output isn't correct
39	Correct	14 ms	4264 KB	Output is correct
40	Correct	12 ms	4308 KB	Output is correct
41	Incorrect	51 ms	4356 KB	Output isn't correct
42	Correct	15 ms	5076 KB	Output is correct
43	Correct	14 ms	5056 KB	Output is correct
44	Incorrect	49 ms	5064 KB	Output isn't correct
45	Correct	18 ms	5940 KB	Output is correct
46	Correct	18 ms	5972 KB	Output is correct
47	Incorrect	69 ms	6032 KB	Output isn't correct
48	Correct	19 ms	6892 KB	Output is correct
49	Correct	20 ms	6900 KB	Output is correct
50	Incorrect	103 ms	6996 KB	Output isn't correct
51	Correct	24 ms	7948 KB	Output is correct
52	Correct	22 ms	7936 KB	Output is correct
53	Incorrect	104 ms	7960 KB	Output isn't correct
54	Correct	26 ms	9064 KB	Output is correct
55	Correct	25 ms	9084 KB	Output is correct
56	Incorrect	114 ms	9184 KB	Output isn't correct
57	Correct	33 ms	10288 KB	Output is correct
58	Correct	31 ms	10284 KB	Output is correct
59	Incorrect	197 ms	10372 KB	Output isn't correct
60	Correct	34 ms	11584 KB	Output is correct
61	Correct	32 ms	11580 KB	Output is correct
62	Incorrect	148 ms	11720 KB	Output isn't correct
63	Correct	146 ms	11708 KB	Output is correct
64	Incorrect	223 ms	11728 KB	Output isn't correct
65	Incorrect	208 ms	11696 KB	Output isn't correct
66	Correct	172 ms	11692 KB	Output is correct
67	Incorrect	175 ms	11584 KB	Output isn't correct
68	Correct	75 ms	11740 KB	Output is correct
69	Incorrect	78 ms	11732 KB	Output isn't correct
70	Incorrect	71 ms	11732 KB	Output isn't correct
71	Incorrect	76 ms	11708 KB	Output isn't correct
72	Incorrect	76 ms	11724 KB	Output isn't correct
73	Incorrect	95 ms	12276 KB	Output isn't correct
74	Correct	92 ms	12232 KB	Output is correct
75	Correct	97 ms	12272 KB	Output is correct
76	Correct	92 ms	12280 KB	Output is correct
77	Correct	100 ms	12244 KB	Output is correct
78	Incorrect	103 ms	12248 KB	Output isn't correct
79	Correct	85 ms	12132 KB	Output is correct
80	Correct	86 ms	12132 KB	Output is correct
81	Correct	104 ms	12100 KB	Output is correct
82	Correct	92 ms	12104 KB	Output is correct
83	Correct	111 ms	12120 KB	Output is correct
84	Correct	97 ms	12124 KB	Output is correct
85	Correct	95 ms	12072 KB	Output is correct
86	Correct	101 ms	12132 KB	Output is correct
87	Correct	110 ms	12128 KB	Output is correct
88	Correct	139 ms	11972 KB	Output is correct
89	Correct	112 ms	11976 KB	Output is correct
90	Correct	114 ms	12012 KB	Output is correct
91	Correct	114 ms	12020 KB	Output is correct
92	Correct	117 ms	11908 KB	Output is correct