oj.uz

Submission #953269

# Submission time Handle Problem Language Result Execution time Memory
953269 2024-03-25T18:42:39 Z dpsaveslives Mecho (IOI09_mecho) C++17
68 / 100
 207 ms 16656 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 = 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 348 KB Output is correct
7 Correct 148 ms 16384 KB Output is correct
8 Incorrect 1 ms 348 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 0 ms 348 KB Output is correct
12 Incorrect 1 ms 604 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Incorrect 1 ms 604 KB Output isn't correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 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 1 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 1 ms 348 KB Output is correct
26 Correct 1 ms 604 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 604 KB Output is correct
33 Correct 14 ms 3908 KB Output is correct
34 Correct 15 ms 3652 KB Output is correct
35 Correct 26 ms 3656 KB Output is correct
36 Correct 16 ms 4588 KB Output is correct
37 Correct 15 ms 4652 KB Output is correct
38 Correct 36 ms 4708 KB Output is correct
39 Correct 19 ms 5720 KB Output is correct
40 Correct 20 ms 5592 KB Output is correct
41 Correct 44 ms 5884 KB Output is correct
42 Correct 25 ms 6916 KB Output is correct
43 Correct 23 ms 6884 KB Output is correct
44 Correct 58 ms 6884 KB Output is correct
45 Correct 29 ms 8156 KB Output is correct
46 Correct 29 ms 8132 KB Output is correct
47 Correct 100 ms 8124 KB Output is correct
48 Correct 35 ms 9656 KB Output is correct
49 Correct 35 ms 9652 KB Output is correct
50 Correct 84 ms 9528 KB Output is correct
51 Correct 41 ms 11004 KB Output is correct
52 Correct 44 ms 11056 KB Output is correct
53 Correct 104 ms 11068 KB Output is correct
54 Correct 47 ms 12792 KB Output is correct
55 Correct 47 ms 12812 KB Output is correct
56 Correct 167 ms 12716 KB Output is correct
57 Correct 53 ms 14520 KB Output is correct
58 Correct 54 ms 14496 KB Output is correct
59 Correct 155 ms 14636 KB Output is correct
60 Correct 62 ms 16356 KB Output is correct
61 Correct 61 ms 16352 KB Output is correct
62 Correct 207 ms 16336 KB Output is correct
63 Correct 122 ms 16488 KB Output is correct
64 Correct 194 ms 16312 KB Output is correct
65 Correct 188 ms 16616 KB Output is correct
66 Correct 183 ms 16284 KB Output is correct
67 Incorrect 138 ms 16372 KB Output isn't correct
68 Correct 83 ms 16332 KB Output is correct
69 Correct 110 ms 16312 KB Output is correct
70 Correct 83 ms 16420 KB Output is correct
71 Correct 81 ms 16388 KB Output is correct
72 Incorrect 96 ms 16380 KB Output isn't correct
73 Incorrect 94 ms 16656 KB Output isn't correct
74 Correct 103 ms 16456 KB Output is correct
75 Correct 116 ms 16356 KB Output is correct
76 Correct 113 ms 16480 KB Output is correct
77 Correct 107 ms 16412 KB Output is correct
78 Incorrect 115 ms 16448 KB Output isn't correct
79 Correct 107 ms 16396 KB Output is correct
80 Correct 111 ms 16464 KB Output is correct
81 Correct 116 ms 16376 KB Output is correct
82 Correct 111 ms 16432 KB Output is correct
83 Correct 121 ms 16336 KB Output is correct
84 Correct 122 ms 16468 KB Output is correct
85 Correct 132 ms 16496 KB Output is correct
86 Correct 155 ms 16324 KB Output is correct
87 Correct 122 ms 16336 KB Output is correct
88 Correct 130 ms 16428 KB Output is correct
89 Correct 164 ms 16388 KB Output is correct
90 Correct 130 ms 16452 KB Output is correct
91 Correct 134 ms 16392 KB Output is correct
92 Correct 171 ms 16532 KB Output is correct