oj.uz

Submission #956841

# Submission time Handle Problem Language Result Execution time Memory
956841 2024-04-02T14:25:05 Z wood Mecho (IOI09_mecho) C++17
38 / 100
 146 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 = 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-1)/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
38.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 68 ms 5972 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 1 ms 596 KB Output isn't correct
14 Correct 1 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Correct 0 ms 344 KB Output is correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Correct 0 ms 348 KB Output is correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Correct 0 ms 376 KB Output is correct
27 Incorrect 0 ms 348 KB Output isn't correct
28 Correct 0 ms 348 KB Output is correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Correct 0 ms 348 KB Output is correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 3 ms 1372 KB Output isn't correct
34 Correct 4 ms 1368 KB Output is correct
35 Correct 15 ms 1372 KB Output is correct
36 Incorrect 4 ms 1628 KB Output isn't correct
37 Correct 4 ms 1628 KB Output is correct
38 Correct 21 ms 1868 KB Output is correct
39 Incorrect 7 ms 2140 KB Output isn't correct
40 Correct 5 ms 2208 KB Output is correct
41 Correct 25 ms 2136 KB Output is correct
42 Incorrect 6 ms 2608 KB Output isn't correct
43 Correct 6 ms 2652 KB Output is correct
44 Correct 34 ms 2652 KB Output is correct
45 Incorrect 8 ms 2952 KB Output isn't correct
46 Correct 8 ms 3052 KB Output is correct
47 Correct 39 ms 2952 KB Output is correct
48 Incorrect 9 ms 3416 KB Output isn't correct
49 Correct 11 ms 3420 KB Output is correct
50 Correct 50 ms 3608 KB Output is correct
51 Incorrect 10 ms 3928 KB Output isn't correct
52 Correct 10 ms 3932 KB Output is correct
53 Correct 55 ms 4156 KB Output is correct
54 Incorrect 14 ms 4696 KB Output isn't correct
55 Correct 12 ms 4700 KB Output is correct
56 Correct 67 ms 4640 KB Output is correct
57 Incorrect 18 ms 5464 KB Output isn't correct
58 Correct 14 ms 5212 KB Output is correct
59 Correct 78 ms 5212 KB Output is correct
60 Incorrect 15 ms 5892 KB Output isn't correct
61 Correct 16 ms 5888 KB Output is correct
62 Correct 92 ms 5976 KB Output is correct
63 Correct 95 ms 6068 KB Output is correct
64 Correct 146 ms 6108 KB Output is correct
65 Correct 138 ms 6076 KB Output is correct
66 Incorrect 96 ms 5888 KB Output isn't correct
67 Correct 89 ms 5892 KB Output is correct
68 Correct 41 ms 5968 KB Output is correct
69 Correct 40 ms 5916 KB Output is correct
70 Correct 29 ms 5972 KB Output is correct
71 Correct 31 ms 5980 KB Output is correct
72 Incorrect 27 ms 5972 KB Output isn't correct
73 Incorrect 36 ms 6228 KB Output isn't correct
74 Correct 45 ms 6172 KB Output is correct
75 Correct 51 ms 6348 KB Output is correct
76 Correct 46 ms 6344 KB Output is correct
77 Correct 47 ms 6236 KB Output is correct
78 Correct 61 ms 6320 KB Output is correct
79 Correct 42 ms 6236 KB Output is correct
80 Correct 48 ms 6224 KB Output is correct
81 Correct 58 ms 6232 KB Output is correct
82 Correct 44 ms 6224 KB Output is correct
83 Correct 59 ms 6228 KB Output is correct
84 Correct 54 ms 6228 KB Output is correct
85 Correct 54 ms 6224 KB Output is correct
86 Correct 66 ms 6276 KB Output is correct
87 Correct 64 ms 6228 KB Output is correct
88 Correct 60 ms 6228 KB Output is correct
89 Correct 61 ms 6236 KB Output is correct
90 Correct 62 ms 6236 KB Output is correct
91 Correct 62 ms 6228 KB Output is correct
92 Correct 67 ms 6236 KB Output is correct