oj.uz

답안 #242014

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242014 2020-06-26T13:59:17 Z Autoratch Mecho (IOI09_mecho) C++14
4 / 100
 463 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 x)
{
    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]-x)*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
4.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Incorrect 5 ms 384 KB Output isn't correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Incorrect 153 ms 4344 KB Output isn't correct
8 Correct 4 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 Incorrect 5 ms 640 KB Output isn't correct
13 Incorrect 5 ms 640 KB Output isn't correct
14 Correct 5 ms 640 KB Output is correct
15 Incorrect 5 ms 512 KB Output isn't correct
16 Incorrect 5 ms 512 KB Output isn't correct
17 Incorrect 5 ms 512 KB Output isn't correct
18 Incorrect 5 ms 512 KB Output isn't correct
19 Incorrect 5 ms 512 KB Output isn't correct
20 Incorrect 5 ms 512 KB Output isn't correct
21 Incorrect 5 ms 512 KB Output isn't correct
22 Incorrect 5 ms 512 KB Output isn't correct
23 Incorrect 5 ms 640 KB Output isn't correct
24 Incorrect 5 ms 640 KB Output isn't correct
25 Incorrect 5 ms 640 KB Output isn't correct
26 Incorrect 5 ms 640 KB Output isn't correct
27 Incorrect 5 ms 768 KB Output isn't correct
28 Incorrect 6 ms 640 KB Output isn't correct
29 Incorrect 5 ms 640 KB Output isn't correct
30 Incorrect 6 ms 768 KB Output isn't correct
31 Incorrect 5 ms 640 KB Output isn't correct
32 Incorrect 5 ms 640 KB Output isn't correct
33 Incorrect 12 ms 2176 KB Output isn't correct
34 Incorrect 41 ms 2048 KB Output isn't correct
35 Incorrect 22 ms 2048 KB Output isn't correct
36 Incorrect 12 ms 2176 KB Output isn't correct
37 Incorrect 13 ms 2176 KB Output isn't correct
38 Incorrect 28 ms 2176 KB Output isn't correct
39 Incorrect 14 ms 2432 KB Output isn't correct
40 Incorrect 69 ms 2432 KB Output isn't correct
41 Incorrect 34 ms 2432 KB Output isn't correct
42 Incorrect 15 ms 2688 KB Output isn't correct
43 Incorrect 17 ms 2688 KB Output isn't correct
44 Incorrect 41 ms 2688 KB Output isn't correct
45 Incorrect 19 ms 2996 KB Output isn't correct
46 Incorrect 104 ms 3064 KB Output isn't correct
47 Incorrect 53 ms 2944 KB Output isn't correct
48 Incorrect 20 ms 3200 KB Output isn't correct
49 Incorrect 22 ms 3200 KB Output isn't correct
50 Incorrect 58 ms 3200 KB Output isn't correct
51 Incorrect 23 ms 3456 KB Output isn't correct
52 Incorrect 143 ms 3456 KB Output isn't correct
53 Incorrect 69 ms 3456 KB Output isn't correct
54 Incorrect 26 ms 3584 KB Output isn't correct
55 Incorrect 27 ms 3584 KB Output isn't correct
56 Incorrect 76 ms 3700 KB Output isn't correct
57 Incorrect 30 ms 3840 KB Output isn't correct
58 Incorrect 196 ms 3840 KB Output isn't correct
59 Incorrect 96 ms 3968 KB Output isn't correct
60 Incorrect 32 ms 4096 KB Output isn't correct
61 Incorrect 34 ms 4092 KB Output isn't correct
62 Incorrect 106 ms 4172 KB Output isn't correct
63 Incorrect 182 ms 4216 KB Output isn't correct
64 Incorrect 463 ms 4216 KB Output isn't correct
65 Incorrect 412 ms 4216 KB Output isn't correct
66 Incorrect 333 ms 4216 KB Output isn't correct
67 Correct 241 ms 4344 KB Output is correct
68 Incorrect 47 ms 4096 KB Output isn't correct
69 Incorrect 46 ms 4096 KB Output isn't correct
70 Incorrect 46 ms 4096 KB Output isn't correct
71 Incorrect 46 ms 4096 KB Output isn't correct
72 Incorrect 46 ms 4096 KB Output isn't correct
73 Incorrect 81 ms 4480 KB Output isn't correct
74 Incorrect 85 ms 4480 KB Output isn't correct
75 Incorrect 87 ms 4480 KB Output isn't correct
76 Incorrect 78 ms 4608 KB Output isn't correct
77 Incorrect 86 ms 4608 KB Output isn't correct
78 Correct 45 ms 4600 KB Output is correct
79 Incorrect 45 ms 4472 KB Output isn't correct
80 Incorrect 44 ms 4472 KB Output isn't correct
81 Incorrect 46 ms 4472 KB Output isn't correct
82 Incorrect 44 ms 4472 KB Output isn't correct
83 Incorrect 134 ms 4596 KB Output isn't correct
84 Incorrect 125 ms 4348 KB Output isn't correct
85 Incorrect 109 ms 4468 KB Output isn't correct
86 Incorrect 98 ms 4340 KB Output isn't correct
87 Incorrect 118 ms 4580 KB Output isn't correct
88 Incorrect 121 ms 4344 KB Output isn't correct
89 Incorrect 133 ms 4344 KB Output isn't correct
90 Incorrect 139 ms 4344 KB Output isn't correct
91 Incorrect 138 ms 4472 KB Output isn't correct
92 Incorrect 133 ms 4472 KB Output isn't correct