답안 #978536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978536	2024-05-09T10:09:46 Z	Bodisha	Mecho (IOI09_mecho)	C++17	72 / 100	1000 ms	7508 KB

mecho

#include <bits/stdc++.h>
#define MAX_N 801
 
using namespace std;
 
int n, s;
char grid[MAX_N][MAX_N];
bool visited[MAX_N][MAX_N];
int beed[MAX_N][MAX_N];
int steps[MAX_N][MAX_N];
 
bool check(int t) {
    pair<int, int> mecho_pos, home_pos;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            visited[i][j] = false;
            steps[i][j] = n * n;
            if(grid[i][j] == 'M') {
                mecho_pos = {i, j};
            }
            if(grid[i][j] == 'D') {
                home_pos = {i, j};
            }
        }
    }
    queue<pair<int, int>> q;
    visited[mecho_pos.first][mecho_pos.second] = true;
    steps[mecho_pos.first][mecho_pos.second] = 0;
    q.push(mecho_pos);
    while(!q.empty()) {
        pair<int, int> curr = q.front(); 
        q.pop();
        if(curr.first + 1 < n && !visited[curr.first + 1][curr.second] && (grid[curr.first + 1][curr.second] == 'G' || grid[curr.first + 1][curr.second] == 'M' || grid[curr.first + 1][curr.second] == 'D')) {
            visited[curr.first + 1][curr.second] = true;
            steps[curr.first + 1][curr.second] = steps[curr.first][curr.second] + 1;
            q.push({curr.first + 1, curr.second});
        }
        if(curr.first - 1 >= 0 && !visited[curr.first - 1][curr.second] && (grid[curr.first - 1][curr.second] == 'G' || grid[curr.first - 1][curr.second] == 'M' || grid[curr.first - 1][curr.second] == 'D')) {
            visited[curr.first - 1][curr.second] = true;
            steps[curr.first - 1][curr.second] = steps[curr.first][curr.second] + 1;
            q.push({curr.first - 1, curr.second});
        }
        if(curr.second + 1 < n && !visited[curr.first][curr.second + 1] && (grid[curr.first][curr.second + 1] == 'G' || grid[curr.first][curr.second + 1] == 'M' || grid[curr.first][curr.second + 1] == 'D')) {
            visited[curr.first][curr.second + 1] = true;
            steps[curr.first][curr.second + 1] = steps[curr.first][curr.second] + 1;
            q.push({curr.first, curr.second + 1});
        }
        if(curr.second - 1 >= 0 && !visited[curr.first][curr.second - 1] && (grid[curr.first][curr.second - 1] == 'G' || grid[curr.first][curr.second - 1] == 'M' || grid[curr.first][curr.second - 1] == 'D')) {
            visited[curr.first][curr.second - 1] = true;
            steps[curr.first][curr.second - 1] = steps[curr.first][curr.second] + 1;
            q.push({curr.first, curr.second - 1});
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            visited[i][j] = false;
        }
    }
    if(t + 1 > beed[mecho_pos.first][mecho_pos.second]) {
        return false;
    }
    queue<pair<pair<int, int>, int>> newq;
    visited[mecho_pos.first][mecho_pos.second] = true;
    newq.push({mecho_pos, 0});
    while(!newq.empty()) {
        pair<pair<int, int>, int> curr = newq.front(); 
        newq.pop();
        int tmp = t + 1 + ((curr.second + 1) / (s));
        if(curr.first.first + 1 < n && tmp <= beed[curr.first.first + 1][curr.first.second] && !visited[curr.first.first + 1][curr.first.second] && (grid[curr.first.first + 1][curr.first.second] == 'G' || grid[curr.first.first + 1][curr.first.second] == 'M' || grid[curr.first.first + 1][curr.first.second] == 'D')) {
            visited[curr.first.first + 1][curr.first.second] = true;
            newq.push({{curr.first.first + 1, curr.first.second}, curr.second + 1});
        }
        if(curr.first.first - 1 >= 0 && tmp <= beed[curr.first.first - 1][curr.first.second] && !visited[curr.first.first - 1][curr.second] && (grid[curr.first.first - 1][curr.first.second] == 'G' || grid[curr.first.first - 1][curr.first.second] == 'M' || grid[curr.first.first - 1][curr.first.second] == 'D')) {
            visited[curr.first.first - 1][curr.first.second] = true;
            newq.push({{curr.first.first - 1, curr.first.second}, curr.second + 1});
        }
        if(curr.first.second + 1 < n && tmp <= beed[curr.first.first][curr.first.second + 1] && !visited[curr.first.first][curr.first.second + 1] && (grid[curr.first.first][curr.first.second + 1] == 'G' || grid[curr.first.first][curr.first.second + 1] == 'M' || grid[curr.first.first][curr.first.second + 1] == 'D')) {
            visited[curr.first.first][curr.first.second + 1] = true;
            newq.push({{curr.first.first, curr.first.second + 1}, curr.second + 1});
        }
        if(curr.first.second - 1 >= 0 && tmp <= beed[curr.first.first][curr.first.second - 1] && !visited[curr.first.first][curr.first.second - 1] && (grid[curr.first.first][curr.first.second - 1] == 'G' || grid[curr.first.first][curr.first.second - 1] == 'M' || grid[curr.first.first][curr.first.second - 1] == 'D')) {
            visited[curr.first.first][curr.first.second - 1] = true;
            newq.push({{curr.first.first, curr.first.second - 1}, curr.second + 1});
        }
    }
    return visited[home_pos.first + 1][home_pos.second] || visited[home_pos.first - 1][home_pos.second] || visited[home_pos.first - 1][home_pos.second] || visited[home_pos.first][home_pos.second + 1] || visited[home_pos.first][home_pos.second - 1];
}
 
