oj.uz

답안 #484068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484068 2021-11-02T04:55:14 Z nehasane Mecho (IOI09_mecho) C++14
12 / 100
 317 ms 8268 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 800;
vector <string> field(MAX_N);
bool bees_visited[MAX_N][MAX_N], mecho_visited[MAX_N][MAX_N];
int mecho_dis[MAX_N][MAX_N], bees_dis[MAX_N][MAX_N];
queue <pair <int, int>> mecho_q, bees_q;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int n, s;
bool valid_sq(int x, int y){
    if (x >= 0 && x < n && y >= 0 && y < n && field[x][y] != 'T' && field[x][y] != 'H')
        return true;
    return false;
}
void update_field(queue <pair <int, int>> &q, int max_steps, bool (&visited)[MAX_N][MAX_N], bool (&visited2)[MAX_N][MAX_N], int (&dis)[MAX_N][MAX_N]){
    while (!q.empty() && dis[q.front().first][q.front().second] != -1){
        int x = q.front().first, y = q.front().second;
        q.pop();
        for (int i = 0; i < 4; i++){
            if (valid_sq(x + dx[i], y + dy[i]) && !visited[x+dx[i]][y+dy[i]] && !visited2[x+dx[i]][y+dy[i]]){
                q.push({x+dx[i], y+dy[i]});
                visited[x+dx[i]][y+dy[i]] = true;
                if (dis[x][y] + 1 < max_steps)
                    dis[x+dx[i]][y+dy[i]] = dis[x][y] + 1;
                else
                    dis[x+dx[i]][y+dy[i]] = -1;
            }
        }
    }
}
int main()
{
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    cin >> n >> s;
    for (int i = 0; i < n; i++)
        cin >> field[i];
    vector <pair <int, int>> hives;
    int startx, starty, home_x, home_y;
    //find Mecho's position
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if (field[i][j] == 'M'){
                startx = i;
                starty = j;
            }else if (field[i][j] == 'H'){
                hives.push_back({i, j});
            }else if (field[i][j] == 'D'){
                home_x = i;
                home_y = j;
            }
        }
    }
    int l = 0, r = n + n - 2;
    while (l <= r){
        int eating_time = (l + r) / 2;
        memset(bees_visited, false, sizeof(bees_visited));
        memset(mecho_visited, false, sizeof(mecho_visited));
        memset(bees_dis, 0, sizeof(bees_dis));
        memset(mecho_dis, 0, sizeof(mecho_dis));
        //simulate
        for (auto i : hives){
            bees_q.push({i.first, i.second});
            bees_visited[i.first][i.second] = true;
        }
        update_field(bees_q, eating_time, bees_visited, bees_visited, bees_dis);
        mecho_q.push({startx, starty});
        for (int i = eating_time; i <= n*2-2; i++){
            while (!bees_q.empty() && bees_dis[bees_q.front().first][bees_q.front().second] == -1){
                bees_dis[bees_q.front().first][bees_q.front().second] = 0;
                bees_q.push({bees_q.front().first, bees_q.front().second});
                bees_q.pop();
            }while (!mecho_q.empty() && mecho_dis[mecho_q.front().first][mecho_q.front().second] == -1){
                mecho_dis[mecho_q.front().first][mecho_q.front().second] = 0;
                mecho_q.push({mecho_q.front().first, mecho_q.front().second});
                mecho_q.pop();
            }
            update_field(mecho_q, s, mecho_visited, bees_visited, mecho_dis);
            update_field(bees_q, 1, bees_visited, bees_visited, bees_dis);
        }

        if (mecho_visited[home_x][home_y])
            l = eating_time + 1;
        else
            r = eating_time - 1;
    }
    if (r == -1)
        r = 0;
    cout << r << '\n';
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:83:41: warning: 'home_y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |         if (mecho_visited[home_x][home_y])
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
mecho.cpp:83:41: warning: 'home_x' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
12.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 6476 KB Output isn't correct
2 Incorrect 4 ms 6588 KB Output isn't correct
3 Incorrect 4 ms 6476 KB Output isn't correct
4 Incorrect 6 ms 6476 KB Output isn't correct
5 Correct 4 ms 6476 KB Output is correct
6 Incorrect 4 ms 6476 KB Output isn't correct
7 Incorrect 256 ms 8072 KB Output isn't correct
8 Incorrect 3 ms 6476 KB Output isn't correct
9 Correct 4 ms 6476 KB Output is correct
10 Correct 4 ms 6524 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Incorrect 7 ms 6476 KB Output isn't correct
13 Incorrect 8 ms 6592 KB Output isn't correct
14 Incorrect 7 ms 6472 KB Output isn't correct
15 Incorrect 4 ms 6476 KB Output isn't correct
16 Incorrect 5 ms 6476 KB Output isn't correct
17 Incorrect 5 ms 6476 KB Output isn't correct
18 Incorrect 4 ms 6476 KB Output isn't correct
19 Incorrect 4 ms 6476 KB Output isn't correct
20 Incorrect 4 ms 6472 KB Output isn't correct
21 Incorrect 4 ms 6480 KB Output isn't correct
22 Incorrect 4 ms 6480 KB Output isn't correct
23 Incorrect 5 ms 6472 KB Output isn't correct
24 Incorrect 6 ms 6476 KB Output isn't correct
25 Incorrect 5 ms 6476 KB Output isn't correct
26 Incorrect 5 ms 6476 KB Output isn't correct
27 Incorrect 6 ms 6588 KB Output isn't correct
28 Incorrect 5 ms 6476 KB Output isn't correct
29 Incorrect 6 ms 6476 KB Output isn't correct
30 Incorrect 7 ms 6476 KB Output isn't correct
31 Incorrect 8 ms 6604 KB Output isn't correct
32 Incorrect 8 ms 6592 KB Output isn't correct
33 Incorrect 9 ms 6860 KB Output isn't correct
34 Incorrect 20 ms 6864 KB Output isn't correct
35 Correct 46 ms 6860 KB Output is correct
36 Incorrect 10 ms 6892 KB Output isn't correct
37 Incorrect 22 ms 6860 KB Output isn't correct
38 Correct 64 ms 6828 KB Output is correct
39 Incorrect 11 ms 6988 KB Output isn't correct
40 Incorrect 28 ms 6988 KB Output isn't correct
41 Correct 104 ms 6996 KB Output is correct
42 Incorrect 13 ms 7304 KB Output isn't correct
43 Incorrect 27 ms 7276 KB Output isn't correct
44 Correct 95 ms 7216 KB Output is correct
45 Incorrect 14 ms 7372 KB Output isn't correct
46 Incorrect 42 ms 7380 KB Output isn't correct
47 Correct 142 ms 7392 KB Output is correct
48 Incorrect 17 ms 7516 KB Output isn't correct
49 Incorrect 51 ms 7520 KB Output isn't correct
50 Correct 142 ms 7508 KB Output is correct
51 Incorrect 17 ms 7500 KB Output isn't correct
52 Incorrect 44 ms 7520 KB Output isn't correct
53 Correct 170 ms 7532 KB Output is correct
54 Incorrect 20 ms 7724 KB Output isn't correct
55 Incorrect 51 ms 7628 KB Output isn't correct
56 Correct 199 ms 7716 KB Output is correct
57 Incorrect 21 ms 7852 KB Output isn't correct
58 Incorrect 65 ms 7744 KB Output isn't correct
59 Correct 228 ms 7756 KB Output is correct
60 Incorrect 24 ms 7968 KB Output isn't correct
61 Incorrect 70 ms 7856 KB Output isn't correct
62 Correct 278 ms 7960 KB Output is correct
63 Correct 227 ms 7884 KB Output is correct
64 Incorrect 202 ms 7876 KB Output isn't correct
65 Incorrect 268 ms 7884 KB Output isn't correct
66 Incorrect 231 ms 7972 KB Output isn't correct
67 Incorrect 216 ms 7872 KB Output isn't correct
68 Correct 252 ms 8012 KB Output is correct
69 Correct 259 ms 7992 KB Output is correct
70 Correct 262 ms 7984 KB Output is correct
71 Correct 317 ms 7992 KB Output is correct
72 Incorrect 223 ms 8012 KB Output isn't correct
73 Incorrect 216 ms 8260 KB Output isn't correct
74 Correct 245 ms 8256 KB Output is correct
75 Correct 224 ms 8264 KB Output is correct
76 Correct 258 ms 8260 KB Output is correct
77 Correct 237 ms 8268 KB Output is correct
78 Incorrect 249 ms 8224 KB Output isn't correct
79 Correct 278 ms 8220 KB Output is correct
80 Correct 230 ms 8216 KB Output is correct
81 Correct 260 ms 8196 KB Output is correct
82 Correct 249 ms 8140 KB Output is correct
83 Correct 269 ms 8152 KB Output is correct
84 Correct 255 ms 8188 KB Output is correct
85 Correct 273 ms 8268 KB Output is correct
86 Correct 262 ms 8152 KB Output is correct
87 Correct 271 ms 8112 KB Output is correct
88 Correct 286 ms 8140 KB Output is correct
89 Correct 310 ms 8120 KB Output is correct
90 Correct 270 ms 8132 KB Output is correct
91 Correct 276 ms 8132 KB Output is correct
92 Correct 239 ms 8140 KB Output is correct