oj.uz

답안 #565625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565625 2022-05-21T07:46:04 Z Quan2003 Mecho (IOI09_mecho) C++17
17 / 100
 234 ms 16288 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==k) moves++;
            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=1e6;
      while (high>low){
          int mid=low+(high-low+1)/2;
          if (bsearch(mid)) low=mid;
          else high=mid-1;
      } cout <<low;
}

Subtask #1
17.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 468 KB Output isn't correct
7 Incorrect 142 ms 15976 KB Output isn't correct
8 Incorrect 1 ms 468 KB Output isn't correct
9 Incorrect 1 ms 468 KB Output isn't correct
10 Incorrect 1 ms 468 KB Output isn't correct
11 Correct 1 ms 476 KB Output is correct
12 Incorrect 2 ms 1236 KB Output isn't correct
13 Correct 1 ms 980 KB Output is correct
14 Incorrect 2 ms 1208 KB Output isn't correct
15 Correct 1 ms 596 KB Output is correct
16 Incorrect 1 ms 596 KB Output isn't correct
17 Correct 1 ms 596 KB Output is correct
18 Incorrect 1 ms 596 KB Output isn't correct
19 Correct 1 ms 724 KB Output is correct
20 Incorrect 1 ms 724 KB Output isn't correct
21 Correct 1 ms 852 KB Output is correct
22 Incorrect 1 ms 852 KB Output isn't correct
23 Correct 1 ms 980 KB Output is correct
24 Incorrect 1 ms 980 KB Output isn't correct
25 Correct 1 ms 1236 KB Output is correct
26 Incorrect 1 ms 1236 KB Output isn't correct
27 Correct 1 ms 1236 KB Output is correct
28 Incorrect 1 ms 1236 KB Output isn't correct
29 Correct 2 ms 1364 KB Output is correct
30 Incorrect 2 ms 1364 KB Output isn't correct
31 Correct 2 ms 1480 KB Output is correct
32 Incorrect 2 ms 1476 KB Output isn't correct
33 Correct 17 ms 6496 KB Output is correct
34 Incorrect 14 ms 6484 KB Output isn't correct
35 Incorrect 16 ms 6560 KB Output isn't correct
36 Correct 17 ms 7644 KB Output is correct
37 Incorrect 18 ms 7572 KB Output isn't correct
38 Incorrect 21 ms 7568 KB Output isn't correct
39 Correct 23 ms 8672 KB Output is correct
40 Incorrect 22 ms 8780 KB Output isn't correct
41 Incorrect 25 ms 8728 KB Output isn't correct
42 Correct 33 ms 9876 KB Output is correct
43 Incorrect 26 ms 9900 KB Output isn't correct
44 Incorrect 32 ms 9788 KB Output isn't correct
45 Correct 32 ms 10836 KB Output is correct
46 Incorrect 31 ms 10828 KB Output isn't correct
47 Incorrect 35 ms 10828 KB Output isn't correct
48 Correct 42 ms 11780 KB Output is correct
49 Incorrect 41 ms 11828 KB Output isn't correct
50 Incorrect 41 ms 11772 KB Output isn't correct
51 Correct 50 ms 12876 KB Output is correct
52 Incorrect 49 ms 12828 KB Output isn't correct
53 Incorrect 62 ms 12976 KB Output isn't correct
54 Correct 60 ms 13868 KB Output is correct
55 Incorrect 66 ms 13868 KB Output isn't correct
56 Incorrect 71 ms 13880 KB Output isn't correct
57 Correct 67 ms 14864 KB Output is correct
58 Incorrect 64 ms 14876 KB Output isn't correct
59 Incorrect 77 ms 14904 KB Output isn't correct
60 Correct 71 ms 15792 KB Output is correct
61 Incorrect 75 ms 15820 KB Output isn't correct
62 Incorrect 92 ms 15896 KB Output isn't correct
63 Incorrect 190 ms 15968 KB Output isn't correct
64 Incorrect 176 ms 15900 KB Output isn't correct
65 Incorrect 228 ms 15896 KB Output isn't correct
66 Incorrect 182 ms 15896 KB Output isn't correct
67 Incorrect 234 ms 15892 KB Output isn't correct
68 Correct 82 ms 15860 KB Output is correct
69 Incorrect 95 ms 15924 KB Output isn't correct
70 Incorrect 99 ms 15920 KB Output isn't correct
71 Incorrect 96 ms 15884 KB Output isn't correct
72 Incorrect 93 ms 15840 KB Output isn't correct
73 Incorrect 111 ms 16192 KB Output isn't correct
74 Incorrect 89 ms 16124 KB Output isn't correct
75 Incorrect 112 ms 16288 KB Output isn't correct
76 Incorrect 109 ms 16188 KB Output isn't correct
77 Incorrect 111 ms 16112 KB Output isn't correct
78 Incorrect 138 ms 16104 KB Output isn't correct
79 Incorrect 87 ms 16052 KB Output isn't correct
80 Incorrect 109 ms 16140 KB Output isn't correct
81 Incorrect 119 ms 16060 KB Output isn't correct
82 Incorrect 120 ms 16032 KB Output isn't correct
83 Incorrect 139 ms 16104 KB Output isn't correct
84 Incorrect 83 ms 16024 KB Output isn't correct
85 Incorrect 120 ms 16076 KB Output isn't correct
86 Incorrect 129 ms 16076 KB Output isn't correct
87 Incorrect 122 ms 16112 KB Output isn't correct
88 Incorrect 137 ms 16076 KB Output isn't correct
89 Incorrect 80 ms 16008 KB Output isn't correct
90 Incorrect 133 ms 15948 KB Output isn't correct
91 Incorrect 127 ms 15976 KB Output isn't correct
92 Incorrect 132 ms 16044 KB Output isn't correct