oj.uz

답안 #1083307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083307 2024-09-02T22:05:12 Z hohemhein Mecho (IOI09_mecho) C++17
18 / 100
 42 ms 12380 KB 
#include <bits/stdc++.h>
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define f first
#define s second
#define pb push_back
#define pu push
#define ll long long
#define int long long
#define endl "\n"
#define all(x) (x).begin() , (x).end()
using namespace std;
const int nmax = 8e2+4;
const int oo = 1e12+3;
const ll mod = 1e9+7;

char m[nmax][nmax];
int bee[nmax][nmax];
int bear[nmax][nmax];

int mov[] = { 1,-1 };


void llenar(){

   for( int i = 0; i < nmax; i++ ){
    fill( bear[i], bear[i]+nmax, oo );
    fill( bee[i], bee[i]+nmax, oo );
   }

}

void bfsBee( vector<ii>&aux, int n ){
  queue<ii>c;
  for( auto [i,j] : aux ){
        c.pu({i,j});
        bee[i][j] = 0;
  }

  while( !c.empty() ){
     auto [x,y] = c.front();
     c.pop();

     for( int i = 0; i < 2; i++ )
        if( x+mov[i] > 0 && x+mov[i] <= n && m[ x+mov[i] ][y] != 'T' && bee[ x+mov[i] ][y] == oo ){
           c.pu( {x+mov[i],y} );
           bee[ x+mov[i] ][y] = bee[x][y]+1;
     }

     for( int i = 0; i < 2; i++ )
        if( y+mov[i] > 0 && y+mov[i] <= n && m[x][y+mov[i]] != 'T' && bee[x][y+mov[i]] == oo ){
           c.pu( {x,y+mov[i]} );
           bee[x][y+mov[i]] = bee[x][y]+1;
     }


  }

}


void bfsBear( ii X, int n, int k ){
  queue<iii>c;
  c.pu({{X.f,X.s},0});

  while( !c.empty() ){
     auto [x,y] = c.front().f; int pe = c.front().s;
     c.pop();
     for( int i = 0; i < 2; i++ )
        if( x+mov[i] > 0 && x+mov[i] <= n && m[ x+mov[i] ][y] != 'T' && bear[ x+mov[i] ][y] == oo && bee[ x+mov[i] ][y] > pe/k ){
           c.pu( { {x+mov[i],y}, pe+1 } );
           bear[ x+mov[i] ][y] = min( bear[x][y] , bee[ x+mov[i] ][y] - pe/k - 1 );
     }

     for( int i = 0; i < 2; i++ )
        if( y+mov[i] > 0 && y+mov[i] <= n && m[x][y+mov[i]] != 'T'&& bear[x][y+mov[i]] == oo && bee[x][y+mov[i]] > pe/k ){
           c.pu( {{x,y+mov[i]},pe+1} );
           bear[x][y+mov[i]] =  min( bear[x][y] , bee[x][y+mov[i]] - pe/k - 1 );
     }


  }

}



int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie();
    //cout << fixed << setprecision(4);

    /*ifstream cin ("atlarge.in");
    ofstream cout ("atlarge.out");*/


    llenar();

    int n, k; cin >> n >> k;
    ii init, meta;

    vector<ii>aux;

    for( int i = 1; i <= n; i++ )
        for( int j = 1; j <= n; j++ ){
            cin >> m[i][j];
            if( m[i][j] == 'H' )aux.pb({i,j});
            else if( m[i][j] == 'M' )init = {i,j};
            else if( m[i][j] == 'D' )meta = {i,j};
        }

     bfsBee( aux, n );

     bfsBear( init, n, k);

     if( bear[meta.f][meta.s] != oo )cout << bear[meta.f][meta.s] <<"\n";
     else cout <<"-1\n";

    return 0;
}

