oj.uz

Submission #565648

# Submission time Handle Problem Language Result Execution time Memory
565648 2022-05-21T08:10:44 Z Quan2003 Mecho (IOI09_mecho) C++17
84 / 100
 237 ms 15676 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]!='.' or visited[x2][y2]) continue;
                visited[x2][y2]=1;
                d[x2][y2]=d[x1][y1]+1;
                q.push({x2,y2}); 
        }
    } 
}
bool bsearch(int k){
    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]=LLONG_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 (ty<0 or tx>=n) continue;
            if (ty<0 or ty>=n) continue;
            if (c[tx][ty]!='.' or vis1[tx][ty]) continue;
            d1[tx][ty]=d1[sx][sy]+1;
            int moves=k+d1[tx][ty]/s;
            if (moves>=d0[tx][ty]) continue;
            step[tx][ty]=moves;
            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) 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++){
             char y; cin>>y;
             c[i][j]=y;
             if (c[i][j]=='G'){
                 c[i][j]='.';
             }
             if (c[i][j]=='D'){
                 dx=i;dy=j;
                 c[i][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=1e7;
      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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 149 ms 15316 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Incorrect 1 ms 1236 KB Output isn't correct
13 Incorrect 1 ms 980 KB Output isn't correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1236 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 1 ms 1364 KB Output is correct
33 Correct 14 ms 6360 KB Output is correct
34 Correct 14 ms 6448 KB Output is correct
35 Correct 30 ms 6456 KB Output is correct
36 Correct 18 ms 7500 KB Output is correct
37 Correct 18 ms 7484 KB Output is correct
38 Correct 39 ms 7416 KB Output is correct
39 Correct 21 ms 8584 KB Output is correct
40 Correct 22 ms 8532 KB Output is correct
41 Correct 51 ms 8564 KB Output is correct
42 Correct 29 ms 9656 KB Output is correct
43 Correct 32 ms 9556 KB Output is correct
44 Correct 71 ms 9664 KB Output is correct
45 Correct 35 ms 10568 KB Output is correct
46 Correct 37 ms 10588 KB Output is correct
47 Correct 78 ms 10572 KB Output is correct
48 Correct 40 ms 11516 KB Output is correct
49 Correct 37 ms 11440 KB Output is correct
50 Correct 96 ms 11528 KB Output is correct
51 Correct 47 ms 12424 KB Output is correct
52 Correct 47 ms 12508 KB Output is correct
53 Correct 121 ms 12460 KB Output is correct
54 Correct 56 ms 13388 KB Output is correct
55 Correct 56 ms 13388 KB Output is correct
56 Correct 149 ms 13320 KB Output is correct
57 Correct 72 ms 14284 KB Output is correct
58 Correct 70 ms 14292 KB Output is correct
59 Correct 167 ms 14328 KB Output is correct
60 Correct 75 ms 15252 KB Output is correct
61 Correct 74 ms 15248 KB Output is correct
62 Correct 199 ms 15260 KB Output is correct
63 Correct 170 ms 15260 KB Output is correct
64 Correct 231 ms 15232 KB Output is correct
65 Correct 237 ms 15308 KB Output is correct
66 Correct 194 ms 15252 KB Output is correct
67 Correct 184 ms 15212 KB Output is correct
68 Correct 111 ms 15212 KB Output is correct
69 Correct 112 ms 15288 KB Output is correct
70 Correct 106 ms 15260 KB Output is correct
71 Correct 105 ms 15220 KB Output is correct
72 Incorrect 132 ms 15404 KB Output isn't correct
73 Incorrect 132 ms 15668 KB Output isn't correct
74 Correct 114 ms 15436 KB Output is correct
75 Correct 127 ms 15548 KB Output is correct
76 Correct 119 ms 15436 KB Output is correct
77 Correct 121 ms 15676 KB Output is correct
78 Correct 143 ms 15396 KB Output is correct
79 Correct 118 ms 15508 KB Output is correct
80 Correct 117 ms 15500 KB Output is correct
81 Correct 128 ms 15516 KB Output is correct
82 Correct 124 ms 15404 KB Output is correct
83 Correct 142 ms 15464 KB Output is correct
84 Correct 128 ms 15460 KB Output is correct
85 Correct 150 ms 15352 KB Output is correct
86 Correct 141 ms 15476 KB Output is correct
87 Correct 136 ms 15436 KB Output is correct
88 Correct 146 ms 15396 KB Output is correct
89 Correct 149 ms 15464 KB Output is correct
90 Correct 151 ms 15408 KB Output is correct
91 Correct 148 ms 15416 KB Output is correct
92 Correct 143 ms 15308 KB Output is correct