oj.uz

Submission #956840

# Submission time Handle Problem Language Result Execution time Memory
956840 2024-04-02T14:24:09 Z wood Mecho (IOI09_mecho) C++17
84 / 100
 147 ms 6488 KB 
#include <bits/stdc++.h>  
using namespace std;
 
typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007

int dfx[4] = {1,-1,0,0}; int dfy[4] = {0,0,1,-1};

int main()
{
    fast_cin();
    #ifndef ONLINE_JUDGE
        #ifdef _WIN32
            freopen("input.in", "r", stdin);
            freopen("input.out", "w", stdout);
        #endif
    #endif
    int n,s; cin>>n>>s;
    char arr[n][n];
    int bees[n][n];
    fill(bees[0],bees[0]+n*n,INT_MAX);
    queue<p32> hq;
    p32 start;
    for (size_t i = 0; i < n; i++)
    {
        for (size_t j = 0; j < n; j++)
        {
            cin>>arr[i][j];
            if(arr[i][j]=='H'){
               bees[i][j] = 1; 
                hq.emplace(i,j);
            }
            if(arr[i][j]=='M') start = p32(i,j);
        }
    }
    while(!hq.empty()){
        for (size_t i = 0; i < 4; i++)
        {
            int x = hq.front().fi+dfx[i];
            int y = hq.front().se+dfy[i];
            if(x>=0&&x<n&&y>=0&&y<n&&bees[x][y]==INT_MAX&&arr[x][y]!='T'&&arr[x][y]!='D'){
                bees[x][y] = bees[hq.front().fi][hq.front().se] + 1;
                hq.emplace(x,y);
            }
        }
        hq.pop();
    }
    int l = -1; 
    int r = 1e9;
    while(r-l>1){
        int mid = (l+r)/2;
        queue<p32> q;
        q.push(start);
        int depth[n][n];
        memset(depth,0,sizeof depth);
        depth[start.fi][start.se] = 1;
        while(!q.empty()){
            for (size_t i = 0; i < 4; i++)
            {
                int x = q.front().fi+dfx[i];
                int y = q.front().se+dfy[i];
                int d = depth[q.front().fi][q.front().se];
                if(x>=0&&x<n&&y>=0&&y<n&&!depth[x][y]&&arr[x][y]!='T'&&(d+s)/s+mid<bees[x][y]){
                    if(arr[x][y]=='D'&&mid<=bees[start.fi][start.se]){
                        l = mid;
                        goto next;
                    }
                    depth[x][y] = d+1;
                    q.emplace(x,y);
                }
            }
            q.pop();
        }
        r = mid;
        next: 
        continue;
    }
    cout<<l<<'\n';
    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:31:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |     for (size_t i = 0; i < n; i++)
      |                        ~~^~~
mecho.cpp:33:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |         for (size_t j = 0; j < n; j++)
      |                            ~~^~~

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 73 ms 5980 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 500 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 504 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 1372 KB Output is correct
34 Correct 5 ms 1372 KB Output is correct
35 Correct 15 ms 1308 KB Output is correct
36 Correct 5 ms 1624 KB Output is correct
37 Correct 4 ms 1628 KB Output is correct
38 Correct 20 ms 1864 KB Output is correct
39 Correct 6 ms 2140 KB Output is correct
40 Correct 5 ms 2136 KB Output is correct
41 Correct 24 ms 2140 KB Output is correct
42 Correct 7 ms 2480 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 31 ms 2652 KB Output is correct
45 Correct 8 ms 2908 KB Output is correct
46 Correct 7 ms 2956 KB Output is correct
47 Correct 45 ms 3100 KB Output is correct
48 Correct 9 ms 3416 KB Output is correct
49 Correct 9 ms 3744 KB Output is correct
50 Correct 50 ms 3608 KB Output is correct
51 Correct 10 ms 3928 KB Output is correct
52 Correct 10 ms 4056 KB Output is correct
53 Correct 55 ms 4160 KB Output is correct
54 Correct 12 ms 4696 KB Output is correct
55 Correct 12 ms 4700 KB Output is correct
56 Correct 67 ms 4752 KB Output is correct
57 Correct 14 ms 5212 KB Output is correct
58 Correct 14 ms 5312 KB Output is correct
59 Correct 85 ms 5388 KB Output is correct
60 Correct 16 ms 5980 KB Output is correct
61 Correct 16 ms 5980 KB Output is correct
62 Correct 84 ms 5980 KB Output is correct
63 Correct 86 ms 5980 KB Output is correct
64 Correct 144 ms 5976 KB Output is correct
65 Correct 147 ms 6064 KB Output is correct
66 Correct 96 ms 5968 KB Output is correct
67 Correct 89 ms 5980 KB Output is correct
68 Correct 41 ms 6092 KB Output is correct
69 Correct 40 ms 5884 KB Output is correct
70 Correct 28 ms 6232 KB Output is correct
71 Correct 31 ms 5900 KB Output is correct
72 Incorrect 27 ms 5884 KB Output isn't correct
73 Incorrect 33 ms 6232 KB Output isn't correct
74 Correct 47 ms 6236 KB Output is correct
75 Correct 49 ms 6488 KB Output is correct
76 Correct 46 ms 6236 KB Output is correct
77 Correct 56 ms 6340 KB Output is correct
78 Correct 52 ms 6236 KB Output is correct
79 Correct 42 ms 6224 KB Output is correct
80 Correct 49 ms 6120 KB Output is correct
81 Correct 52 ms 6236 KB Output is correct
82 Correct 50 ms 6140 KB Output is correct
83 Correct 63 ms 6236 KB Output is correct
84 Correct 54 ms 6232 KB Output is correct
85 Correct 55 ms 6280 KB Output is correct
86 Correct 57 ms 6236 KB Output is correct
87 Correct 56 ms 6092 KB Output is correct
88 Correct 60 ms 6224 KB Output is correct
89 Correct 69 ms 6392 KB Output is correct
90 Correct 67 ms 6236 KB Output is correct
91 Correct 60 ms 6236 KB Output is correct
92 Correct 62 ms 6224 KB Output is correct