oj.uz

답안 #953273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953273 2024-03-25T18:57:36 Z dpsaveslives Mecho (IOI09_mecho) C++17
84 / 100
 157 ms 16960 KB 
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
const int MAXN = 810;
char grid[MAXN][MAXN];
int dr[4] = {0,0,1,-1}, dc[4] = {1,-1,0,0},N;
bool goodbees(int r, int c){
    return r >= 0 && c >= 0 && r <= N-1 && c <= N-1 && grid[r][c] != 'T' && grid[r][c] != 'D';
}
bool goodmecho(int r, int c){
    return r >= 0 && c >= 0 && r <= N-1 && c <= N-1 && grid[r][c] != 'T';
}
const int INF = 1e18;
int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int S; cin >> N >> S;
    queue<pair<int,int>> q;
    vector<vector<int>> dist(N,vector<int>(N,INF));
    pair<int,int> m,home;
    for(int i = 0;i<N;++i){
        for(int j = 0;j<N;++j){
            cin >> grid[i][j];
            if(grid[i][j] == 'H'){
                q.push({i,j});
                dist[i][j] = 0;
            }
            else if(grid[i][j] == 'M'){
                m.f = i, m.s = j;
            }
            else if(grid[i][j] == 'D'){
                home.f = i, home.s = j;
            }
        }
    }
    while(!q.empty()){
        int r = q.front().f, c = q.front().s; q.pop();
        for(int i = 0;i<4;++i){
            int nr = r+dr[i], nc = c+dc[i];
            if(goodbees(nr,nc)){
                if(dist[nr][nc] > dist[r][c]+1){
                    dist[nr][nc] = dist[r][c]+1;
                    q.push({nr,nc});
                }
            }
        }
    }
    /*vector<vector<int>> mecho(N,vector<int>(N,INF));
    mecho[m.f][m.s] = 0; q.push(m);
    while(!q.empty()){
        int r = q.front().f, c = q.front().s; q.pop();
        for(int i = 0;i<4;++i){
            int nr = r+dr[i], nc = c+dc[i];
            if(goodmecho(nr,nc)){
                if(mecho[nr][nc] > mecho[r][c]+1){
                    mecho[nr][nc] = mecho[r][c]+1;
                    q.push({nr,nc});
                }
            }
        }
    }*/
    int lo = 0, hi = dist[m.f][m.s];
    vector<vector<int>> D(N,vector<int>(N,INF));
    --lo;
    while(lo < hi){
        int mid = lo+(hi-lo+1)/2; //time
        //cout << mid << "\n";
        D = vector<vector<int>>(N,vector<int>(N,INF));
        q.push(m); D[m.f][m.s] = 0;
        while(!q.empty()){
            int r = q.front().f, c = q.front().s; q.pop();
            //cout << r << " " << c << "\n";
            for(int i = 0;i<4;++i){
                int nr = r+dr[i], nc = c+dc[i];
                if(goodmecho(nr,nc)){
                    if((D[r][c]+1)/S +mid < dist[nr][nc] && D[r][c]+1 < D[nr][nc]){
                        D[nr][nc] = D[r][c]+1;
                        q.push({nr,nc});
                    }
                }
            }
        }
        if(D[home.f][home.s] == INF){
            hi = mid-1;
        }
        else{
            lo = mid;
        }
    }
    cout << lo << "\n";
    return 0;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 101 ms 16244 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 604 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 6 ms 3656 KB Output is correct
34 Correct 6 ms 3656 KB Output is correct
35 Correct 18 ms 3600 KB Output is correct
36 Correct 8 ms 4540 KB Output is correct
37 Correct 8 ms 4588 KB Output is correct
38 Correct 28 ms 4500 KB Output is correct
39 Correct 10 ms 5660 KB Output is correct
40 Correct 11 ms 5660 KB Output is correct
41 Correct 32 ms 5596 KB Output is correct
42 Correct 13 ms 6808 KB Output is correct
43 Correct 13 ms 6780 KB Output is correct
44 Correct 41 ms 6804 KB Output is correct
45 Correct 15 ms 8076 KB Output is correct
46 Correct 16 ms 8076 KB Output is correct
47 Correct 48 ms 8072 KB Output is correct
48 Correct 19 ms 9444 KB Output is correct
49 Correct 19 ms 9484 KB Output is correct
50 Correct 64 ms 9464 KB Output is correct
51 Correct 22 ms 10988 KB Output is correct
52 Correct 23 ms 11000 KB Output is correct
53 Correct 67 ms 10968 KB Output is correct
54 Correct 26 ms 12640 KB Output is correct
55 Correct 26 ms 12648 KB Output is correct
56 Correct 113 ms 12820 KB Output is correct
57 Correct 29 ms 14392 KB Output is correct
58 Correct 30 ms 14396 KB Output is correct
59 Correct 98 ms 14276 KB Output is correct
60 Correct 33 ms 16232 KB Output is correct
61 Correct 34 ms 16268 KB Output is correct
62 Correct 133 ms 16208 KB Output is correct
63 Correct 99 ms 16192 KB Output is correct
64 Correct 157 ms 16216 KB Output is correct
65 Correct 157 ms 16256 KB Output is correct
66 Correct 109 ms 16176 KB Output is correct
67 Correct 108 ms 16220 KB Output is correct
68 Correct 48 ms 16248 KB Output is correct
69 Correct 46 ms 16220 KB Output is correct
70 Correct 40 ms 16220 KB Output is correct
71 Correct 35 ms 16208 KB Output is correct
72 Incorrect 39 ms 16212 KB Output isn't correct
73 Incorrect 39 ms 16156 KB Output isn't correct
74 Correct 77 ms 16224 KB Output is correct
75 Correct 65 ms 16220 KB Output is correct
76 Correct 83 ms 16280 KB Output is correct
77 Correct 68 ms 16248 KB Output is correct
78 Correct 75 ms 16276 KB Output is correct
79 Correct 65 ms 16236 KB Output is correct
80 Correct 70 ms 16220 KB Output is correct
81 Correct 81 ms 16752 KB Output is correct
82 Correct 67 ms 16248 KB Output is correct
83 Correct 89 ms 16212 KB Output is correct
84 Correct 69 ms 16208 KB Output is correct
85 Correct 83 ms 16208 KB Output is correct
86 Correct 91 ms 16208 KB Output is correct
87 Correct 89 ms 16212 KB Output is correct
88 Correct 92 ms 16220 KB Output is correct
89 Correct 91 ms 16212 KB Output is correct
90 Correct 116 ms 16960 KB Output is correct
91 Correct 137 ms 16208 KB Output is correct
92 Correct 92 ms 16212 KB Output is correct