oj.uz

답안 #578682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578682 2022-06-17T15:09:56 Z a_aguilo Mecho (IOI09_mecho) C++14
38 / 100
 244 ms 6232 KB 
#include<bits/stdc++.h>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;

typedef vector<char> vc;
typedef vector<vc> vvc;

int INF = 1e9;
int n, s;

vvi FloodFill (vector<pair<int, int>>& V, vvc& CharMap){
    vvi ans(n, vi(n, INF));
    queue<pair<int, int>> Q;
    for(pair<int, int> start : V){
        Q.push(start);
        ans[start.first][start.second] = 0;
    }
    while(!Q.empty()){
        pair<int, int> act = Q.front(); Q.pop();
        int Xact = act.first;
        int Yact = act.second;
        if(Xact > 0 and ans[Xact-1][Yact] == INF and CharMap[Xact-1][Yact] == 'G'){
            ans[Xact-1][Yact] = ans[Xact][Yact]+1;
            Q.push(make_pair(Xact-1, Yact));
        }
        if (Yact > 0 and ans[Xact][Yact-1]== INF and CharMap[Xact][Yact-1] == 'G'){
            ans[Xact][Yact-1] = ans[Xact][Yact]+1;
            Q.push(make_pair(Xact, Yact-1));
        }
        if(Xact < (n-1) and ans[Xact+1][Yact] == INF and CharMap[Xact+1][Yact] == 'G'){
            ans[Xact+1][Yact] = ans[Xact][Yact]+1;
            Q.push(make_pair(Xact+1, Yact));
        }
        if(Yact < (n-1) and ans[Xact][Yact+1] == INF and CharMap[Xact][Yact+1] == 'G'){
            ans[Xact][Yact+1] = ans[Xact][Yact]+1;
            Q.push(make_pair(Xact, Yact+1));
        }
    }
    return ans;
}

bool bfsMecho (pair<int, int> StartPos, int initialTime, vvi& listaAdy, vvc& CharMap){
    vvi visited (n, vi(n, 0));
    visited[StartPos.first][StartPos.second] = 1;
    queue<pair<int, pair<int, int>>> Q;
    Q.push(make_pair(initialTime*s, StartPos));
    while(!Q.empty()){
        pair<int, pair<int, int>> act = Q.front(); Q.pop();
        int PasosAct = act.first;
        int MinuteAct = PasosAct/s;
        int x = act.second.first;
        int y = act.second.second;

        if(CharMap[x][y] == 'D') return true;

        if(x > 0 and MinuteAct < listaAdy[x-1][y] and (CharMap[x-1][y] == 'G' or CharMap[x-1][y] == 'D') and !visited[x-1][y] ){
            Q.push(make_pair(PasosAct+1, make_pair(x-1, y)));
            visited[x-1][y] = 1;
        }
        if(y > 0 and MinuteAct < listaAdy[x][y-1] and (CharMap[x][y-1] == 'G' or CharMap[x][y-1] == 'D') and !visited[x][y-1]){
            Q.push(make_pair(PasosAct+1, make_pair(x, y-1)));
            visited[x][y-1] = 1;
        }
        if(x < (n-1) and MinuteAct < listaAdy[x+1][y] and (CharMap[x+1][y] == 'G' or CharMap[x+1][y] == 'D') and !visited[x+1][y]){
            Q.push(make_pair(PasosAct+1, make_pair(x+1, y)));
            visited[x+1][y] = 1;
        }
        if(y < (n-1) and MinuteAct < listaAdy[x][y+1] and (CharMap[x][y+1] == 'G' or CharMap[x][y+1] == 'D') and !visited[x][y+1] ){
            Q.push(make_pair(PasosAct+1, make_pair(x, y+1)));
            visited[x][y+1] = 1;
        }
    }
    return false;
}

int main(){
    char c;
    cin >> n >> s;
    vector<pair<int, int>> IniciosAbejas;
    pair<int, int> InicioMecho;
    vvc mapa(n, vc(n));
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            cin >> c;
            //T = tree --> no one can pass
            //M = mecho initially
            //D = target
            //G = grass
            //H = hive
            if(c == 'M') InicioMecho = make_pair(i, j);
            else if (c == 'H') IniciosAbejas.push_back(make_pair(i, j));
            mapa[i][j] = c;
        }
    }
    vvi Matrix = FloodFill(IniciosAbejas, mapa);

    int hi = n*n;
    int lo = 0;
    while(hi >= lo){
        int mid = lo + (hi-lo)/2;
        if(bfsMecho(InicioMecho, mid, Matrix, mapa)) lo = mid+1;
        else hi = mid-1;
    }
    if(hi < 0 and !bfsMecho(InicioMecho, 0, Matrix, mapa)) cout << -1 << endl;
    else if (hi < 0) cout << 0;
    else cout << hi << endl;

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

    return 0;
}

