oj.uz

답안 #240198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240198 2020-06-18T14:18:24 Z Autoratch Mecho (IOI09_mecho) C++14
23 / 100
 208 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>,pair<int,int> > > q;
queue<pair<pair<int,int>,int> > qb;

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},{x,0}});
    visited[sx][sy] = true;
    while(!q.empty())
    {
        int x = q.front().first.first,y = q.front().first.second,tm = q.front().second.first,st = q.front().second.second;
        q.pop();
        if(x==tx and y==ty) return true;
        if(st==0 and tm>=bee[x][y]) continue;
        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;
            visited[ai][aj] = true;
            q.push({{ai,aj},{tm+(int)(st==0),(st+1)%s}});
        }
    }
    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];
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) 
        if(c[i][j]=='H'){ qb.push({{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();
    bee[tx][ty] = INT_MAX;
    int l = 0,r = 1600;
    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
23.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 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 Incorrect 4 ms 256 KB Output isn't correct
6 Incorrect 5 ms 384 KB Output isn't correct
7 Incorrect 147 ms 4216 KB Output isn't correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Incorrect 4 ms 384 KB Output isn't correct
17 Correct 5 ms 512 KB Output is correct
18 Incorrect 5 ms 512 KB Output isn't correct
19 Correct 6 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 Incorrect 5 ms 512 KB Output isn't correct
23 Correct 5 ms 640 KB Output is 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 640 KB Output isn't correct
28 Incorrect 5 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 768 KB Output isn't correct
32 Incorrect 5 ms 768 KB Output isn't correct
33 Incorrect 10 ms 2048 KB Output isn't correct
34 Incorrect 10 ms 2048 KB Output isn't correct
35 Incorrect 27 ms 2048 KB Output isn't correct
36 Incorrect 12 ms 2176 KB Output isn't correct
37 Incorrect 11 ms 2176 KB Output isn't correct
38 Incorrect 40 ms 2304 KB Output isn't correct
39 Incorrect 12 ms 2560 KB Output isn't correct
40 Incorrect 13 ms 2432 KB Output isn't correct
41 Incorrect 40 ms 2432 KB Output isn't correct
42 Incorrect 14 ms 2688 KB Output isn't correct
43 Incorrect 15 ms 2688 KB Output isn't correct
44 Incorrect 52 ms 2688 KB Output isn't correct
45 Incorrect 16 ms 2992 KB Output isn't correct
46 Incorrect 17 ms 2944 KB Output isn't correct
47 Incorrect 59 ms 3064 KB Output isn't correct
48 Incorrect 18 ms 3200 KB Output isn't correct
49 Incorrect 19 ms 3200 KB Output isn't correct
50 Incorrect 76 ms 3200 KB Output isn't correct
51 Incorrect 20 ms 3456 KB Output isn't correct
52 Incorrect 21 ms 3456 KB Output isn't correct
53 Incorrect 92 ms 3456 KB Output isn't correct
54 Incorrect 23 ms 3584 KB Output isn't correct
55 Incorrect 26 ms 3840 KB Output isn't correct
56 Incorrect 103 ms 3712 KB Output isn't correct
57 Incorrect 26 ms 3840 KB Output isn't correct
58 Incorrect 27 ms 3840 KB Output isn't correct
59 Incorrect 123 ms 3840 KB Output isn't correct
60 Incorrect 37 ms 4088 KB Output isn't correct
61 Incorrect 30 ms 4096 KB Output isn't correct
62 Incorrect 139 ms 4224 KB Output isn't correct
63 Correct 144 ms 4096 KB Output is correct
64 Correct 201 ms 4216 KB Output is correct
65 Incorrect 208 ms 4216 KB Output isn't correct
66 Correct 169 ms 4096 KB Output is correct
67 Correct 169 ms 4216 KB Output is correct
68 Incorrect 72 ms 4204 KB Output isn't correct
69 Correct 78 ms 4096 KB Output is correct
70 Incorrect 57 ms 4096 KB Output isn't correct
71 Incorrect 52 ms 4224 KB Output isn't correct
72 Correct 45 ms 4096 KB Output is correct
73 Correct 61 ms 4480 KB Output is correct
74 Incorrect 95 ms 4600 KB Output isn't correct
75 Incorrect 92 ms 4608 KB Output isn't correct
76 Incorrect 88 ms 4600 KB Output isn't correct
77 Incorrect 90 ms 4480 KB Output isn't correct
78 Incorrect 105 ms 4600 KB Output isn't correct
79 Incorrect 125 ms 4472 KB Output isn't correct
80 Incorrect 90 ms 4600 KB Output isn't correct
81 Incorrect 107 ms 4480 KB Output isn't correct
82 Incorrect 89 ms 4472 KB Output isn't correct
83 Incorrect 114 ms 4344 KB Output isn't correct
84 Incorrect 143 ms 4468 KB Output isn't correct
85 Incorrect 107 ms 4464 KB Output isn't correct
86 Incorrect 115 ms 4348 KB Output isn't correct
87 Incorrect 110 ms 4468 KB Output isn't correct
88 Incorrect 126 ms 4344 KB Output isn't correct
89 Incorrect 126 ms 4448 KB Output isn't correct
90 Incorrect 127 ms 4392 KB Output isn't correct
91 Incorrect 136 ms 4356 KB Output isn't correct
92 Incorrect 129 ms 4344 KB Output isn't correct