oj.uz

답안 #585409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585409 2022-06-28T19:59:13 Z Andrei_Calota Mecho (IOI09_mecho) C++14
95 / 100
 191 ms 6752 KB 
#include <bits/stdc++.h>

using namespace std;
const int NMAX = 8e2;
const int VISUAL = 4;

int dl[] = { -1, 0, 1,  0 };
int dc[] = {  0, 1, 0, -1 };
int n, step; int bee_dist[2 + NMAX][2 + NMAX];
char forest[2 + NMAX][2 + NMAX]; int dist[2 + NMAX][2 + NMAX];
pair<int, int> honey, house;

vector<pair<int, int>> bees;
void bee_spread () {
   queue<pair<int, int>> q;
   for ( auto pos : bees ) {
      q.push ( pos );
      bee_dist[pos.first][pos.second] = 1;
   }
   while ( !q.empty () ) {
      pair<int, int> start = q.front (); q.pop ();
      int line = start.first, column = start.second;
      for ( int dir = 0; dir < VISUAL; dir ++ ) {
         int new_line = line + dl[dir];
         int new_col = column + dc[dir];
         if ( forest[new_line][new_col] != 'T' && bee_dist[new_line][new_col] == 0 ) {
           bee_dist[new_line][new_col] = bee_dist[line][column] + 1;
           q.push ( {new_line, new_col} );
         }
      }
   }
}
bool validation ( int time, pair<int, int> start ) {
   if ( time >= bee_dist[start.first][start.second] - 1 )
     return false;
   queue<pair<int, int>> q; q.push ( start );
   dist[start.first][start.second] = 1;
   while ( !q.empty () ) {
      start = q.front (); q.pop ();
      int line = start.first, column = start.second;
      for ( int dir = 0; dir < VISUAL; dir ++ ) {
         int new_line = line + dl[dir];
         int new_col = column + dc[dir];

         if ( new_line == house.first && new_col == house.second )
           return true;

         if ( (forest[new_line][new_col] == 'D' || forest[new_line][new_col] == 'G') && dist[new_line][new_col] == 0 ) {
           dist[new_line][new_col] = dist[line][column] + 1;
           int need = ( dist[new_line][new_col] - 1 ) / step;
           if ( need + time < bee_dist[new_line][new_col] - 1 )
             q.push ( {new_line, new_col} );
         }
      }
   }
   return false;
}

void reset_dist () {
   for ( int i = 1; i <= n; i ++ )
      for ( int j = 1; j <= n; j ++ )
         dist[i][j] = 0;
}
void solve () {
   int left = 0, right = 2 * n * n; int answer = -1;
   while ( left <= right ) {
      int time = left + (right - left) / 2;
      int status = validation ( time, honey );
      if ( status == true ) {
        answer = time;
        left = time + 1;
      }
      else
        right = time - 1;
      reset_dist ();
   }
   cout << answer;
}
int main()
{
   cin >> n >> step; cin.get ();
   for ( int line = 1; line <= n; line ++ ) {
      for ( int column = 1; column <= n; column ++ ) {
         forest[line][column] = cin.get ();
         if ( forest[line][column] == 'M' )
           honey = {line, column};
         else if ( forest[line][column] == 'D' )
           house = {line, column};
         else if ( forest[line][column] == 'H' )
           bees.push_back ( {line, column} );
      }
      cin.get ();
   }
   for ( int indx = 0; indx < n + 2; indx ++ ) {
      forest[indx][0] = forest[indx][n + 1] = 'T';
      forest[0][indx] = forest[n + 1][indx] = 'T';
   }
   bee_spread ();
   solve ();
    return 0;
}

Subtask #1
95.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 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 83 ms 6092 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 1 ms 724 KB Output isn't correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 8 ms 2808 KB Output is correct
34 Correct 8 ms 2704 KB Output is correct
35 Correct 20 ms 2748 KB Output is correct
36 Correct 10 ms 3148 KB Output is correct
37 Correct 10 ms 3156 KB Output is correct
38 Correct 25 ms 3040 KB Output is correct
39 Correct 12 ms 3444 KB Output is correct
40 Correct 12 ms 3648 KB Output is correct
41 Correct 33 ms 3676 KB Output is correct
42 Correct 15 ms 4080 KB Output is correct
43 Correct 16 ms 4052 KB Output is correct
44 Correct 47 ms 3852 KB Output is correct
45 Correct 17 ms 4072 KB Output is correct
46 Correct 18 ms 4436 KB Output is correct
47 Correct 47 ms 4180 KB Output is correct
48 Correct 21 ms 4692 KB Output is correct
49 Correct 20 ms 4708 KB Output is correct
50 Correct 58 ms 4732 KB Output is correct
51 Correct 24 ms 5204 KB Output is correct
52 Correct 24 ms 5060 KB Output is correct
53 Correct 77 ms 5188 KB Output is correct
54 Correct 29 ms 5476 KB Output is correct
55 Correct 30 ms 5588 KB Output is correct
56 Correct 85 ms 5560 KB Output is correct
57 Correct 33 ms 5972 KB Output is correct
58 Correct 31 ms 5988 KB Output is correct
59 Correct 96 ms 6024 KB Output is correct
60 Correct 39 ms 6360 KB Output is correct
61 Correct 37 ms 6340 KB Output is correct
62 Correct 124 ms 6348 KB Output is correct
63 Correct 107 ms 6380 KB Output is correct
64 Correct 191 ms 6452 KB Output is correct
65 Correct 153 ms 6348 KB Output is correct
66 Correct 128 ms 6348 KB Output is correct
67 Correct 117 ms 6452 KB Output is correct
68 Correct 64 ms 6424 KB Output is correct
69 Correct 61 ms 6476 KB Output is correct
70 Correct 57 ms 6476 KB Output is correct
71 Correct 68 ms 6380 KB Output is correct
72 Correct 48 ms 6392 KB Output is correct
73 Correct 45 ms 6636 KB Output is correct
74 Correct 61 ms 6752 KB Output is correct
75 Correct 71 ms 6752 KB Output is correct
76 Correct 75 ms 6732 KB Output is correct
77 Correct 71 ms 6664 KB Output is correct
78 Correct 79 ms 6712 KB Output is correct
79 Correct 57 ms 6604 KB Output is correct
80 Correct 65 ms 6708 KB Output is correct
81 Correct 78 ms 6708 KB Output is correct
82 Correct 72 ms 6728 KB Output is correct
83 Correct 87 ms 6732 KB Output is correct
84 Correct 72 ms 6660 KB Output is correct
85 Correct 76 ms 6584 KB Output is correct
86 Correct 78 ms 6668 KB Output is correct
87 Correct 76 ms 6676 KB Output is correct
88 Correct 81 ms 6696 KB Output is correct
89 Correct 94 ms 6556 KB Output is correct
90 Correct 86 ms 6616 KB Output is correct
91 Correct 82 ms 6588 KB Output is correct
92 Correct 85 ms 6616 KB Output is correct