Subtask #1
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 126 ms 6092 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Correct 1 ms 340 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Correct 1 ms 212 KB Output is correct
19 Incorrect 1 ms 212 KB Output isn't correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 1 ms 212 KB Output isn't correct
24 Correct 1 ms 212 KB Output is correct
25 Incorrect 1 ms 212 KB Output isn't correct
26 Correct 1 ms 212 KB Output is correct
27 Incorrect 1 ms 340 KB Output isn't correct
28 Correct 1 ms 340 KB Output is correct
29 Incorrect 1 ms 340 KB Output isn't correct
30 Correct 1 ms 340 KB Output is correct
31 Incorrect 1 ms 340 KB Output isn't correct
32 Correct 1 ms 340 KB Output is correct
33 Incorrect 12 ms 1408 KB Output isn't correct
34 Correct 12 ms 1412 KB Output is correct
35 Correct 29 ms 1408 KB Output is correct
36 Incorrect 15 ms 1748 KB Output isn't correct
37 Correct 15 ms 1748 KB Output is correct
38 Correct 34 ms 1632 KB Output is correct
39 Incorrect 21 ms 2120 KB Output isn't correct
40 Correct 20 ms 2188 KB Output is correct
41 Correct 49 ms 2148 KB Output is correct
42 Incorrect 26 ms 2556 KB Output isn't correct
43 Correct 24 ms 2584 KB Output is correct
44 Correct 59 ms 2576 KB Output is correct
45 Incorrect 31 ms 3012 KB Output isn't correct
46 Correct 30 ms 3036 KB Output is correct
47 Correct 71 ms 3064 KB Output is correct
48 Incorrect 35 ms 3512 KB Output isn't correct
49 Correct 35 ms 3508 KB Output is correct
50 Correct 81 ms 3524 KB Output is correct
51 Incorrect 42 ms 4108 KB Output isn't correct
52 Correct 43 ms 4212 KB Output is correct
53 Correct 100 ms 4104 KB Output is correct
54 Incorrect 50 ms 4736 KB Output isn't correct
55 Correct 52 ms 4744 KB Output is correct
56 Correct 140 ms 4716 KB Output is correct
57 Incorrect 65 ms 5380 KB Output isn't correct
58 Correct 55 ms 5364 KB Output is correct
59 Correct 150 ms 5384 KB Output is correct
60 Incorrect 67 ms 6096 KB Output isn't correct
61 Correct 61 ms 6052 KB Output is correct
62 Correct 155 ms 6036 KB Output is correct
63 Correct 156 ms 6040 KB Output is correct
64 Correct 244 ms 6032 KB Output is correct
65 Correct 202 ms 6032 KB Output is correct
66 Incorrect 194 ms 6056 KB Output isn't correct
67 Correct 170 ms 6044 KB Output is correct
68 Correct 98 ms 6192 KB Output is correct
69 Correct 99 ms 6092 KB Output is correct
70 Correct 86 ms 6100 KB Output is correct
71 Correct 86 ms 6080 KB Output is correct
72 Incorrect 87 ms 6192 KB Output isn't correct
73 Incorrect 123 ms 6152 KB Output isn't correct
74 Correct 109 ms 6108 KB Output is correct
75 Correct 113 ms 6100 KB Output is correct
76 Correct 102 ms 6104 KB Output is correct
77 Correct 126 ms 6084 KB Output is correct
78 Correct 129 ms 6084 KB Output is correct
79 Correct 83 ms 6096 KB Output is correct
80 Correct 99 ms 6104 KB Output is correct
81 Correct 127 ms 6088 KB Output is correct
82 Correct 105 ms 6056 KB Output is correct
83 Correct 115 ms 6088 KB Output is correct
84 Correct 113 ms 6072 KB Output is correct
85 Correct 128 ms 6072 KB Output is correct
86 Correct 149 ms 6068 KB Output is correct
87 Correct 117 ms 6232 KB Output is correct
88 Correct 123 ms 6184 KB Output is correct
89 Correct 139 ms 6072 KB Output is correct
90 Correct 130 ms 6068 KB Output is correct
91 Correct 134 ms 6120 KB Output is correct
92 Correct 133 ms 6076 KB Output is correct