oj.uz

답안 #484123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484123 2021-11-02T06:50:37 Z nehasane Mecho (IOI09_mecho) C++14
31 / 100
 423 ms 7688 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], mecho_num[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;
}
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 = 2*n;
    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));
        //move bees
        for (auto i : hives)
            bees_q.push({i.first, i.second});
        while (!bees_q.empty()){
            int x = bees_q.front().first, y = bees_q.front().second;
            bees_q.pop();
            for (int i = 0; i < 4; i++){
                int nx = x + dx[i], ny = y + dy[i];
                if (valid_sq(nx, ny) && !bees_visited[nx][ny]){
                    if (bees_dis[x][y] <= 0){
                        if (abs(bees_dis[x][y]) < eating_time)
                            bees_dis[nx][ny] = bees_dis[x][y] - 1;
                        else
                            bees_dis[nx][ny] = 1;
                    }else
                        bees_dis[nx][ny] = abs(bees_dis[x][y]) + 1;
                    bees_q.push({nx, ny});
                    bees_visited[nx][ny] = true;
                }
            }
        }
        mecho_q.push({startx, starty});
        while (!mecho_q.empty()){
            int x = mecho_q.front().first, y = mecho_q.front().second;
            mecho_q.pop();
            for (int i = 0; i < 4; i++){
                int nx = x + dx[i], ny = y + dy[i];
                if (valid_sq(nx, ny) && !mecho_visited[nx][ny] && (mecho_dis[x][y] + 1) / s < bees_dis[nx][ny]){
                    mecho_visited[nx][ny] = true;
                    mecho_q.push({nx, ny});
                    mecho_dis[nx][ny] = mecho_dis[x][y] + 1;
                }
            }
        }
        if (mecho_visited[home_x][home_y])
            l = eating_time + 1;
        else
            r = eating_time - 1;
    }
    cout << l - 1 << '\n';
}

Compilation message

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

Subtask #1
31.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6476 KB Output is correct
2 Incorrect 6 ms 6476 KB Output isn't correct
3 Correct 4 ms 6476 KB Output is correct
4 Incorrect 4 ms 6476 KB Output isn't correct
5 Correct 5 ms 6476 KB Output is correct
6 Incorrect 4 ms 6476 KB Output isn't correct
7 Incorrect 319 ms 7492 KB Output isn't correct
8 Correct 4 ms 6476 KB Output is correct
9 Correct 4 ms 6476 KB Output is correct
10 Correct 4 ms 6476 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Incorrect 11 ms 6476 KB Output isn't correct
13 Incorrect 5 ms 6476 KB Output isn't correct
14 Correct 5 ms 6476 KB Output is correct
15 Incorrect 5 ms 6568 KB Output isn't correct
16 Incorrect 5 ms 6476 KB Output isn't correct
17 Incorrect 4 ms 6476 KB Output isn't correct
18 Incorrect 5 ms 6476 KB Output isn't correct
19 Incorrect 4 ms 6488 KB Output isn't correct
20 Incorrect 5 ms 6476 KB Output isn't correct
21 Incorrect 6 ms 6476 KB Output isn't correct
22 Incorrect 5 ms 6584 KB Output isn't correct
23 Incorrect 4 ms 6476 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 5 ms 6476 KB Output isn't correct
28 Incorrect 8 ms 6604 KB Output isn't correct
29 Incorrect 6 ms 6476 KB Output isn't correct
30 Incorrect 6 ms 6604 KB Output isn't correct
31 Incorrect 6 ms 6604 KB Output isn't correct
32 Incorrect 6 ms 6476 KB Output isn't correct
33 Incorrect 33 ms 6736 KB Output isn't correct
34 Incorrect 43 ms 6732 KB Output isn't correct
35 Correct 48 ms 6732 KB Output is correct
36 Incorrect 41 ms 6732 KB Output isn't correct
37 Incorrect 52 ms 6732 KB Output isn't correct
38 Correct 69 ms 6732 KB Output is correct
39 Incorrect 51 ms 6732 KB Output isn't correct
40 Incorrect 62 ms 6676 KB Output isn't correct
41 Correct 87 ms 6732 KB Output is correct
42 Incorrect 73 ms 6960 KB Output isn't correct
43 Incorrect 81 ms 7160 KB Output isn't correct
44 Correct 104 ms 7116 KB Output is correct
45 Incorrect 82 ms 7092 KB Output isn't correct
46 Incorrect 105 ms 7092 KB Output isn't correct
47 Correct 124 ms 7116 KB Output is correct
48 Incorrect 99 ms 7196 KB Output isn't correct
49 Incorrect 130 ms 7140 KB Output isn't correct
50 Correct 153 ms 7156 KB Output is correct
51 Incorrect 109 ms 7192 KB Output isn't correct
52 Incorrect 134 ms 7188 KB Output isn't correct
53 Correct 196 ms 7216 KB Output is correct
54 Incorrect 126 ms 7236 KB Output isn't correct
55 Incorrect 153 ms 7236 KB Output isn't correct
56 Correct 209 ms 7244 KB Output is correct
57 Incorrect 145 ms 7368 KB Output isn't correct
58 Incorrect 172 ms 7284 KB Output isn't correct
59 Correct 237 ms 7284 KB Output is correct
60 Incorrect 201 ms 7364 KB Output isn't correct
61 Incorrect 198 ms 7348 KB Output isn't correct
62 Correct 299 ms 7344 KB Output is correct
63 Correct 360 ms 7344 KB Output is correct
64 Correct 421 ms 7340 KB Output is correct
65 Correct 423 ms 7348 KB Output is correct
66 Correct 380 ms 7340 KB Output is correct
67 Correct 344 ms 7352 KB Output is correct
68 Correct 330 ms 7364 KB Output is correct
69 Correct 337 ms 7492 KB Output is correct
70 Correct 287 ms 7372 KB Output is correct
71 Correct 321 ms 7364 KB Output is correct
72 Incorrect 293 ms 7488 KB Output isn't correct
73 Incorrect 267 ms 7636 KB Output isn't correct
74 Correct 312 ms 7636 KB Output is correct
75 Correct 320 ms 7628 KB Output is correct
76 Correct 301 ms 7636 KB Output is correct
77 Correct 355 ms 7640 KB Output is correct
78 Correct 292 ms 7600 KB Output is correct
79 Correct 339 ms 7688 KB Output is correct
80 Correct 278 ms 7604 KB Output is correct
81 Correct 346 ms 7560 KB Output is correct
82 Correct 324 ms 7604 KB Output is correct
83 Correct 337 ms 7476 KB Output is correct
84 Correct 339 ms 7572 KB Output is correct
85 Correct 323 ms 7560 KB Output is correct
86 Correct 351 ms 7560 KB Output is correct
87 Correct 319 ms 7540 KB Output is correct
88 Correct 356 ms 7492 KB Output is correct
89 Correct 327 ms 7508 KB Output is correct
90 Correct 338 ms 7504 KB Output is correct
91 Correct 340 ms 7508 KB Output is correct
92 Correct 305 ms 7500 KB Output is correct