답안 #1100714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1100714	2024-10-14T13:47:50 Z	Uniq0rn	Mecho (IOI09_mecho)	C++14	87 / 100	201 ms	6292 KB

mecho

#include <bits/stdc++.h>
using namespace std;
 
#define ld long double 
#define ll long long int
#define pi pair<int,int>
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n,s;cin >> n >> s;
    vector<vector<char>> a(n + 1,vector<char>(n + 1));
    queue<pair<int,int>> qu;
    vector<vector<int>> bdist(n + 1,vector<int>(n + 1,1e9));
    int si = -1,sj = -1,ei = -1,ej = -1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin >> a[i][j];
            if(a[i][j] == 'H'){
                bdist[i][j] = 0;
                qu.push({i,j});
            }
            if(a[i][j] == 'M'){
                si = i;
                sj = j;
            }
            if(a[i][j] == 'D'){
                ei = i;
                ej = j;
            }
        }
    }
    while(sz(qu)){
        int ni = qu.front().first,nj = qu.front().second;
        qu.pop();
        for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
            if(abs(i) == abs(j)) continue;
            int ii = ni + i,jj = nj + j;
            if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
            if(bdist[ii][jj] != 1e9 || a[ii][jj] == 'T' || a[ii][jj] == 'D') continue;
            bdist[ii][jj] = bdist[ni][nj] + 1;
            qu.push({ii,jj});
        }
    }
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout << (bdist[i][j] == 1e9 ? -1 : bdist[i][j]) << ' ';
        }
        cout << '\n';
    }
    cout << "---------------------------------------------\n";
    */
    int ans = -1;
    int l = 0,r = n * n;
    while(l <= r){
        int mid = (l + r) >> 1;
        //cout << mid << '\n';
        vector<vector<int>> dist(n + 1,vector<int>(n + 1,1e9));
        queue<pair<int,int>> q;
        q.push({si,sj});
        dist[si][sj] = 0;
        bool ok = false;
        while(sz(q)){
            int ni = q.front().first,nj = q.front().second;
            q.pop();
            for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
                if(abs(i) == abs(j)) continue;
                int ii = ni + i,jj = nj + j;
                if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
                if(dist[ii][jj] != 1e9) continue;
                if(bdist[ii][jj] <= mid + (dist[ni][nj] + 1) / s) continue;
                if(a[ii][jj] == 'T') continue;
                //cout << ni << ' ' << nj << ' ' << (dist[ni][nj] + s - 1) / s  <<   '\n';
                dist[ii][jj] = dist[ni][nj] + 1;
                q.push({ii,jj});
            }
        }
        for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
            if(abs(i) == abs(j)) continue;
            int ii = ei + i,jj = ej + j;
            if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
            if(a[ii][jj] == 'T' || a[ii][jj] == 'H') continue;
            if(dist[ii][jj] / s + mid < bdist[ii][jj]){
                ok = true;
            }
        }
        /*
        for(int i=1;i<=n;i++) {
            for(int j=1;j<=n;j++) {
                cout << dist[i][j] << ' ';
            }
            cout << '\n';
        }
        */
        if(ok){
            l = mid + 1;
            ans = mid;
        }
        else r = mid - 1;
    }
    cout << ans;
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout << bdist[i][j] << ' ';
        }
        cout << '\n';
    }
    */
    return 0;
}

Subtask #1

87.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Incorrect	1 ms	336 KB	Output isn't correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	111 ms	6228 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Incorrect	1 ms	336 KB	Output isn't correct
14	Correct	1 ms	552 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	504 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	1 ms	504 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	9 ms	1572 KB	Output is correct
34	Correct	9 ms	1764 KB	Output is correct
35	Correct	24 ms	1604 KB	Output is correct
36	Correct	11 ms	2040 KB	Output is correct
37	Correct	12 ms	1888 KB	Output is correct
38	Correct	42 ms	1872 KB	Output is correct
39	Correct	15 ms	2304 KB	Output is correct
40	Correct	15 ms	2304 KB	Output is correct
41	Correct	44 ms	2364 KB	Output is correct
42	Correct	19 ms	2768 KB	Output is correct
43	Correct	26 ms	2728 KB	Output is correct
44	Correct	54 ms	2768 KB	Output is correct
45	Correct	21 ms	3216 KB	Output is correct
46	Correct	24 ms	3244 KB	Output is correct
47	Correct	65 ms	3252 KB	Output is correct
48	Correct	25 ms	3704 KB	Output is correct
49	Correct	28 ms	3764 KB	Output is correct
50	Correct	76 ms	3876 KB	Output is correct
51	Correct	32 ms	4332 KB	Output is correct
52	Correct	33 ms	4328 KB	Output is correct
53	Correct	94 ms	4284 KB	Output is correct
54	Correct	34 ms	4888 KB	Output is correct
55	Correct	36 ms	4900 KB	Output is correct
56	Correct	115 ms	4920 KB	Output is correct
57	Correct	40 ms	5572 KB	Output is correct
58	Correct	43 ms	5568 KB	Output is correct
59	Correct	129 ms	5548 KB	Output is correct
60	Correct	46 ms	6228 KB	Output is correct
61	Correct	50 ms	6224 KB	Output is correct
62	Correct	175 ms	6232 KB	Output is correct
63	Correct	130 ms	6268 KB	Output is correct
64	Correct	201 ms	6236 KB	Output is correct
65	Correct	155 ms	6224 KB	Output is correct
66	Correct	131 ms	6200 KB	Output is correct
67	Correct	150 ms	6220 KB	Output is correct
68	Correct	66 ms	6260 KB	Output is correct
69	Correct	68 ms	6280 KB	Output is correct
70	Correct	59 ms	6240 KB	Output is correct
71	Correct	65 ms	6268 KB	Output is correct
72	Incorrect	52 ms	6292 KB	Output isn't correct
73	Incorrect	57 ms	6280 KB	Output isn't correct
74	Correct	72 ms	6264 KB	Output is correct
75	Correct	84 ms	6264 KB	Output is correct
76	Correct	90 ms	6276 KB	Output is correct
77	Correct	75 ms	6224 KB	Output is correct
78	Correct	87 ms	6256 KB	Output is correct
79	Correct	64 ms	6232 KB	Output is correct
80	Correct	73 ms	6248 KB	Output is correct
81	Correct	81 ms	6256 KB	Output is correct
82	Correct	74 ms	6248 KB	Output is correct
83	Correct	102 ms	6268 KB	Output is correct
84	Correct	83 ms	6240 KB	Output is correct
85	Correct	102 ms	6264 KB	Output is correct
86	Correct	90 ms	6244 KB	Output is correct
87	Correct	96 ms	6240 KB	Output is correct
88	Correct	95 ms	6236 KB	Output is correct
89	Correct	100 ms	6280 KB	Output is correct
90	Correct	109 ms	6256 KB	Output is correct
91	Correct	106 ms	6244 KB	Output is correct
92	Correct	115 ms	6240 KB	Output is correct