Subtask #1
18.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 10332 KB Output isn't correct
2 Incorrect 4 ms 10588 KB Output isn't correct
3 Incorrect 4 ms 10332 KB Output isn't correct
4 Incorrect 4 ms 10588 KB Output isn't correct
5 Correct 4 ms 10588 KB Output is correct
6 Incorrect 5 ms 10588 KB Output isn't correct
7 Incorrect 28 ms 11864 KB Output isn't correct
8 Incorrect 4 ms 10588 KB Output isn't correct
9 Correct 6 ms 10588 KB Output is correct
10 Correct 4 ms 10588 KB Output is correct
11 Correct 4 ms 10548 KB Output is correct
12 Incorrect 5 ms 10588 KB Output isn't correct
13 Correct 5 ms 10588 KB Output is correct
14 Correct 5 ms 10592 KB Output is correct
15 Incorrect 4 ms 10588 KB Output isn't correct
16 Correct 4 ms 10588 KB Output is correct
17 Incorrect 5 ms 10584 KB Output isn't correct
18 Correct 5 ms 10588 KB Output is correct
19 Incorrect 4 ms 10588 KB Output isn't correct
20 Correct 4 ms 10388 KB Output is correct
21 Incorrect 5 ms 10576 KB Output isn't correct
22 Correct 4 ms 10588 KB Output is correct
23 Incorrect 4 ms 10584 KB Output isn't correct
24 Correct 4 ms 10588 KB Output is correct
25 Incorrect 5 ms 10588 KB Output isn't correct
26 Correct 5 ms 10588 KB Output is correct
27 Incorrect 5 ms 10404 KB Output isn't correct
28 Correct 4 ms 10588 KB Output is correct
29 Incorrect 5 ms 10836 KB Output isn't correct
30 Correct 4 ms 10588 KB Output is correct
31 Incorrect 5 ms 10588 KB Output isn't correct
32 Correct 4 ms 10588 KB Output is correct
33 Incorrect 7 ms 10828 KB Output isn't correct
34 Correct 8 ms 10848 KB Output is correct
35 Incorrect 9 ms 10844 KB Output isn't correct
36 Incorrect 8 ms 10928 KB Output isn't correct
37 Correct 8 ms 10844 KB Output is correct
38 Incorrect 11 ms 10844 KB Output isn't correct
39 Incorrect 10 ms 11068 KB Output isn't correct
40 Correct 8 ms 11096 KB Output is correct
41 Incorrect 14 ms 11096 KB Output isn't correct
42 Incorrect 11 ms 11096 KB Output isn't correct
43 Correct 11 ms 11100 KB Output is correct
44 Incorrect 15 ms 11100 KB Output isn't correct
45 Incorrect 10 ms 11076 KB Output isn't correct
46 Correct 12 ms 11112 KB Output is correct
47 Incorrect 16 ms 11296 KB Output isn't correct
48 Incorrect 13 ms 11356 KB Output isn't correct
49 Correct 13 ms 11352 KB Output is correct
50 Incorrect 17 ms 11356 KB Output isn't correct
51 Incorrect 14 ms 11356 KB Output isn't correct
52 Correct 14 ms 11512 KB Output is correct
53 Incorrect 17 ms 11356 KB Output isn't correct
54 Incorrect 14 ms 11472 KB Output isn't correct
55 Correct 15 ms 11612 KB Output is correct
56 Incorrect 25 ms 11612 KB Output isn't correct
57 Incorrect 19 ms 11532 KB Output isn't correct
58 Correct 16 ms 11612 KB Output is correct
59 Incorrect 27 ms 11732 KB Output isn't correct
60 Incorrect 19 ms 11612 KB Output isn't correct
61 Correct 21 ms 11792 KB Output is correct
62 Incorrect 30 ms 11612 KB Output isn't correct
63 Correct 34 ms 11844 KB Output is correct
64 Correct 34 ms 11612 KB Output is correct
65 Correct 33 ms 11864 KB Output is correct
66 Incorrect 35 ms 11612 KB Output isn't correct
67 Correct 30 ms 11832 KB Output is correct
68 Correct 34 ms 11876 KB Output is correct
69 Correct 29 ms 11804 KB Output is correct
70 Correct 27 ms 11868 KB Output is correct
71 Correct 26 ms 11868 KB Output is correct
72 Incorrect 30 ms 11868 KB Output isn't correct
73 Incorrect 26 ms 12376 KB Output isn't correct
74 Correct 30 ms 12376 KB Output is correct
75 Correct 25 ms 12376 KB Output is correct
76 Correct 24 ms 12376 KB Output is correct
77 Correct 34 ms 12228 KB Output is correct
78 Correct 30 ms 12124 KB Output is correct
79 Incorrect 40 ms 12124 KB Output isn't correct
80 Incorrect 24 ms 12376 KB Output isn't correct
81 Incorrect 27 ms 12160 KB Output isn't correct
82 Incorrect 25 ms 12380 KB Output isn't correct
83 Correct 27 ms 12296 KB Output is correct
84 Incorrect 41 ms 12276 KB Output isn't correct
85 Incorrect 33 ms 12120 KB Output isn't correct
86 Incorrect 28 ms 12124 KB Output isn't correct
87 Incorrect 32 ms 12124 KB Output isn't correct
88 Correct 28 ms 12120 KB Output is correct
89 Incorrect 42 ms 12120 KB Output isn't correct
90 Incorrect 31 ms 12124 KB Output isn't correct
91 Incorrect 35 ms 12124 KB Output isn't correct
92 Incorrect 27 ms 12124 KB Output isn't correct