oj.uz

답안 #858182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858182 2023-10-07T14:39:05 Z BBart888 Mecho (IOI09_mecho) C++14
21 / 100
 180 ms 10672 KB 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <array>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <stdio.h>      /* printf, scanf, puts, NULL */
#include <stdlib.h>     /* srand, rand */
#include <time.h> 
#include <unordered_map>
#include <string>
#include <fstream>



using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Mat = vector<vector<ll>>;

const ll MOD = 2019201997LL;
const ll FACTOR1 = 2019201913LL;
const ll FACTOR2 = 2019201949LL;
const int MAXN = 1e3 + 11;




int n, s, l, r;
char t[MAXN][MAXN];
vector<pair<int,int>>hives;
int dx[]{ 0,0,-1,1 };
int dy[]{ 1,-1,0,0 };
int dist[MAXN][MAXN];
pair<int, int> bear,house;




bool within(int x, int y)
{
    return (x >= 0 && y >= 0 && x < n&& y < n);
}


void action()
{
    queue<pair<int, int>> q;
    vector<vector<int>> vis(n, vector<int>(n));

    for (auto h : hives)
    {
        q.push(h);
        vis[h.first][h.second] = true;
    }

    while (!q.empty())
    {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();

        for (int d = 0; d < 4; d++)
        {
            int newX = x + dx[d];
            int newY = y + dy[d];
            if (!within(newX, newY) || t[newX][newY] == 'T'
                || vis[newX][newY])
                continue;
            vis[newX][newY] = true;
            q.push({ newX,newY });
            dist[newX][newY] = dist[x][y] + 1;
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            dist[i][j] *= s;

}



bool check(int mins)
{
    queue<pair<int,int>> q;
    vector<vector<int>>bear_dist(n, vector<int>(n));
    vector<vector<int>> vis(n, vector<int>(n));

    q.push(bear);
    vis[bear.first][bear.second] = true;

    while (!q.empty())
    {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        //cout << x << " " << y << " " << bear_dist[x][y] <<" VS "<<
           // dist[x][y]<<'\n';
        for (int d = 0; d < 4; d++)
        {
            int newX = x + dx[d];
            int newY = y + dy[d];
            if (!within(newX, newY) || (t[newX][newY] == 'T') || (
                bear_dist[x][y]+1> dist[newX][newY]-s*mins) || vis[newX][newY])
                continue;
            vis[newX][newY] = true;
            q.push({ newX,newY });
            bear_dist[newX][newY] = bear_dist[x][y] + 1;
        }

    }

    return bear_dist[house.first][house.second] > 0;
}



int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    //freopen("lasers.in", "r", stdin);
    //freopen("lasers.out", "w", stdout);


    cin >> n >> s;

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cin >> t[i][j];
            if (t[i][j] == 'H')
                hives.push_back({ i,j });
            if (t[i][j] == 'M')
                bear = { i,j };
            if (t[i][j] == 'D')
                house = { i,j };
        }
    }


    action();

    
    int l = 0, r = n * n;
    while (l < r)
    {
        int m = (l + r + 1) / 2;
        if (check(m))
            l = m;
        else
            r = m - 1;
    }

    if (l == n * n)
        cout << -1 << '\n';
    else
        cout << l << '\n';




    return 0;
}

