oj.uz

Submission #956832

# Submission time Handle Problem Language Result Execution time Memory
956832 2024-04-02T14:21:42 Z wood Mecho (IOI09_mecho) C++17
64 / 100
 136 ms 6348 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 = 100000;
    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
64.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 65 ms 6184 KB Output is correct
8 Correct 0 ms 344 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 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 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 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 3 ms 1372 KB Output is correct
34 Correct 4 ms 1372 KB Output is correct
35 Correct 14 ms 1540 KB Output is correct
36 Correct 4 ms 1628 KB Output is correct
37 Correct 4 ms 1624 KB Output is correct
38 Correct 19 ms 1628 KB Output is correct
39 Incorrect 5 ms 2204 KB Output isn't correct
40 Correct 5 ms 2240 KB Output is correct
41 Correct 26 ms 2140 KB Output is correct
42 Incorrect 6 ms 2652 KB Output isn't correct
43 Correct 7 ms 2444 KB Output is correct
44 Correct 31 ms 2648 KB Output is correct
45 Incorrect 7 ms 3148 KB Output isn't correct
46 Correct 8 ms 2908 KB Output is correct
47 Correct 40 ms 2908 KB Output is correct
48 Incorrect 8 ms 3420 KB Output isn't correct
49 Correct 10 ms 3420 KB Output is correct
50 Correct 57 ms 3600 KB Output is correct
51 Incorrect 10 ms 3932 KB Output isn't correct
52 Incorrect 14 ms 4188 KB Output isn't correct
53 Correct 53 ms 4060 KB Output is correct
54 Incorrect 11 ms 4700 KB Output isn't correct
55 Incorrect 12 ms 4700 KB Output isn't correct
56 Correct 66 ms 4652 KB Output is correct
57 Incorrect 13 ms 5208 KB Output isn't correct
58 Incorrect 14 ms 5212 KB Output isn't correct
59 Correct 76 ms 5392 KB Output is correct
60 Incorrect 15 ms 5984 KB Output isn't correct
61 Incorrect 15 ms 5980 KB Output isn't correct
62 Correct 87 ms 6072 KB Output is correct
63 Correct 88 ms 6060 KB Output is correct
64 Correct 136 ms 6064 KB Output is correct
65 Correct 130 ms 6064 KB Output is correct
66 Correct 100 ms 6072 KB Output is correct
67 Correct 92 ms 5980 KB Output is correct
68 Correct 40 ms 5968 KB Output is correct
69 Correct 32 ms 5976 KB Output is correct
70 Correct 40 ms 5968 KB Output is correct
71 Correct 40 ms 5972 KB Output is correct
72 Incorrect 26 ms 5968 KB Output isn't correct
73 Incorrect 26 ms 6232 KB Output isn't correct
74 Correct 42 ms 6236 KB Output is correct
75 Correct 45 ms 6312 KB Output is correct
76 Correct 45 ms 6344 KB Output is correct
77 Correct 54 ms 6348 KB Output is correct
78 Correct 58 ms 6228 KB Output is correct
79 Correct 41 ms 6120 KB Output is correct
80 Correct 44 ms 6224 KB Output is correct
81 Correct 49 ms 6236 KB Output is correct
82 Correct 50 ms 6128 KB Output is correct
83 Correct 64 ms 6276 KB Output is correct
84 Correct 55 ms 6096 KB Output is correct
85 Correct 56 ms 6232 KB Output is correct
86 Correct 63 ms 6232 KB Output is correct
87 Correct 54 ms 6232 KB Output is correct
88 Correct 65 ms 6236 KB Output is correct
89 Correct 56 ms 6236 KB Output is correct
90 Correct 70 ms 6224 KB Output is correct
91 Correct 68 ms 6224 KB Output is correct
92 Correct 56 ms 6224 KB Output is correct