oj.uz

답안 #578699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578699 2022-06-17T16:42:02 Z a_aguilo Mecho (IOI09_mecho) C++14
38 / 100
 253 ms 6236 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 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
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 122 ms 6060 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 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 0 ms 212 KB Output is correct
19 Incorrect 1 ms 212 KB Output isn't correct
20 Correct 0 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 340 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 352 KB Output is correct
33 Incorrect 12 ms 1440 KB Output isn't correct
34 Correct 12 ms 1408 KB Output is correct
35 Correct 26 ms 1456 KB Output is correct
36 Incorrect 15 ms 1760 KB Output isn't correct
37 Correct 15 ms 1748 KB Output is correct
38 Correct 34 ms 1800 KB Output is correct
39 Incorrect 18 ms 2116 KB Output isn't correct
40 Correct 20 ms 2116 KB Output is correct
41 Correct 45 ms 2108 KB Output is correct
42 Incorrect 23 ms 2556 KB Output isn't correct
43 Correct 23 ms 2588 KB Output is correct
44 Correct 57 ms 2552 KB Output is correct
45 Incorrect 30 ms 3012 KB Output isn't correct
46 Correct 29 ms 3012 KB Output is correct
47 Correct 71 ms 3060 KB Output is correct
48 Incorrect 34 ms 3600 KB Output isn't correct
49 Correct 34 ms 3572 KB Output is correct
50 Correct 83 ms 3568 KB Output is correct
51 Incorrect 42 ms 4132 KB Output isn't correct
52 Correct 39 ms 4068 KB Output is correct
53 Correct 101 ms 4100 KB Output is correct
54 Incorrect 45 ms 4744 KB Output isn't correct
55 Correct 44 ms 4732 KB Output is correct
56 Correct 120 ms 4684 KB Output is correct
57 Incorrect 51 ms 5356 KB Output isn't correct
58 Correct 52 ms 5376 KB Output is correct
59 Correct 137 ms 5348 KB Output is correct
60 Incorrect 61 ms 6136 KB Output isn't correct
61 Correct 64 ms 6060 KB Output is correct
62 Correct 158 ms 6048 KB Output is correct
63 Correct 153 ms 6032 KB Output is correct
64 Correct 253 ms 6032 KB Output is correct
65 Correct 197 ms 6036 KB Output is correct
66 Incorrect 185 ms 6088 KB Output isn't correct
67 Correct 160 ms 6040 KB Output is correct
68 Correct 90 ms 6080 KB Output is correct
69 Correct 92 ms 6132 KB Output is correct
70 Correct 78 ms 6080 KB Output is correct
71 Correct 84 ms 6084 KB Output is correct
72 Incorrect 77 ms 6140 KB Output isn't correct
73 Incorrect 113 ms 6088 KB Output isn't correct
74 Correct 100 ms 6100 KB Output is correct
75 Correct 107 ms 6088 KB Output is correct
76 Correct 98 ms 6088 KB Output is correct
77 Correct 99 ms 6148 KB Output is correct
78 Correct 116 ms 6084 KB Output is correct
79 Correct 85 ms 6080 KB Output is correct
80 Correct 99 ms 6080 KB Output is correct
81 Correct 107 ms 6148 KB Output is correct
82 Correct 109 ms 6172 KB Output is correct
83 Correct 121 ms 6108 KB Output is correct
84 Correct 109 ms 6060 KB Output is correct
85 Correct 117 ms 6104 KB Output is correct
86 Correct 111 ms 6128 KB Output is correct
87 Correct 106 ms 6076 KB Output is correct
88 Correct 115 ms 6060 KB Output is correct
89 Correct 122 ms 6236 KB Output is correct
90 Correct 123 ms 6068 KB Output is correct
91 Correct 120 ms 6224 KB Output is correct
92 Correct 132 ms 6116 KB Output is correct