oj.uz

Submission #858188

# Submission time Handle Problem Language Result Execution time Memory
858188 2023-10-07T14:50:26 Z BBart888 Mecho (IOI09_mecho) C++14
68 / 100
 177 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);
}

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;

    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])
            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
68.0 / 100.0

# Verdict Execution time Memory 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 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 100 ms 10360 KB Output is correct
8 Incorrect 0 ms 2396 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 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 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2904 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 2 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 5788 KB Output is correct
35 Correct 25 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 13 ms 6100 KB Output is correct
40 Correct 18 ms 6552 KB Output is correct
41 Correct 41 ms 6072 KB Output is correct
42 Correct 17 ms 6752 KB Output is correct
43 Correct 17 ms 6956 KB Output is correct
44 Correct 51 ms 6720 KB Output is correct
45 Correct 23 ms 7464 KB Output is correct
46 Correct 22 ms 7436 KB Output is correct
47 Correct 61 ms 7360 KB Output is correct
48 Correct 24 ms 8000 KB Output is correct
49 Correct 35 ms 7928 KB Output is correct
50 Correct 73 ms 7908 KB Output is correct
51 Correct 28 ms 8560 KB Output is correct
52 Correct 34 ms 8568 KB Output is correct
53 Correct 85 ms 8480 KB Output is correct
54 Correct 33 ms 9108 KB Output is correct
55 Correct 35 ms 9188 KB Output is correct
56 Correct 100 ms 9092 KB Output is correct
57 Correct 48 ms 9732 KB Output is correct
58 Correct 39 ms 9764 KB Output is correct
59 Correct 130 ms 9644 KB Output is correct
60 Correct 49 ms 10440 KB Output is correct
61 Correct 52 ms 10436 KB Output is correct
62 Correct 160 ms 10380 KB Output is correct
63 Correct 107 ms 10352 KB Output is correct
64 Correct 177 ms 10384 KB Output is correct
65 Correct 137 ms 10380 KB Output is correct
66 Correct 138 ms 10408 KB Output is correct
67 Incorrect 122 ms 10404 KB Output isn't correct
68 Correct 55 ms 10404 KB Output is correct
69 Correct 49 ms 10352 KB Output is correct
70 Correct 52 ms 10348 KB Output is correct
71 Correct 47 ms 10452 KB Output is correct
72 Incorrect 41 ms 10384 KB Output isn't correct
73 Incorrect 42 ms 10400 KB Output isn't correct
74 Correct 73 ms 10384 KB Output is correct
75 Correct 81 ms 10376 KB Output is correct
76 Correct 78 ms 10384 KB Output is correct
77 Correct 94 ms 10372 KB Output is correct
78 Incorrect 83 ms 10340 KB Output isn't correct
79 Correct 58 ms 10300 KB Output is correct
80 Correct 68 ms 10360 KB Output is correct
81 Correct 78 ms 10376 KB Output is correct
82 Correct 69 ms 10644 KB Output is correct
83 Correct 94 ms 10364 KB Output is correct
84 Correct 94 ms 10376 KB Output is correct
85 Correct 97 ms 10396 KB Output is correct
86 Correct 95 ms 10384 KB Output is correct
87 Correct 98 ms 10380 KB Output is correct
88 Correct 94 ms 10336 KB Output is correct
89 Correct 107 ms 10376 KB Output is correct
90 Correct 114 ms 10352 KB Output is correct
91 Correct 115 ms 10508 KB Output is correct
92 Correct 111 ms 10356 KB Output is correct