oj.uz

Submission #567960

# Submission time Handle Problem Language Result Execution time Memory
567960 2022-05-24T12:05:57 Z Quan2003 Mecho (IOI09_mecho) C++17
54 / 100
 283 ms 15564 KB 
#include <bits/stdc++.h>
#include <iostream>
#include<queue>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
const int sz=1005;
int n,s;
int d1[sz][sz];
int d0[sz][sz];
bool vis1[sz][sz];
bool vis0[sz][sz];
vector<pair<int,int>>hiv;
int px,py;
int dx,dy;
ll step[sz][sz];
int movex[4]={0,0,1,-1};
int movey[4]={-1,1,0,0};
char c[sz][sz];
void bfs(vector<pair<int,int>>&a,int d[sz][sz],bool visited[sz][sz]){
    queue<pair<int,int>>q;
    for (auto i:a){
        q.push(i);
        visited[i.first][i.second]=1;
    }
    while (!q.empty()){
        int x1=q.front().first;
        int y1=q.front().second;
        q.pop();
        for (int i=0;i<4;i++){
            int x2=x1+movex[i];
            int y2=y1+movey[i];
            if (x2<0 or x2>=n) continue;
            if (y2<0 or y2>=n) continue;
            if (c[x2][y2]=='D' or c[x2][y2]=='T' or visited[x2][y2]) continue;
            visited[x2][y2]=1;
            d[x2][y2]=d[x1][y1]+1;
            q.push({x2,y2}); 
        }
    } 
}
bool bsearch(int k){
    if (k==d0[px][py]) return 0;
    for (int i=0;i<n;i++){
       for(int j=0;j<n;j++){
           vis1[i][j]=0;
           d1[i][j]=0;
           step[i][j]=INT_MAX;
       }
    }
    queue<pair<int,int>>q;
    q.push({px,py});
    step[px][py]=k;
    while (!q.empty()){
        int sx=q.front().first;
        int sy=q.front().second;
        q.pop();
        for (int i=0;i<4;i++){
            int tx=sx+movex[i];
            int ty=sy+movey[i];
            if (tx<0 or tx>=n) continue;
            if (ty<0 or ty>=n) continue;
            if (c[tx][ty]=='H' or c[tx][ty]=='T' or vis1[tx][ty]) continue;
            d1[tx][ty]=d1[sx][sy]+1;
            int moves=k+d1[tx][ty]/s;
            if (d1[tx][ty]%s==0) moves--;
            if (moves>=d0[tx][ty]) continue;
            step[tx][ty]=moves+1;
            vis1[tx][ty]=1;
            q.push({tx,ty});
        }
    } for (int i=0;i<4;i++){
         int tx=dx+movex[i];
         int ty=dy+movey[i];
         if (tx<0 or tx>=n or ty<0 or ty>=n or c[tx][ty]=='T' or c[tx][ty]=='H') continue;
         if (step[tx][ty]<=d0[tx][ty]) return 1;
    } return 0;
}
int main(){
    cin>>n>>s;
    for (int i=0;i<n;i++){
        for(int j=0;j<n;j++){
             cin>>c[i][j];
             if (c[i][j]=='D'){
                 dx=i;dy=j;
             }
             if (c[i][j]=='M'){
                 px=i;py=j;
             } if (c[i][j]=='H'){
                 hiv.push_back({i,j});
             }
        }
    } 
      bfs(hiv,d0,vis0);
      int low=0;int high=1e9;
      while (high>low){
          int mid=low+(high-low+1)/2;
          if (bsearch(mid)) low=mid;
          else high=mid-1;
      } 
        if (!bsearch(low)) cout <<-1;
        else cout <<low;
}

