oj.uz

답안 #956830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956830 2024-04-02T14:21:04 Z wood Mecho (IOI09_mecho) C++17
60 / 100
 158 ms 6996 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 = 10000;
    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
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 67 ms 6228 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 0 ms 456 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 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 460 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 352 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 1 ms 460 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 4 ms 1576 KB Output isn't correct
34 Incorrect 3 ms 1500 KB Output isn't correct
35 Correct 14 ms 1632 KB Output is correct
36 Incorrect 4 ms 1896 KB Output isn't correct
37 Incorrect 4 ms 1880 KB Output isn't correct
38 Correct 18 ms 1964 KB Output is correct
39 Incorrect 5 ms 2148 KB Output isn't correct
40 Incorrect 6 ms 2264 KB Output isn't correct
41 Correct 24 ms 2404 KB Output is correct
42 Incorrect 6 ms 2660 KB Output isn't correct
43 Incorrect 6 ms 2660 KB Output isn't correct
44 Correct 34 ms 2872 KB Output is correct
45 Incorrect 7 ms 3160 KB Output isn't correct
46 Incorrect 8 ms 3164 KB Output isn't correct
47 Correct 36 ms 3160 KB Output is correct
48 Incorrect 11 ms 3732 KB Output isn't correct
49 Incorrect 9 ms 3676 KB Output isn't correct
50 Correct 42 ms 3656 KB Output is correct
51 Incorrect 10 ms 4444 KB Output isn't correct
52 Incorrect 11 ms 4188 KB Output isn't correct
53 Correct 62 ms 4500 KB Output is correct
54 Incorrect 13 ms 4956 KB Output isn't correct
55 Incorrect 12 ms 4952 KB Output isn't correct
56 Correct 64 ms 4956 KB Output is correct
57 Incorrect 14 ms 5468 KB Output isn't correct
58 Incorrect 14 ms 5760 KB Output isn't correct
59 Correct 74 ms 5752 KB Output is correct
60 Incorrect 18 ms 6380 KB Output isn't correct
61 Incorrect 15 ms 6492 KB Output isn't correct
62 Correct 103 ms 6492 KB Output is correct
63 Correct 83 ms 6236 KB Output is correct
64 Correct 158 ms 6436 KB Output is correct
65 Correct 120 ms 6484 KB Output is correct
66 Correct 97 ms 6224 KB Output is correct
67 Correct 92 ms 6268 KB Output is correct
68 Correct 40 ms 6532 KB Output is correct
69 Correct 41 ms 6476 KB Output is correct
70 Correct 31 ms 6492 KB Output is correct
71 Correct 36 ms 6532 KB Output is correct
72 Incorrect 28 ms 6324 KB Output isn't correct
73 Incorrect 30 ms 6748 KB Output isn't correct
74 Correct 41 ms 6744 KB Output is correct
75 Correct 56 ms 6996 KB Output is correct
76 Correct 46 ms 6748 KB Output is correct
77 Correct 57 ms 6584 KB Output is correct
78 Correct 58 ms 6544 KB Output is correct
79 Correct 36 ms 6740 KB Output is correct
80 Correct 46 ms 6736 KB Output is correct
81 Correct 50 ms 6480 KB Output is correct
82 Correct 49 ms 6484 KB Output is correct
83 Correct 66 ms 6484 KB Output is correct
84 Correct 55 ms 6496 KB Output is correct
85 Correct 56 ms 6480 KB Output is correct
86 Correct 58 ms 6484 KB Output is correct
87 Correct 60 ms 6716 KB Output is correct
88 Correct 57 ms 6480 KB Output is correct
89 Correct 59 ms 6620 KB Output is correct
90 Correct 72 ms 6660 KB Output is correct
91 Correct 70 ms 6480 KB Output is correct
92 Correct 65 ms 6672 KB Output is correct