oj.uz

답안 #858191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858191 2023-10-07T14:53:49 Z BBart888 Mecho (IOI09_mecho) C++14
79 / 100
 184 ms 10580 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);
}

bool reached(int mecho, int bees)
{
    return mecho / s < bees;
}


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] != 'G' && t[newX][newY] != 'M')
                || vis[newX][newY])
                continue;
            vis[newX][newY] = true;
            q.push({ newX,newY });
            dist[newX][newY] = dist[x][y] + 1;
        }
    }
    

}



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;
    if (dist[bear.first][bear.second] <= mins)
        q.pop();
    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] != 'G' && t[newX][newY] != 'M') || (
                !reached(bear_dist[x][y]+1,dist[newX][newY]-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] && reached(bear_dist[Hx][Hy],dist[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
79.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 96 ms 10360 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Incorrect 1 ms 4700 KB Output isn't correct
13 Correct 1 ms 2652 KB Output is correct
14 Incorrect 1 ms 2652 KB Output isn't correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 4700 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 4696 KB Output is correct
33 Correct 8 ms 4936 KB Output is correct
34 Correct 8 ms 5724 KB Output is correct
35 Correct 23 ms 4948 KB Output is correct
36 Correct 11 ms 5464 KB Output is correct
37 Correct 11 ms 6184 KB Output is correct
38 Correct 30 ms 5468 KB Output is correct
39 Correct 14 ms 6132 KB Output is correct
40 Correct 14 ms 6536 KB Output is correct
41 Correct 41 ms 6112 KB Output is correct
42 Correct 17 ms 6728 KB Output is correct
43 Correct 17 ms 6984 KB Output is correct
44 Correct 52 ms 6696 KB Output is correct
45 Correct 21 ms 7404 KB Output is correct
46 Correct 21 ms 7464 KB Output is correct
47 Correct 57 ms 7336 KB Output is correct
48 Correct 23 ms 7952 KB Output is correct
49 Correct 25 ms 7996 KB Output is correct
50 Correct 74 ms 7972 KB Output is correct
51 Correct 28 ms 8488 KB Output is correct
52 Correct 29 ms 8560 KB Output is correct
53 Correct 85 ms 8484 KB Output is correct
54 Correct 32 ms 9108 KB Output is correct
55 Correct 34 ms 9156 KB Output is correct
56 Correct 103 ms 9068 KB Output is correct
57 Correct 43 ms 9764 KB Output is correct
58 Correct 39 ms 9704 KB Output is correct
59 Correct 115 ms 9672 KB Output is correct
60 Correct 42 ms 10412 KB Output is correct
61 Correct 45 ms 10460 KB Output is correct
62 Correct 145 ms 10580 KB Output is correct
63 Correct 103 ms 10404 KB Output is correct
64 Correct 184 ms 10344 KB Output is correct
65 Correct 143 ms 10384 KB Output is correct
66 Correct 131 ms 10396 KB Output is correct
67 Incorrect 121 ms 10352 KB Output isn't correct
68 Correct 55 ms 10336 KB Output is correct
69 Correct 51 ms 10364 KB Output is correct
70 Correct 50 ms 10372 KB Output is correct
71 Correct 53 ms 10540 KB Output is correct
72 Correct 40 ms 10372 KB Output is correct
73 Correct 43 ms 10412 KB Output is correct
74 Correct 65 ms 10372 KB Output is correct
75 Correct 84 ms 10360 KB Output is correct
76 Correct 77 ms 10396 KB Output is correct
77 Correct 97 ms 10396 KB Output is correct
78 Incorrect 83 ms 10364 KB Output isn't correct
79 Correct 65 ms 10384 KB Output is correct
80 Correct 67 ms 10344 KB Output is correct
81 Correct 75 ms 10380 KB Output is correct
82 Correct 70 ms 10412 KB Output is correct
83 Correct 92 ms 10364 KB Output is correct
84 Correct 93 ms 10380 KB Output is correct
85 Correct 88 ms 10360 KB Output is correct
86 Correct 94 ms 10384 KB Output is correct
87 Correct 85 ms 10352 KB Output is correct
88 Correct 106 ms 10388 KB Output is correct
89 Correct 104 ms 10368 KB Output is correct
90 Correct 141 ms 10512 KB Output is correct
91 Correct 94 ms 10344 KB Output is correct
92 Correct 92 ms 10352 KB Output is correct