oj.uz

답안 #578700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578700 2022-06-17T16:54:55 Z a_aguilo Mecho (IOI09_mecho) C++14
84 / 100
 252 ms 6200 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+1)/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 k = -1;
    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;
            k = mid;
        }
        else hi = mid-1;
    }
    cout << k << 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
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 123 ms 6096 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 340 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 Correct 1 ms 236 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 11 ms 1412 KB Output is correct
34 Correct 11 ms 1404 KB Output is correct
35 Correct 25 ms 1404 KB Output is correct
36 Correct 16 ms 1748 KB Output is correct
37 Correct 17 ms 1748 KB Output is correct
38 Correct 37 ms 1752 KB Output is correct
39 Correct 21 ms 2168 KB Output is correct
40 Correct 19 ms 2116 KB Output is correct
41 Correct 51 ms 2124 KB Output is correct
42 Correct 23 ms 2608 KB Output is correct
43 Correct 25 ms 2548 KB Output is correct
44 Correct 58 ms 2580 KB Output is correct
45 Correct 28 ms 2996 KB Output is correct
46 Correct 29 ms 3040 KB Output is correct
47 Correct 74 ms 3012 KB Output is correct
48 Correct 38 ms 3560 KB Output is correct
49 Correct 36 ms 3584 KB Output is correct
50 Correct 80 ms 3516 KB Output is correct
51 Correct 43 ms 4068 KB Output is correct
52 Correct 38 ms 4064 KB Output is correct
53 Correct 106 ms 4076 KB Output is correct
54 Correct 49 ms 4744 KB Output is correct
55 Correct 52 ms 4736 KB Output is correct
56 Correct 111 ms 4700 KB Output is correct
57 Correct 55 ms 5376 KB Output is correct
58 Correct 55 ms 5384 KB Output is correct
59 Correct 153 ms 5356 KB Output is correct
60 Correct 66 ms 6060 KB Output is correct
61 Correct 61 ms 6068 KB Output is correct
62 Correct 161 ms 6052 KB Output is correct
63 Correct 172 ms 6108 KB Output is correct
64 Correct 252 ms 6032 KB Output is correct
65 Correct 195 ms 6124 KB Output is correct
66 Correct 207 ms 6080 KB Output is correct
67 Correct 166 ms 6044 KB Output is correct
68 Correct 92 ms 6112 KB Output is correct
69 Correct 89 ms 6080 KB Output is correct
70 Correct 80 ms 6092 KB Output is correct
71 Correct 92 ms 6080 KB Output is correct
72 Incorrect 73 ms 6104 KB Output isn't correct
73 Incorrect 115 ms 6096 KB Output isn't correct
74 Correct 104 ms 6080 KB Output is correct
75 Correct 123 ms 6084 KB Output is correct
76 Correct 117 ms 6104 KB Output is correct
77 Correct 104 ms 6108 KB Output is correct
78 Correct 128 ms 6068 KB Output is correct
79 Correct 89 ms 6076 KB Output is correct
80 Correct 99 ms 6152 KB Output is correct
81 Correct 110 ms 6092 KB Output is correct
82 Correct 105 ms 6072 KB Output is correct
83 Correct 124 ms 6084 KB Output is correct
84 Correct 103 ms 6068 KB Output is correct
85 Correct 108 ms 6084 KB Output is correct
86 Correct 119 ms 6200 KB Output is correct
87 Correct 125 ms 6168 KB Output is correct
88 Correct 114 ms 6068 KB Output is correct
89 Correct 118 ms 6144 KB Output is correct
90 Correct 129 ms 6080 KB Output is correct
91 Correct 126 ms 6120 KB Output is correct
92 Correct 126 ms 6144 KB Output is correct