oj.uz

Submission #585388

# Submission time Handle Problem Language Result Execution time Memory
585388 2022-06-28T19:24:03 Z Andrei_Calota Mecho (IOI09_mecho) C++14
84 / 100
 185 ms 6280 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 ) {
   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 ( (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} );
         }
      }
   }
   if ( dist[house.first][house.second] )
     return true;
   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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 86 ms 5988 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 Incorrect 1 ms 596 KB Output isn't correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 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 2776 KB Output is correct
34 Correct 9 ms 2772 KB Output is correct
35 Correct 19 ms 2792 KB Output is correct
36 Correct 11 ms 3028 KB Output is correct
37 Correct 11 ms 3028 KB Output is correct
38 Correct 28 ms 3040 KB Output is correct
39 Correct 14 ms 3500 KB Output is correct
40 Correct 13 ms 3412 KB Output is correct
41 Correct 32 ms 3412 KB Output is correct
42 Correct 17 ms 3732 KB Output is correct
43 Correct 17 ms 3772 KB Output is correct
44 Correct 41 ms 3840 KB Output is correct
45 Correct 19 ms 4180 KB Output is correct
46 Correct 19 ms 4180 KB Output is correct
47 Correct 49 ms 4296 KB Output is correct
48 Correct 23 ms 4420 KB Output is correct
49 Correct 22 ms 4460 KB Output is correct
50 Correct 62 ms 4544 KB Output is correct
51 Correct 27 ms 4816 KB Output is correct
52 Correct 27 ms 4820 KB Output is correct
53 Correct 79 ms 4900 KB Output is correct
54 Correct 32 ms 5172 KB Output is correct
55 Correct 30 ms 5196 KB Output is correct
56 Correct 78 ms 5224 KB Output is correct
57 Correct 35 ms 5628 KB Output is correct
58 Correct 34 ms 5496 KB Output is correct
59 Correct 103 ms 5580 KB Output is correct
60 Correct 40 ms 5892 KB Output is correct
61 Correct 39 ms 5836 KB Output is correct
62 Correct 103 ms 5952 KB Output is correct
63 Correct 119 ms 5948 KB Output is correct
64 Correct 185 ms 6016 KB Output is correct
65 Correct 150 ms 5960 KB Output is correct
66 Correct 113 ms 5956 KB Output is correct
67 Correct 110 ms 5868 KB Output is correct
68 Correct 58 ms 5884 KB Output is correct
69 Correct 69 ms 5872 KB Output is correct
70 Correct 51 ms 5908 KB Output is correct
71 Correct 56 ms 5928 KB Output is correct
72 Incorrect 45 ms 5900 KB Output isn't correct
73 Incorrect 47 ms 6188 KB Output isn't correct
74 Correct 60 ms 6252 KB Output is correct
75 Correct 70 ms 6280 KB Output is correct
76 Correct 80 ms 6220 KB Output is correct
77 Correct 65 ms 6136 KB Output is correct
78 Correct 71 ms 6116 KB Output is correct
79 Correct 54 ms 6196 KB Output is correct
80 Correct 60 ms 6208 KB Output is correct
81 Correct 68 ms 6108 KB Output is correct
82 Correct 64 ms 6212 KB Output is correct
83 Correct 79 ms 6092 KB Output is correct
84 Correct 67 ms 6168 KB Output is correct
85 Correct 73 ms 6172 KB Output is correct
86 Correct 71 ms 6092 KB Output is correct
87 Correct 75 ms 6100 KB Output is correct
88 Correct 90 ms 6092 KB Output is correct
89 Correct 98 ms 6072 KB Output is correct
90 Correct 76 ms 6116 KB Output is correct
91 Correct 76 ms 6120 KB Output is correct
92 Correct 92 ms 6112 KB Output is correct