oj.uz

답안 #565658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565658 2022-05-21T08:21:01 Z Quan2003 Mecho (IOI09_mecho) C++17
69 / 100
 302 ms 15640 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+1;
            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+1);
}

Subtask #1
69.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Incorrect 0 ms 340 KB Output isn't correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 154 ms 15324 KB Output is correct
8 Correct 1 ms 468 KB Output is 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 Incorrect 2 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 2 ms 1236 KB Output is correct
29 Correct 2 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 6356 KB Output is correct
34 Correct 14 ms 6356 KB Output is correct
35 Correct 37 ms 6456 KB Output is correct
36 Correct 17 ms 7504 KB Output is correct
37 Correct 17 ms 7404 KB Output is correct
38 Correct 40 ms 7380 KB Output is correct
39 Correct 22 ms 8484 KB Output is correct
40 Correct 22 ms 8532 KB Output is correct
41 Correct 51 ms 8576 KB Output is correct
42 Correct 27 ms 9664 KB Output is correct
43 Correct 27 ms 9580 KB Output is correct
44 Correct 67 ms 9660 KB Output is correct
45 Correct 40 ms 10608 KB Output is correct
46 Correct 37 ms 10544 KB Output is correct
47 Correct 76 ms 10600 KB Output is correct
48 Correct 37 ms 11436 KB Output is correct
49 Correct 38 ms 11476 KB Output is correct
50 Correct 96 ms 11560 KB Output is correct
51 Correct 51 ms 12388 KB Output is correct
52 Correct 51 ms 12360 KB Output is correct
53 Correct 157 ms 12456 KB Output is correct
54 Correct 62 ms 13304 KB Output is correct
55 Correct 56 ms 13384 KB Output is correct
56 Correct 145 ms 13484 KB Output is correct
57 Correct 66 ms 14284 KB Output is correct
58 Correct 74 ms 14280 KB Output is correct
59 Correct 169 ms 14332 KB Output is correct
60 Correct 76 ms 15188 KB Output is correct
61 Correct 77 ms 15212 KB Output is correct
62 Correct 204 ms 15180 KB Output is correct
63 Incorrect 164 ms 15224 KB Output isn't correct
64 Correct 302 ms 15268 KB Output is correct
65 Correct 224 ms 15240 KB Output is correct
66 Correct 206 ms 15260 KB Output is correct
67 Correct 185 ms 15184 KB Output is correct
68 Incorrect 114 ms 15268 KB Output isn't correct
69 Correct 108 ms 15284 KB Output is correct
70 Correct 103 ms 15204 KB Output is correct
71 Correct 99 ms 15240 KB Output is correct
72 Incorrect 145 ms 15352 KB Output isn't correct
73 Incorrect 142 ms 15544 KB Output isn't correct
74 Correct 126 ms 15640 KB Output is correct
75 Correct 122 ms 15520 KB Output is correct
76 Correct 119 ms 15564 KB Output is correct
77 Correct 121 ms 15556 KB Output is correct
78 Correct 138 ms 15524 KB Output is correct
79 Correct 112 ms 15436 KB Output is correct
80 Correct 116 ms 15520 KB Output is correct
81 Correct 128 ms 15436 KB Output is correct
82 Correct 124 ms 15512 KB Output is correct
83 Incorrect 141 ms 15380 KB Output isn't correct
84 Correct 137 ms 15476 KB Output is correct
85 Correct 145 ms 15432 KB Output is correct
86 Correct 138 ms 15360 KB Output is correct
87 Correct 145 ms 15428 KB Output is correct
88 Incorrect 155 ms 15424 KB Output isn't correct
89 Correct 153 ms 15428 KB Output is correct
90 Correct 162 ms 15308 KB Output is correct
91 Correct 142 ms 15308 KB Output is correct
92 Correct 148 ms 15432 KB Output is correct