oj.uz

답안 #242017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242017 2020-06-26T14:21:28 Z Autoratch Mecho (IOI09_mecho) C++14
38 / 100
 237 ms 4608 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 801;

int n,s,sx,sy,tx,ty;
char c[N][N];
int bee[N][N];
bool visited[N][N];
queue<pair<pair<int,int>,int> > qb,q;

void flybee()
{
    while(!qb.empty())
    {
        int t = qb.front().second,x = qb.front().first.first,y = qb.front().first.second;
        qb.pop();
        for(int i = -1;i <= 1;i++) for(int j = -1;j <= 1;j++)
        {
            if(i!=0 and j!=0) continue;
            if(i==0 and j==0) continue;
            int ai = x+i,aj = y+j;
            if(ai<1 or ai>n or aj<1 or aj>n) continue;
            if(c[ai][aj]=='D' or c[ai][aj]=='T') continue;
            if(visited[ai][aj]) continue;
            visited[ai][aj] = true;
            bee[ai][aj] = t+1;
            qb.push({{ai,aj},t+1});
        }
    }
}

bool solve(int m)
{
    if(m>=bee[sx][sy]) return false;
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) visited[i][j] = false;
    while(!q.empty()) q.pop();
    q.push({{sx,sy},0});
    visited[sx][sy] = true;
    while(!q.empty())
    {
        int x = q.front().first.first,y = q.front().first.second,tm = q.front().second;
        q.pop();
        if(x==tx and y==ty) return true;
        for(int i = -1;i <= 1;i++) for(int j = -1;j <= 1;j++)
        {
            if(i!=0 and j!=0) continue;
            if(i==0 and j==0) continue;
            int ai = x+i,aj = y+j;
            if(ai<1 or ai>n or aj<1 or aj>n) continue;
            if(c[ai][aj]=='T') continue;
            if(visited[ai][aj]) continue;
            if(tm+1>=(bee[ai][aj]-m)*s) continue;
            q.push({{ai,aj},tm+1});
            visited[ai][aj] = true;
        }
    }
    return false;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> s;
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) cin >> c[i][j],bee[i][j] = INT_MAX;
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) 
        if(c[i][j]=='H') qb.push({{i,j},0}),bee[i][j] = 0,visited[i][j] = true; 
        else if(c[i][j]=='M') sx = i,sy = j;
        else if(c[i][j]=='D') tx = i,ty = j;
    flybee();
    int l = 0,r = n*n;
    while(l<r)
    {
        int m = (l+r+1)/2;
        if(solve(m)) l = m;
        else r = m-1;
    }
    if(solve(l)) cout << l;
    else cout << "-1";
}

Subtask #1
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 127 ms 4344 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 5 ms 384 KB Output isn't correct
10 Incorrect 5 ms 384 KB Output isn't correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Correct 5 ms 640 KB Output is correct
13 Incorrect 5 ms 640 KB Output isn't correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Incorrect 5 ms 512 KB Output isn't correct
19 Correct 5 ms 512 KB Output is correct
20 Incorrect 5 ms 512 KB Output isn't correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Incorrect 5 ms 640 KB Output isn't correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Incorrect 6 ms 640 KB Output isn't correct
29 Correct 5 ms 640 KB Output is correct
30 Incorrect 6 ms 640 KB Output isn't correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 5 ms 768 KB Output is correct
33 Correct 10 ms 2048 KB Output is correct
34 Incorrect 34 ms 2048 KB Output isn't correct
35 Incorrect 32 ms 2048 KB Output isn't correct
36 Correct 11 ms 2176 KB Output is correct
37 Correct 12 ms 2176 KB Output is correct
38 Incorrect 44 ms 2304 KB Output isn't correct
39 Correct 12 ms 2432 KB Output is correct
40 Incorrect 58 ms 2432 KB Output isn't correct
41 Incorrect 56 ms 2560 KB Output isn't correct
42 Correct 16 ms 2688 KB Output is correct
43 Correct 17 ms 2688 KB Output is correct
44 Incorrect 64 ms 2816 KB Output isn't correct
45 Correct 17 ms 2944 KB Output is correct
46 Incorrect 84 ms 2944 KB Output isn't correct
47 Incorrect 80 ms 2944 KB Output isn't correct
48 Correct 19 ms 3200 KB Output is correct
49 Correct 20 ms 3200 KB Output is correct
50 Incorrect 89 ms 3200 KB Output isn't correct
51 Correct 22 ms 3456 KB Output is correct
52 Incorrect 121 ms 3456 KB Output isn't correct
53 Incorrect 107 ms 3456 KB Output isn't correct
54 Correct 25 ms 3576 KB Output is correct
55 Correct 24 ms 3584 KB Output is correct
56 Incorrect 125 ms 3712 KB Output isn't correct
57 Correct 26 ms 3840 KB Output is correct
58 Incorrect 168 ms 3920 KB Output isn't correct
59 Incorrect 143 ms 3840 KB Output isn't correct
60 Correct 29 ms 4096 KB Output is correct
61 Correct 31 ms 4096 KB Output is correct
62 Incorrect 168 ms 4088 KB Output isn't correct
63 Incorrect 129 ms 4096 KB Output isn't correct
64 Correct 237 ms 4096 KB Output is correct
65 Incorrect 237 ms 4096 KB Output isn't correct
66 Correct 158 ms 4224 KB Output is correct
67 Correct 145 ms 4096 KB Output is correct
68 Incorrect 66 ms 4096 KB Output isn't correct
69 Incorrect 82 ms 4288 KB Output isn't correct
70 Correct 61 ms 4096 KB Output is correct
71 Correct 54 ms 4096 KB Output is correct
72 Incorrect 89 ms 4096 KB Output isn't correct
73 Correct 56 ms 4480 KB Output is correct
74 Incorrect 151 ms 4608 KB Output isn't correct
75 Incorrect 109 ms 4600 KB Output isn't correct
76 Correct 90 ms 4480 KB Output is correct
77 Incorrect 105 ms 4480 KB Output isn't correct
78 Correct 94 ms 4480 KB Output is correct
79 Correct 65 ms 4480 KB Output is correct
80 Correct 78 ms 4480 KB Output is correct
81 Correct 92 ms 4600 KB Output is correct
82 Incorrect 104 ms 4476 KB Output isn't correct
83 Incorrect 111 ms 4348 KB Output isn't correct
84 Correct 103 ms 4348 KB Output is correct
85 Incorrect 101 ms 4348 KB Output isn't correct
86 Incorrect 113 ms 4348 KB Output isn't correct
87 Correct 98 ms 4340 KB Output is correct
88 Incorrect 103 ms 4352 KB Output isn't correct
89 Correct 117 ms 4344 KB Output is correct
90 Correct 118 ms 4344 KB Output is correct
91 Incorrect 125 ms 4352 KB Output isn't correct
92 Correct 107 ms 4352 KB Output is correct