oj.uz

답안 #1083670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083670 2024-09-03T19:09:08 Z hohemhein Mecho (IOI09_mecho) C++17
34 / 100
 133 ms 13392 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, -1 );
    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] == 'G' && 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]] == 'G' && 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 ){
  priority_queue<iiii>c;
  bear[X.f][X.s] = bee[X.f][X.s] - 1;
  c.pu({ {bear[X.f][X.s],0} , X });

  while( !c.empty() ){
     auto [x,y] = c.top().s;
     auto [val,pe] = c.top().f;
     pe*=-1;
     c.pop();

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

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

  }

}



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};
        }
     m[init.f][init.s] = 'G';
     bfsBee( aux, n );

     bfsBear( init, n, k);

    /* for( int i = 1; i <= n; i++ ){
        for( int j = 1; j <= n; j++ )
        cout << bear[i][j] <<" ";
        cout <<"\n";
     }*/

     cout << bear[meta.f][meta.s] <<"\n";


    return 0;
}

Subtask #1
34.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 10584 KB Output isn't correct
2 Incorrect 6 ms 10548 KB Output isn't correct
3 Incorrect 4 ms 10588 KB Output isn't correct
4 Incorrect 5 ms 10332 KB Output isn't correct
5 Correct 4 ms 10584 KB Output is correct
6 Correct 5 ms 10584 KB Output is correct
7 Correct 62 ms 12112 KB Output is correct
8 Incorrect 4 ms 10588 KB Output isn't correct
9 Correct 6 ms 10596 KB Output is correct
10 Correct 5 ms 10584 KB Output is correct
11 Correct 5 ms 10588 KB Output is correct
12 Correct 6 ms 10568 KB Output is correct
13 Correct 4 ms 10588 KB Output is correct
14 Correct 5 ms 10588 KB Output is correct
15 Incorrect 5 ms 10588 KB Output isn't correct
16 Correct 5 ms 10588 KB Output is correct
17 Incorrect 5 ms 10588 KB Output isn't correct
18 Correct 5 ms 10588 KB Output is correct
19 Incorrect 6 ms 10588 KB Output isn't correct
20 Correct 6 ms 10588 KB Output is correct
21 Incorrect 4 ms 10584 KB Output isn't correct
22 Correct 4 ms 10588 KB Output is correct
23 Incorrect 4 ms 10588 KB Output isn't correct
24 Correct 4 ms 10620 KB Output is correct
25 Incorrect 4 ms 10588 KB Output isn't correct
26 Correct 4 ms 10588 KB Output is correct
27 Incorrect 5 ms 10428 KB Output isn't correct
28 Correct 4 ms 10580 KB Output is correct
29 Incorrect 5 ms 10584 KB Output isn't correct
30 Correct 5 ms 10588 KB Output is correct
31 Incorrect 6 ms 10584 KB Output isn't correct
32 Correct 5 ms 10588 KB Output is correct
33 Incorrect 7 ms 10844 KB Output isn't correct
34 Correct 8 ms 10744 KB Output is correct
35 Correct 14 ms 10844 KB Output is correct
36 Incorrect 9 ms 11056 KB Output isn't correct
37 Correct 9 ms 10844 KB Output is correct
38 Correct 17 ms 11072 KB Output is correct
39 Incorrect 9 ms 11100 KB Output isn't correct
40 Correct 9 ms 11100 KB Output is correct
41 Correct 21 ms 11164 KB Output is correct
42 Incorrect 11 ms 11096 KB Output isn't correct
43 Correct 12 ms 10972 KB Output is correct
44 Correct 25 ms 11100 KB Output is correct
45 Incorrect 12 ms 11100 KB Output isn't correct
46 Correct 14 ms 11100 KB Output is correct
47 Correct 40 ms 11224 KB Output is correct
48 Incorrect 13 ms 11356 KB Output isn't correct
49 Correct 14 ms 11364 KB Output is correct
50 Correct 37 ms 11356 KB Output is correct
51 Incorrect 15 ms 11356 KB Output isn't correct
52 Correct 16 ms 11356 KB Output is correct
53 Correct 39 ms 11384 KB Output is correct
54 Incorrect 16 ms 11356 KB Output isn't correct
55 Correct 19 ms 11356 KB Output is correct
56 Correct 47 ms 11656 KB Output is correct
57 Incorrect 18 ms 11696 KB Output isn't correct
58 Correct 19 ms 11668 KB Output is correct
59 Correct 55 ms 11772 KB Output is correct
60 Incorrect 22 ms 11608 KB Output isn't correct
61 Correct 21 ms 11608 KB Output is correct
62 Correct 63 ms 11896 KB Output is correct
63 Correct 52 ms 11612 KB Output is correct
64 Correct 60 ms 11612 KB Output is correct
65 Correct 54 ms 11612 KB Output is correct
66 Incorrect 54 ms 11836 KB Output isn't correct
67 Correct 39 ms 11612 KB Output is correct
68 Correct 34 ms 11888 KB Output is correct
69 Correct 34 ms 11868 KB Output is correct
70 Correct 30 ms 11868 KB Output is correct
71 Correct 29 ms 11868 KB Output is correct
72 Correct 39 ms 11668 KB Output is correct
73 Correct 44 ms 12380 KB Output is correct
74 Incorrect 106 ms 13356 KB Output isn't correct
75 Incorrect 49 ms 12380 KB Output isn't correct
76 Incorrect 44 ms 12380 KB Output isn't correct
77 Correct 69 ms 12380 KB Output is correct
78 Correct 51 ms 12380 KB Output is correct
79 Incorrect 101 ms 13392 KB Output isn't correct
80 Correct 51 ms 12124 KB Output is correct
81 Incorrect 48 ms 12376 KB Output isn't correct
82 Incorrect 67 ms 12328 KB Output isn't correct
83 Incorrect 56 ms 12124 KB Output isn't correct
84 Incorrect 133 ms 13292 KB Output isn't correct
85 Correct 57 ms 12124 KB Output is correct
86 Incorrect 58 ms 12128 KB Output isn't correct
87 Correct 68 ms 12124 KB Output is correct
88 Incorrect 60 ms 12120 KB Output isn't correct
89 Incorrect 104 ms 13184 KB Output isn't correct
90 Correct 59 ms 12084 KB Output is correct
91 Correct 76 ms 12672 KB Output is correct
92 Correct 68 ms 11952 KB Output is correct