Subtask #1
21.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Incorrect 0 ms 2396 KB Output isn't correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 0 ms 2396 KB Output isn't correct
7 Incorrect 99 ms 10360 KB Output isn't correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2548 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 4700 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't correct
14 Incorrect 1 ms 2652 KB Output isn't correct
15 Incorrect 1 ms 2396 KB Output isn't correct
16 Correct 1 ms 2396 KB Output is correct
17 Incorrect 1 ms 2648 KB Output isn't correct
18 Correct 1 ms 2396 KB Output is correct
19 Incorrect 1 ms 2396 KB Output isn't correct
20 Correct 1 ms 2396 KB Output is correct
21 Incorrect 1 ms 2652 KB Output isn't correct
22 Correct 1 ms 2652 KB Output is correct
23 Incorrect 1 ms 2652 KB Output isn't correct
24 Correct 1 ms 4700 KB Output is correct
25 Incorrect 1 ms 2652 KB Output isn't correct
26 Correct 1 ms 4700 KB Output is correct
27 Incorrect 1 ms 2652 KB Output isn't correct
28 Correct 1 ms 4700 KB Output is correct
29 Incorrect 1 ms 2732 KB Output isn't correct
30 Correct 1 ms 4700 KB Output is correct
31 Incorrect 1 ms 2904 KB Output isn't correct
32 Correct 1 ms 4700 KB Output is correct
33 Incorrect 8 ms 4952 KB Output isn't correct
34 Correct 11 ms 5724 KB Output is correct
35 Correct 22 ms 4916 KB Output is correct
36 Incorrect 10 ms 5464 KB Output isn't correct
37 Correct 11 ms 6184 KB Output is correct
38 Correct 28 ms 5512 KB Output is correct
39 Incorrect 14 ms 6128 KB Output isn't correct
40 Correct 14 ms 6540 KB Output is correct
41 Correct 38 ms 6072 KB Output is correct
42 Incorrect 17 ms 6756 KB Output isn't correct
43 Correct 17 ms 6984 KB Output is correct
44 Correct 52 ms 6704 KB Output is correct
45 Incorrect 20 ms 7404 KB Output isn't correct
46 Correct 21 ms 7468 KB Output is correct
47 Correct 62 ms 7404 KB Output is correct
48 Incorrect 23 ms 8020 KB Output isn't correct
49 Correct 23 ms 7952 KB Output is correct
50 Correct 66 ms 7940 KB Output is correct
51 Incorrect 27 ms 8464 KB Output isn't correct
52 Correct 28 ms 8492 KB Output is correct
53 Correct 87 ms 8940 KB Output is correct
54 Incorrect 32 ms 9140 KB Output isn't correct
55 Correct 33 ms 9108 KB Output is correct
56 Correct 94 ms 9092 KB Output is correct
57 Incorrect 36 ms 9720 KB Output isn't correct
58 Correct 38 ms 9720 KB Output is correct
59 Correct 120 ms 9684 KB Output is correct
60 Incorrect 50 ms 10356 KB Output isn't correct
61 Correct 46 ms 10384 KB Output is correct
62 Correct 120 ms 10372 KB Output is correct
63 Correct 105 ms 10352 KB Output is correct
64 Correct 180 ms 10488 KB Output is correct
65 Correct 136 ms 10352 KB Output is correct
66 Incorrect 124 ms 10404 KB Output isn't correct
67 Incorrect 116 ms 10404 KB Output isn't correct
68 Correct 54 ms 10460 KB Output is correct
69 Correct 50 ms 10368 KB Output is correct
70 Correct 52 ms 10364 KB Output is correct
71 Correct 47 ms 10348 KB Output is correct
72 Incorrect 39 ms 10384 KB Output isn't correct
73 Incorrect 47 ms 10440 KB Output isn't correct
74 Correct 73 ms 10408 KB Output is correct
75 Correct 77 ms 10396 KB Output is correct
76 Correct 72 ms 10392 KB Output is correct
77 Correct 78 ms 10380 KB Output is correct
78 Incorrect 95 ms 10580 KB Output isn't correct
79 Correct 54 ms 10320 KB Output is correct
80 Correct 68 ms 10380 KB Output is correct
81 Correct 77 ms 10448 KB Output is correct
82 Correct 65 ms 10376 KB Output is correct
83 Correct 94 ms 10508 KB Output is correct
84 Correct 81 ms 10380 KB Output is correct
85 Correct 87 ms 10392 KB Output is correct
86 Correct 89 ms 10388 KB Output is correct
87 Correct 86 ms 10396 KB Output is correct
88 Correct 91 ms 10384 KB Output is correct
89 Correct 99 ms 10340 KB Output is correct
90 Correct 99 ms 10352 KB Output is correct
91 Correct 89 ms 10396 KB Output is correct
92 Correct 98 ms 10672 KB Output is correct