oj.uz

답안 #858186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858186 2023-10-07T14:42:55 Z BBart888 Mecho (IOI09_mecho) C++14
29 / 100
 176 ms 10644 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;
        }

    }
    int flag = 0;

    for (int d = 0; d < 4; d++)
    {
        int Hx = house.first + dx[d];
        int Hy = house.second + dy[d];
        if (!within(Hx, Hy))
            continue;
        if (vis[Hx][Hy])
            flag = 1;
    }

    return flag;
}



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
29.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2392 KB Output isn't correct
2 Incorrect 2 ms 2396 KB Output isn't correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Incorrect 0 ms 2396 KB Output isn't correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 100 ms 10388 KB Output is correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2480 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 0 ms 2392 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 2648 KB Output is correct
23 Incorrect 1 ms 2652 KB Output isn't correct
24 Correct 1 ms 4916 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 2648 KB Output isn't correct
28 Correct 1 ms 4700 KB Output is correct
29 Incorrect 1 ms 2652 KB Output isn't correct
30 Correct 1 ms 4700 KB Output is correct
31 Incorrect 1 ms 2652 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 10 ms 5804 KB Output is correct
35 Correct 22 ms 4948 KB Output is correct
36 Incorrect 11 ms 5540 KB Output isn't correct
37 Correct 12 ms 6184 KB Output is correct
38 Correct 31 ms 5480 KB Output is correct
39 Incorrect 14 ms 6080 KB Output isn't correct
40 Correct 14 ms 6540 KB Output is correct
41 Correct 42 ms 6060 KB Output is correct
42 Incorrect 17 ms 6728 KB Output isn't correct
43 Correct 17 ms 6984 KB Output is correct
44 Correct 51 ms 6704 KB Output is correct
45 Incorrect 20 ms 7400 KB Output isn't correct
46 Correct 21 ms 7468 KB Output is correct
47 Correct 59 ms 7424 KB Output is correct
48 Incorrect 29 ms 7996 KB Output isn't correct
49 Correct 25 ms 7960 KB Output is correct
50 Correct 72 ms 7928 KB Output is correct
51 Incorrect 27 ms 8452 KB Output isn't correct
52 Correct 28 ms 8532 KB Output is correct
53 Correct 80 ms 8452 KB Output is correct
54 Incorrect 38 ms 9424 KB Output isn't correct
55 Correct 42 ms 9096 KB Output is correct
56 Correct 100 ms 9068 KB Output is correct
57 Incorrect 46 ms 9748 KB Output isn't correct
58 Correct 38 ms 9740 KB Output is correct
59 Correct 116 ms 9672 KB Output is correct
60 Incorrect 45 ms 10500 KB Output isn't correct
61 Correct 45 ms 10384 KB Output is correct
62 Correct 147 ms 10332 KB Output is correct
63 Correct 101 ms 10436 KB Output is correct
64 Correct 176 ms 10340 KB Output is correct
65 Correct 147 ms 10392 KB Output is correct
66 Incorrect 122 ms 10640 KB Output isn't correct
67 Incorrect 126 ms 10440 KB Output isn't correct
68 Correct 54 ms 10384 KB Output is correct
69 Correct 53 ms 10392 KB Output is correct
70 Correct 58 ms 10368 KB Output is correct
71 Correct 47 ms 10388 KB Output is correct
72 Incorrect 41 ms 10388 KB Output isn't correct
73 Incorrect 43 ms 10380 KB Output isn't correct
74 Correct 69 ms 10396 KB Output is correct
75 Correct 79 ms 10404 KB Output is correct
76 Correct 76 ms 10396 KB Output is correct
77 Correct 83 ms 10352 KB Output is correct
78 Incorrect 82 ms 10368 KB Output isn't correct
79 Correct 59 ms 10328 KB Output is correct
80 Correct 65 ms 10372 KB Output is correct
81 Correct 80 ms 10432 KB Output is correct
82 Correct 69 ms 10380 KB Output is correct
83 Correct 95 ms 10368 KB Output is correct
84 Correct 81 ms 10392 KB Output is correct
85 Correct 86 ms 10396 KB Output is correct
86 Correct 90 ms 10644 KB Output is correct
87 Correct 93 ms 10396 KB Output is correct
88 Correct 103 ms 10580 KB Output is correct
89 Correct 97 ms 10376 KB Output is correct
90 Correct 108 ms 10364 KB Output is correct
91 Correct 94 ms 10380 KB Output is correct
92 Correct 91 ms 10428 KB Output is correct