답안 #953991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
953991	2024-03-27T04:09:48 Z	Github	Mecho (IOI09_mecho)	C++17	81 / 100	187 ms	12636 KB

mecho

#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long

const ll MAXN = 810;
ll bee[MAXN][MAXN];
ll dist[MAXN][MAXN];
//pair<ll,ll> parent[MAXN][MAXN];
bool vis[MAXN][MAXN];
ll dX[] = {1, -1, 0, 0};
ll dY[] = {0, 0, 1, -1};
pair<ll, ll> mencho, den;
vector<string> grid;
ll n, s;

bool compute(ll k){
    memset(dist, 0, sizeof dist);
    if (k >= bee[mencho.first][mencho.second]){
        for (int i = 0; i < 4; i++){
            ll nX = den.first+dX[i], nY = den.second+dY[i];
            bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n;
            if (b1) {
                continue;
            }
            bool b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H';
            if (b2){
                continue;
            }
            /*if (nX < 0 || nX >= n || nY < 0 || nY >= n || grid[nX][nY] == 'T' || grid[nX][nY] == 'H') {
                continue;
            }*/
            ll cur_time = dist[nX][nY]/s;
            if ((bee[nX][nY]-k) > cur_time){
                return true;
            }
        }
        return false;
    }
    for (ll i = 0; i < MAXN; i++){
        for (ll j = 0; j < MAXN; j++){
            dist[i][j] = 1e9;
            //parent[i][j] = {-1, -1};
            vis[i][j] = false;
        }
    }
    queue<pair<ll, ll>> q;
    q.push(mencho);
    dist[mencho.first][mencho.second] = 0;
    while (!q.empty()){
        ll x = q.front().first, y = q.front().second; q.pop();
        vis[x][y] = true;
        if (make_pair(x, y) == den){
            break;
        }
        for (ll i = 0; i < 4; i++){
            ll nX = x + dX[i], nY = y+dY[i];
            bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n;
            if (b1){
                continue;
            }
            bool b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H' || grid[nX][nY] == 'D';
            if (b2){
                continue;
            }
            /*if (nX < 0 || nX >= n || nY < 0 || nY >= n || grid[nX][nY] == 'T' || grid[nX][nY] == 'H' || grid[nX][nY] == 'D'){
                continue;
            }*/
            ll cur_time = (dist[x][y] + 1) / s;
            if (!vis[nX][nY]) {
                if ((dist[nX][nY] > dist[x][y] + 1) && ((bee[nX][nY] - k) > cur_time)) {
                    dist[nX][nY] = dist[x][y] + 1;
                    //parent[nX][nY] = {x, y};
                    q.push({nX, nY});
                }
            }
        }
    }
    for (int i = 0; i < 4; i++){
        ll nX = den.first+dX[i], nY = den.second+dY[i];
        bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n;
        if (b1) {
            continue;
        }
        bool b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'H';
        if (b2){
            continue;
        }
        /*if (nX < 0 || nX >= n || nY < 0 || nY >= n || grid[nX][nY] == 'T' || grid[nX][nY] == 'H') {
            continue;
        }*/
        ll cur_time = dist[nX][nY]/s;
        if ((bee[nX][nY]-k) > cur_time){
            return true;
        }
    }
    return false;
}

int main() {
    speedup
    cin >> n >> s;
    grid.resize(n);
    vector<pair<ll, ll>> start;
    for (ll i = 0; i < n; i++){
        string st; cin >> st;
        grid[i] = st;
        for (ll j = 0; j < n; j++){
            if (st[j] == 'H'){
                start.push_back({i, j});
            }else if (st[j] == 'M'){
                mencho = {i, j};
            }else if (st[j] == 'D'){
                den = {i, j};
            }
        }
    }
    for (ll i = 0; i < MAXN; i++){
        for (ll j = 0; j < MAXN; j++){
            bee[i][j] = 1e9;
            vis[i][j] = false;
        }
    }
    queue<pair<ll, ll>> q;
    for (pair<ll, ll> p: start){
        bee[p.first][p.second] = 0;
        q.push({p.first, p.second});
    }
    while (!q.empty()){
        ll x = q.front().first, y = q.front().second; q.pop();
        vis[x][y] = true;
        for (ll i = 0; i < 4; i++){
            ll nX = x + dX[i], nY = y+dY[i];
            bool b1 = nX < 0 || nX >= n || nY < 0 || nY >= n;
            if (b1){
                continue;
            }
            bool b2 = grid[nX][nY] == 'T' || grid[nX][nY] == 'D';
            if (b2){
                continue;
            }
            if ((bee[nX][nY] > (bee[x][y]+1)) && !vis[nX][nY]){
                bee[nX][nY] = bee[x][y]+1;
                q.push({nX, nY});
            }
        }
    }
    ll l = 0, h = n*n, mid, ans = -1;
    while (l <= h){
        mid = (l+h)/2;
        if (compute(mid)){
            ans = mid;
            l = mid+1;
        }else{
            h = mid-1;
        }
    }
    cout << ans << endl;
    return 0;
}

Subtask #1

