oj.uz

답안 #960547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960547 2024-04-10T15:43:47 Z LmaoLmao Mecho (IOI09_mecho) C++14
61 / 100
 200 ms 8140 KB 
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
 
using ll = long long;
using ii = pair<int, int>;
 
const int N = 1e6+5;
const int INF = 1e9;

int d[1000][1000],m[1000][1000],n,s;
char a[1000][1000];
int dx[4]={1,0,0,-1};
int dy[4]={0,1,-1,0};
ii pos,h;

bool bfs(int x) {
    queue<ii> q;
    q.push(pos);
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            m[i][j]=0;
        }
    }
    while(!q.empty()) {
        ii u=q.front();
        q.pop();
        for(int i=0;i<4;i++) {
            ii v={u.fi+dx[i],u.se+dy[i]};
            if(v.fi<0 || v.fi>=n || v.se<0 || v.se>=n) continue;
            if(m[v.fi][v.se]==0 && a[v.fi][v.se]!='T' && 
            d[v.fi][v.se]-x>m[u.fi][u.se]+1 && a[v.fi][v.se]!='M') {
                m[v.fi][v.se]=m[u.fi][u.se]+1;
                q.push(v);
            }
        }
    }
    if(m[h.fi][h.se]>0) return 1; else return 0;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    queue<ii> q;
    cin >> n >> s;
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            cin >> a[i][j];
            if(a[i][j]=='H') {
                q.push({i,j});
            }
            if(a[i][j]=='M') pos={i,j};
            if(a[i][j]=='D') h={i,j};
        }
    }
    while(!q.empty()) {
        ii u=q.front();
        q.pop();
        for(int i=0;i<4;i++) {
            ii v={u.fi+dx[i],u.se+dy[i]};
            if(v.fi<0 || v.fi>=n || v.se<0 || v.se>=n) continue;
            if(d[v.fi][v.se]==0 && a[v.fi][v.se]!='T' && a[v.fi][v.se]!='H') {
                d[v.fi][v.se]=d[u.fi][u.se]+s;
                q.push(v);
            }
        }
    }
    int l=0,r=1000000000,ans=-1;
    while(l<=r) {
        int m=(l+r)/2;
        if(bfs(m)) {
            ans=m;
            l=m+1;
        }
        else {
            r=m-1;
        }
    }
    cout << ans/s;
    return 0;
}

Subtask #1
61.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Incorrect 80 ms 7968 KB Output isn't correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't correct
14 Incorrect 1 ms 2652 KB Output isn't correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2456 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2800 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 4 ms 5980 KB Output is correct
34 Correct 4 ms 5980 KB Output is correct
35 Correct 23 ms 6112 KB Output is correct
36 Correct 5 ms 6248 KB Output is correct
37 Correct 5 ms 6236 KB Output is correct
38 Correct 35 ms 6236 KB Output is correct
39 Correct 6 ms 6488 KB Output is correct
40 Correct 6 ms 6512 KB Output is correct
41 Correct 38 ms 6492 KB Output is correct
42 Correct 7 ms 6488 KB Output is correct
43 Correct 8 ms 6492 KB Output is correct
44 Correct 57 ms 6492 KB Output is correct
45 Correct 8 ms 6744 KB Output is correct
46 Correct 12 ms 6748 KB Output is correct
47 Correct 58 ms 6880 KB Output is correct
48 Correct 12 ms 7000 KB Output is correct
49 Correct 9 ms 7004 KB Output is correct
50 Correct 73 ms 7076 KB Output is correct
51 Correct 15 ms 7260 KB Output is correct
52 Correct 10 ms 7260 KB Output is correct
53 Correct 81 ms 7256 KB Output is correct
54 Correct 13 ms 7260 KB Output is correct
55 Correct 12 ms 7288 KB Output is correct
56 Correct 94 ms 7420 KB Output is correct
57 Correct 17 ms 7512 KB Output is correct
58 Correct 14 ms 7516 KB Output is correct
59 Correct 114 ms 7664 KB Output is correct
60 Correct 16 ms 7772 KB Output is correct
61 Correct 13 ms 7772 KB Output is correct
62 Correct 139 ms 7768 KB Output is correct
63 Correct 78 ms 7876 KB Output is correct
64 Correct 200 ms 7860 KB Output is correct
65 Correct 128 ms 7804 KB Output is correct
66 Correct 94 ms 7864 KB Output is correct
67 Incorrect 82 ms 7856 KB Output isn't correct
68 Correct 48 ms 7768 KB Output is correct
69 Correct 46 ms 8028 KB Output is correct
70 Correct 31 ms 7772 KB Output is correct
71 Correct 30 ms 7772 KB Output is correct
72 Incorrect 30 ms 8020 KB Output isn't correct
73 Incorrect 32 ms 8020 KB Output isn't correct
74 Correct 62 ms 8132 KB Output is correct
75 Correct 55 ms 8024 KB Output is correct
76 Correct 43 ms 8024 KB Output is correct
77 Correct 49 ms 8140 KB Output is correct
78 Incorrect 57 ms 8100 KB Output isn't correct
79 Correct 55 ms 8028 KB Output is correct
80 Correct 54 ms 8100 KB Output is correct
81 Correct 50 ms 8028 KB Output is correct
82 Correct 56 ms 8012 KB Output is correct
83 Correct 66 ms 8088 KB Output is correct
84 Correct 67 ms 8028 KB Output is correct
85 Correct 57 ms 8064 KB Output is correct
86 Correct 61 ms 8072 KB Output is correct
87 Correct 62 ms 8024 KB Output is correct
88 Correct 62 ms 8024 KB Output is correct
89 Correct 77 ms 8028 KB Output is correct
90 Correct 73 ms 8024 KB Output is correct
91 Correct 73 ms 8028 KB Output is correct
92 Correct 70 ms 8024 KB Output is correct