oj.uz

Submission #585402

# Submission time Handle Problem Language Result Execution time Memory
585402 2022-06-28T19:47:13 Z Andrei_Calota Mecho (IOI09_mecho) C++14
84 / 100
 193 ms 6252 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 ( (forest[new_line][new_col] == 'D' || forest[new_line][new_col] == 'G') && dist[new_line][new_col] == 0 ) {
           int new_dist = dist[line][column] + 1;
           int need = ( new_dist - 1 ) / step;
           if ( need + time < bee_dist[new_line][new_col] - 1 ) {
             q.push ( {new_line, new_col} );
             dist[new_line][new_col] = new_dist;
           }
         }
      }
   }
   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 0 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 82 ms 5976 KB Output isn't correct
8 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 0 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 9 ms 2780 KB Output is correct
34 Correct 10 ms 2900 KB Output is correct
35 Correct 20 ms 2752 KB Output is correct
36 Correct 11 ms 3040 KB Output is correct
37 Correct 12 ms 3156 KB Output is correct
38 Correct 25 ms 3028 KB Output is correct
39 Correct 15 ms 3456 KB Output is correct
40 Correct 14 ms 3540 KB Output is correct
41 Correct 35 ms 3476 KB Output is correct
42 Correct 17 ms 3852 KB Output is correct
43 Correct 16 ms 3856 KB Output is correct
44 Correct 42 ms 3852 KB Output is correct
45 Correct 20 ms 4096 KB Output is correct
46 Correct 19 ms 4096 KB Output is correct
47 Correct 47 ms 4184 KB Output is correct
48 Correct 24 ms 4428 KB Output is correct
49 Correct 23 ms 4444 KB Output is correct
50 Correct 56 ms 4436 KB Output is correct
51 Correct 27 ms 4824 KB Output is correct
52 Correct 29 ms 4856 KB Output is correct
53 Correct 79 ms 4860 KB Output is correct
54 Correct 32 ms 5128 KB Output is correct
55 Correct 30 ms 5252 KB Output is correct
56 Correct 87 ms 5248 KB Output is correct
57 Correct 35 ms 5600 KB Output is correct
58 Correct 35 ms 5488 KB Output is correct
59 Correct 104 ms 5580 KB Output is correct
60 Correct 41 ms 5856 KB Output is correct
61 Correct 39 ms 5836 KB Output is correct
62 Correct 108 ms 5952 KB Output is correct
63 Correct 116 ms 5856 KB Output is correct
64 Correct 193 ms 6124 KB Output is correct
65 Correct 142 ms 5836 KB Output is correct
66 Correct 127 ms 5900 KB Output is correct
67 Correct 132 ms 5948 KB Output is correct
68 Correct 63 ms 5936 KB Output is correct
69 Correct 58 ms 5964 KB Output is correct
70 Correct 49 ms 5924 KB Output is correct
71 Correct 54 ms 5896 KB Output is correct
72 Correct 47 ms 5964 KB Output is correct
73 Correct 45 ms 6200 KB Output is correct
74 Correct 64 ms 6172 KB Output is correct
75 Correct 71 ms 6220 KB Output is correct
76 Correct 66 ms 6252 KB Output is correct
77 Correct 65 ms 6252 KB Output is correct
78 Correct 84 ms 6144 KB Output is correct
79 Correct 60 ms 6172 KB Output is correct
80 Correct 62 ms 6208 KB Output is correct
81 Correct 71 ms 6212 KB Output is correct
82 Correct 64 ms 6148 KB Output is correct
83 Correct 88 ms 6176 KB Output is correct
84 Correct 71 ms 6048 KB Output is correct
85 Correct 78 ms 6052 KB Output is correct
86 Correct 74 ms 6092 KB Output is correct
87 Correct 90 ms 6172 KB Output is correct
88 Correct 92 ms 6112 KB Output is correct
89 Correct 90 ms 6072 KB Output is correct
90 Correct 82 ms 6008 KB Output is correct
91 Correct 99 ms 6116 KB Output is correct
92 Correct 83 ms 6116 KB Output is correct