Subtask #1
54.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 164 ms 15308 KB Output is correct
8 Incorrect 1 ms 468 KB Output isn't correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Incorrect 1 ms 596 KB Output isn't correct
16 Correct 1 ms 596 KB Output is correct
17 Incorrect 1 ms 596 KB Output isn't correct
18 Correct 1 ms 596 KB Output is correct
19 Incorrect 1 ms 724 KB Output isn't correct
20 Correct 1 ms 724 KB Output is correct
21 Incorrect 1 ms 852 KB Output isn't correct
22 Correct 1 ms 852 KB Output is correct
23 Incorrect 1 ms 980 KB Output isn't correct
24 Correct 1 ms 980 KB Output is correct
25 Incorrect 1 ms 1236 KB Output isn't correct
26 Correct 1 ms 1236 KB Output is correct
27 Incorrect 2 ms 1236 KB Output isn't correct
28 Correct 1 ms 1236 KB Output is correct
29 Incorrect 1 ms 1364 KB Output isn't correct
30 Correct 1 ms 1364 KB Output is correct
31 Incorrect 2 ms 1364 KB Output isn't correct
32 Correct 2 ms 1364 KB Output is correct
33 Incorrect 15 ms 6460 KB Output isn't correct
34 Correct 16 ms 6356 KB Output is correct
35 Correct 33 ms 6452 KB Output is correct
36 Incorrect 22 ms 7380 KB Output isn't correct
37 Correct 18 ms 7448 KB Output is correct
38 Correct 40 ms 7404 KB Output is correct
39 Incorrect 22 ms 8512 KB Output isn't correct
40 Correct 22 ms 8488 KB Output is correct
41 Correct 58 ms 8476 KB Output is correct
42 Incorrect 27 ms 9648 KB Output isn't correct
43 Correct 28 ms 9564 KB Output is correct
44 Correct 77 ms 9660 KB Output is correct
45 Incorrect 31 ms 10560 KB Output isn't correct
46 Correct 31 ms 10580 KB Output is correct
47 Correct 85 ms 10596 KB Output is correct
48 Incorrect 44 ms 11512 KB Output isn't correct
49 Correct 49 ms 11508 KB Output is correct
50 Correct 124 ms 11476 KB Output is correct
51 Incorrect 48 ms 12348 KB Output isn't correct
52 Correct 51 ms 12348 KB Output is correct
53 Correct 149 ms 12376 KB Output is correct
54 Incorrect 65 ms 13388 KB Output isn't correct
55 Correct 68 ms 13320 KB Output is correct
56 Correct 188 ms 13404 KB Output is correct
57 Incorrect 75 ms 14276 KB Output isn't correct
58 Correct 78 ms 14324 KB Output is correct
59 Correct 190 ms 14332 KB Output is correct
60 Incorrect 84 ms 15180 KB Output isn't correct
61 Correct 88 ms 15192 KB Output is correct
62 Correct 207 ms 15172 KB Output is correct
63 Correct 200 ms 15260 KB Output is correct
64 Correct 271 ms 15176 KB Output is correct
65 Correct 283 ms 15192 KB Output is correct
66 Incorrect 217 ms 15264 KB Output isn't correct
67 Correct 225 ms 15180 KB Output is correct
68 Correct 119 ms 15288 KB Output is correct
69 Correct 128 ms 15288 KB Output is correct
70 Correct 121 ms 15284 KB Output is correct
71 Correct 104 ms 15260 KB Output is correct
72 Correct 101 ms 15288 KB Output is correct
73 Correct 115 ms 15504 KB Output is correct
74 Correct 145 ms 15472 KB Output is correct
75 Correct 141 ms 15436 KB Output is correct
76 Correct 148 ms 15520 KB Output is correct
77 Correct 143 ms 15552 KB Output is correct
78 Correct 152 ms 15440 KB Output is correct
79 Correct 126 ms 15512 KB Output is correct
80 Correct 134 ms 15472 KB Output is correct
81 Correct 140 ms 15520 KB Output is correct
82 Correct 137 ms 15564 KB Output is correct
83 Correct 152 ms 15480 KB Output is correct
84 Correct 159 ms 15548 KB Output is correct
85 Correct 151 ms 15392 KB Output is correct
86 Correct 166 ms 15472 KB Output is correct
87 Correct 157 ms 15476 KB Output is correct
88 Correct 149 ms 15308 KB Output is correct
89 Correct 168 ms 15416 KB Output is correct
90 Correct 197 ms 15468 KB Output is correct
91 Correct 151 ms 15384 KB Output is correct
92 Correct 166 ms 15412 KB Output is correct