81.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	11352 KB	Output is correct
2	Correct	3 ms	11372 KB	Output is correct
3	Incorrect	3 ms	11356 KB	Output isn't correct
4	Correct	3 ms	11352 KB	Output is correct
5	Incorrect	4 ms	11356 KB	Output isn't correct
6	Correct	3 ms	11368 KB	Output is correct
7	Correct	62 ms	12120 KB	Output is correct
8	Correct	3 ms	11356 KB	Output is correct
9	Incorrect	3 ms	11356 KB	Output isn't correct
10	Correct	4 ms	11372 KB	Output is correct
11	Incorrect	3 ms	11356 KB	Output isn't correct
12	Correct	4 ms	11356 KB	Output is correct
13	Incorrect	3 ms	11356 KB	Output isn't correct
14	Correct	4 ms	11208 KB	Output is correct
15	Correct	5 ms	11352 KB	Output is correct
16	Correct	4 ms	11356 KB	Output is correct
17	Correct	6 ms	11356 KB	Output is correct
18	Correct	6 ms	11356 KB	Output is correct
19	Correct	5 ms	11356 KB	Output is correct
20	Correct	4 ms	11356 KB	Output is correct
21	Correct	5 ms	11376 KB	Output is correct
22	Correct	4 ms	11352 KB	Output is correct
23	Correct	5 ms	11356 KB	Output is correct
24	Correct	4 ms	11356 KB	Output is correct
25	Correct	5 ms	11352 KB	Output is correct
26	Correct	5 ms	11356 KB	Output is correct
27	Correct	5 ms	11356 KB	Output is correct
28	Correct	6 ms	11356 KB	Output is correct
29	Correct	5 ms	11356 KB	Output is correct
30	Correct	5 ms	11356 KB	Output is correct
31	Correct	5 ms	11356 KB	Output is correct
32	Correct	6 ms	11356 KB	Output is correct
33	Correct	9 ms	11356 KB	Output is correct
34	Correct	9 ms	11508 KB	Output is correct
35	Correct	22 ms	11356 KB	Output is correct
36	Correct	9 ms	11352 KB	Output is correct
37	Correct	10 ms	11352 KB	Output is correct
38	Correct	24 ms	11356 KB	Output is correct
39	Correct	10 ms	11600 KB	Output is correct
40	Correct	10 ms	11604 KB	Output is correct
41	Correct	35 ms	11608 KB	Output is correct
42	Correct	14 ms	11612 KB	Output is correct
43	Correct	13 ms	11612 KB	Output is correct
44	Correct	45 ms	11656 KB	Output is correct
45	Correct	12 ms	11608 KB	Output is correct
46	Correct	12 ms	11612 KB	Output is correct
47	Correct	44 ms	11612 KB	Output is correct
48	Correct	13 ms	11608 KB	Output is correct
49	Correct	13 ms	11608 KB	Output is correct
50	Correct	50 ms	11612 KB	Output is correct
51	Correct	14 ms	11608 KB	Output is correct
52	Correct	14 ms	11608 KB	Output is correct
53	Correct	87 ms	11612 KB	Output is correct
54	Correct	19 ms	11864 KB	Output is correct
55	Correct	16 ms	11868 KB	Output is correct
56	Correct	74 ms	11868 KB	Output is correct
57	Correct	17 ms	11868 KB	Output is correct
58	Correct	17 ms	11868 KB	Output is correct
59	Correct	122 ms	11868 KB	Output is correct
60	Correct	18 ms	12056 KB	Output is correct
61	Correct	24 ms	12380 KB	Output is correct
62	Correct	100 ms	12080 KB	Output is correct
63	Correct	90 ms	11868 KB	Output is correct
64	Correct	187 ms	11868 KB	Output is correct
65	Correct	127 ms	12120 KB	Output is correct
66	Correct	104 ms	11864 KB	Output is correct
67	Correct	99 ms	11868 KB	Output is correct
68	Incorrect	22 ms	12120 KB	Output isn't correct
69	Incorrect	23 ms	12124 KB	Output isn't correct
70	Incorrect	23 ms	12124 KB	Output isn't correct
71	Incorrect	29 ms	12120 KB	Output isn't correct
72	Incorrect	22 ms	11856 KB	Output isn't correct
73	Incorrect	21 ms	12636 KB	Output isn't correct
74	Correct	43 ms	12604 KB	Output is correct
75	Correct	59 ms	12636 KB	Output is correct
76	Correct	46 ms	12632 KB	Output is correct
77	Correct	48 ms	12636 KB	Output is correct
78	Correct	74 ms	12564 KB	Output is correct
79	Correct	38 ms	12592 KB	Output is correct
80	Correct	50 ms	12372 KB	Output is correct
81	Correct	60 ms	12568 KB	Output is correct
82	Correct	57 ms	12380 KB	Output is correct
83	Correct	64 ms	12484 KB	Output is correct
84	Correct	59 ms	12380 KB	Output is correct
85	Correct	59 ms	12376 KB	Output is correct
86	Correct	63 ms	12376 KB	Output is correct
87	Correct	57 ms	12376 KB	Output is correct
88	Correct	69 ms	12396 KB	Output is correct
89	Correct	68 ms	12380 KB	Output is correct
90	Correct	72 ms	12380 KB	Output is correct
91	Correct	65 ms	12140 KB	Output is correct
92	Correct	74 ms	12376 KB	Output is correct