oj.uz

답안 #953268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953268 2024-03-25T18:41:15 Z dpsaveslives Mecho (IOI09_mecho) C++17
68 / 100
 151 ms 9000 KB 
#include <bits/stdc++.h>
#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 = 1e9;
int 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 = INF;
    if(hi < 0){
        cout << "-1\n";
        return 0;
    }
    vector<vector<int>> D(N,vector<int>(N,INF));
    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
68.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 86 ms 8744 KB Output is correct
8 Incorrect 0 ms 600 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 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 344 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 7 ms 2440 KB Output is correct
34 Correct 6 ms 2188 KB Output is correct
35 Correct 20 ms 2192 KB Output is correct
36 Correct 7 ms 2700 KB Output is correct
37 Correct 7 ms 2652 KB Output is correct
38 Correct 25 ms 2652 KB Output is correct
39 Correct 9 ms 3224 KB Output is correct
40 Correct 9 ms 3244 KB Output is correct
41 Correct 32 ms 3196 KB Output is correct
42 Correct 10 ms 3852 KB Output is correct
43 Correct 10 ms 3844 KB Output is correct
44 Correct 42 ms 3844 KB Output is correct
45 Correct 12 ms 4480 KB Output is correct
46 Correct 15 ms 4480 KB Output is correct
47 Correct 51 ms 4480 KB Output is correct
48 Correct 16 ms 5228 KB Output is correct
49 Correct 16 ms 5256 KB Output is correct
50 Correct 62 ms 5224 KB Output is correct
51 Correct 19 ms 5980 KB Output is correct
52 Correct 19 ms 5980 KB Output is correct
53 Correct 73 ms 6044 KB Output is correct
54 Correct 22 ms 6856 KB Output is correct
55 Correct 23 ms 6860 KB Output is correct
56 Correct 87 ms 6876 KB Output is correct
57 Correct 22 ms 7752 KB Output is correct
58 Correct 22 ms 7756 KB Output is correct
59 Correct 109 ms 7744 KB Output is correct
60 Correct 25 ms 8720 KB Output is correct
61 Correct 25 ms 8748 KB Output is correct
62 Correct 117 ms 8808 KB Output is correct
63 Correct 80 ms 8708 KB Output is correct
64 Correct 151 ms 9000 KB Output is correct
65 Correct 139 ms 8688 KB Output is correct
66 Correct 99 ms 8708 KB Output is correct
67 Incorrect 93 ms 8712 KB Output isn't correct
68 Correct 46 ms 8720 KB Output is correct
69 Correct 48 ms 8712 KB Output is correct
70 Correct 44 ms 8708 KB Output is correct
71 Correct 36 ms 8708 KB Output is correct
72 Incorrect 35 ms 8740 KB Output isn't correct
73 Incorrect 45 ms 8772 KB Output isn't correct
74 Correct 63 ms 8764 KB Output is correct
75 Correct 78 ms 8868 KB Output is correct
76 Correct 64 ms 8768 KB Output is correct
77 Correct 66 ms 8764 KB Output is correct
78 Incorrect 72 ms 8752 KB Output isn't correct
79 Correct 63 ms 8712 KB Output is correct
80 Correct 69 ms 8764 KB Output is correct
81 Correct 67 ms 8752 KB Output is correct
82 Correct 60 ms 8764 KB Output is correct
83 Correct 74 ms 8748 KB Output is correct
84 Correct 74 ms 8736 KB Output is correct
85 Correct 76 ms 8820 KB Output is correct
86 Correct 77 ms 8764 KB Output is correct
87 Correct 75 ms 8748 KB Output is correct
88 Correct 75 ms 8728 KB Output is correct
89 Correct 87 ms 8756 KB Output is correct
90 Correct 87 ms 8724 KB Output is correct
91 Correct 81 ms 8712 KB Output is correct
92 Correct 87 ms 8756 KB Output is correct