int main() {
    vector<pair<int, int>> hives;
    cin >> n >> s;
    for(int i = 0; i < n; i++) {
        string tmp;
        cin >> tmp;
        for(int j = 0; j < n; j++) {
            grid[i][j] = tmp[j];
            if(grid[i][j] == 'H') {
                hives.push_back({i, j});
            }
        }
    }
    queue<pair<int, int>> q;
    for(auto iter : hives) {
        visited[iter.first][iter.second] = true;
        beed[iter.first][iter.second] = 0;
        q.push(iter);
    }
    while(!q.empty()) {
        pair<int, int> curr = q.front(); 
        q.pop();
        if(curr.first + 1 < n && !visited[curr.first + 1][curr.second] && (grid[curr.first + 1][curr.second] == 'G' || grid[curr.first + 1][curr.second] == 'M')) {
            visited[curr.first + 1][curr.second] = true;
            beed[curr.first + 1][curr.second] = beed[curr.first][curr.second] + 1;
            q.push({curr.first + 1, curr.second});
        }
        if(curr.first - 1 >= 0 && !visited[curr.first - 1][curr.second] && (grid[curr.first - 1][curr.second] == 'G' || grid[curr.first - 1][curr.second] == 'M')) {
            visited[curr.first - 1][curr.second] = true;
            beed[curr.first - 1][curr.second] = beed[curr.first][curr.second] + 1;
            q.push({curr.first - 1, curr.second});
        }
        if(curr.second + 1 < n && !visited[curr.first][curr.second + 1] && (grid[curr.first][curr.second + 1] == 'G' || grid[curr.first][curr.second + 1] == 'M')) {
            visited[curr.first][curr.second + 1] = true;
            beed[curr.first][curr.second + 1] = beed[curr.first][curr.second] + 1;
            q.push({curr.first, curr.second + 1});
        }
        if(curr.second - 1 >= 0 && !visited[curr.first][curr.second - 1] && (grid[curr.first][curr.second - 1] == 'G' || grid[curr.first][curr.second - 1] == 'M')) {
            visited[curr.first][curr.second - 1] = true;
            beed[curr.first][curr.second - 1] = beed[curr.first][curr.second] + 1;
            q.push({curr.first, curr.second - 1});
        }
    }
    int l = 0, r = n * n;
    int ans = -1;
    // true true true ... (true) false false
    while(l <= r) {
        int mid = l + (r - l) / 2;
        if(check(mid)) {
            ans = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    cout << ans;
    return 0;
}

Subtask #1

72.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Execution timed out	1058 ms	7088 KB	Time limit exceeded
8	Correct	1 ms	2648 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	4700 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	2 ms	4700 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1 ms	4700 KB	Output is correct
26	Correct	2 ms	4700 KB	Output is correct
27	Correct	1 ms	4700 KB	Output is correct
28	Correct	1 ms	4724 KB	Output is correct
29	Correct	2 ms	4700 KB	Output is correct
30	Correct	1 ms	4700 KB	Output is correct
31	Correct	2 ms	4700 KB	Output is correct
32	Correct	1 ms	4700 KB	Output is correct
33	Correct	23 ms	5276 KB	Output is correct
34	Correct	19 ms	5248 KB	Output is correct
35	Correct	327 ms	5460 KB	Output is correct
36	Correct	29 ms	5208 KB	Output is correct
37	Correct	22 ms	5212 KB	Output is correct
38	Correct	328 ms	5560 KB	Output is correct
39	Correct	37 ms	5416 KB	Output is correct
40	Correct	31 ms	5208 KB	Output is correct
41	Correct	353 ms	5688 KB	Output is correct
42	Correct	50 ms	5468 KB	Output is correct
43	Correct	34 ms	5464 KB	Output is correct
44	Correct	476 ms	6120 KB	Output is correct
45	Correct	65 ms	5556 KB	Output is correct
46	Correct	46 ms	5468 KB	Output is correct
47	Correct	546 ms	6136 KB	Output is correct
48	Correct	68 ms	5724 KB	Output is correct
49	Correct	49 ms	5720 KB	Output is correct
50	Correct	596 ms	6128 KB	Output is correct
51	Correct	84 ms	5980 KB	Output is correct
52	Correct	59 ms	5980 KB	Output is correct
53	Correct	580 ms	6420 KB	Output is correct
54	Correct	101 ms	6236 KB	Output is correct
55	Correct	67 ms	6236 KB	Output is correct
56	Correct	508 ms	6552 KB	Output is correct
57	Correct	116 ms	6460 KB	Output is correct
58	Correct	77 ms	6236 KB	Output is correct
59	Correct	498 ms	6988 KB	Output is correct
60	Correct	132 ms	6736 KB	Output is correct
61	Correct	87 ms	6492 KB	Output is correct
62	Incorrect	350 ms	6996 KB	Output isn't correct
63	Incorrect	267 ms	6952 KB	Output isn't correct
64	Incorrect	283 ms	6492 KB	Output isn't correct
65	Incorrect	281 ms	6712 KB	Output isn't correct
66	Incorrect	292 ms	6696 KB	Output isn't correct
67	Correct	285 ms	6480 KB	Output is correct
68	Incorrect	229 ms	6724 KB	Output isn't correct
69	Incorrect	221 ms	6492 KB	Output isn't correct
70	Incorrect	217 ms	6748 KB	Output isn't correct
71	Incorrect	232 ms	6724 KB	Output isn't correct
72	Correct	222 ms	6748 KB	Output is correct
73	Correct	443 ms	7504 KB	Output is correct
74	Execution timed out	1052 ms	7192 KB	Time limit exceeded
75	Execution timed out	1050 ms	7188 KB	Time limit exceeded
76	Execution timed out	1057 ms	7308 KB	Time limit exceeded
77	Execution timed out	1029 ms	7364 KB	Time limit exceeded
78	Execution timed out	1028 ms	7292 KB	Time limit exceeded
79	Execution timed out	1045 ms	7400 KB	Time limit exceeded
80	Execution timed out	1016 ms	7188 KB	Time limit exceeded
81	Execution timed out	1053 ms	7472 KB	Time limit exceeded
82	Execution timed out	1022 ms	7236 KB	Time limit exceeded
83	Correct	884 ms	7468 KB	Output is correct
84	Correct	786 ms	6960 KB	Output is correct
85	Correct	780 ms	7508 KB	Output is correct
86	Correct	856 ms	6920 KB	Output is correct
87	Correct	869 ms	7192 KB	Output is correct
88	Correct	964 ms	7124 KB	Output is correct
89	Correct	919 ms	7000 KB	Output is correct
90	Correct	959 ms	7088 KB	Output is correct
91	Correct	982 ms	7092 KB	Output is correct
92	Execution timed out	1046 ms	6872 KB	Time limit exceeded