oj.uz

답안 #335736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335736 2020-12-13T19:34:49 Z DavidDamian Mecho (IOI09_mecho) C++11
53 / 100
 210 ms 8928 KB 
#include <bits/stdc++.h>
using namespace std;
struct node{
    int i;
    int j;
    node(){}
    node(int I,int J){
        i=I;
        j=J;
    }
};
queue<node> Q;
char forest[805][805];
int bees[805][805];
int dist[805][805];
int energy[805][805];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int n,s;

void bfsBees(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            bees[i][j]=INT_MAX;
            if(forest[i][j]=='H'){
                Q.push(node(i,j));
                bees[i][j]=0;
            }
        }
    }
    while(!Q.empty()){
        node u=Q.front();
        Q.pop();
        for(int mov=0;mov<4;mov++){
            int i=u.i+dx[mov];
            int j=u.j+dy[mov];
            if(i<1 || i>n) continue;
            if(j<1 || j>n) continue;
            if(forest[i][j]=='T' || forest[i][j]=='D') continue;
            if(bees[i][j]==INT_MAX){
                bees[i][j]=bees[u.i][u.j]+1;
                Q.push(node(i,j));
            }
        }
    }
}

node mecho;
node home;

bool bfsMecho(int init){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            dist[i][j]=INT_MAX;
            energy[i][j]=0;
        }
    }
    dist[mecho.i][mecho.j]=init;
    energy[mecho.i][mecho.j]=0;
    Q.push(mecho);
    while(!Q.empty()){
        node u=Q.front();
        Q.pop();
        if(bees[u.i][u.j]==dist[u.i][u.j] && energy[u.i][u.j]==0) continue;
        for(int mov=0;mov<4;mov++){
            int i=u.i+dx[mov];
            int j=u.j+dy[mov];
            if(i<1 || i>n) continue;
            if(j<1 || j>n) continue;
            if(forest[i][j]=='T') continue;
            if(dist[i][j]==INT_MAX){
                int change=(energy[u.i][u.j]>0)? 0 : 1;
                dist[i][j]=dist[u.i][u.j]+change;
                if(bees[i][j]<dist[i][j]) continue;
                energy[i][j]=(energy[u.i][u.j]>0)? energy[u.i][u.j]-1 : s-1;
                Q.push(node(i,j));
            }
        }
    }
    return dist[home.i][home.j]!=INT_MAX;
}

int binarySearch(){
    int k=-1;
    int L=0,R=3*n;
    while(L<R){
        int mid=(L+R)/2;
        if(bfsMecho(mid)){
            k=mid;
            L=mid+1;
        }
        else{
            R=mid;
        }
    }
    return k;
}

int binarySearch2(){
    int k=-1;
    for(int b=10000;b>=1;b/=2){
        while(bfsMecho(b+k)) k+=b;
    }
    return k;
}

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>>forest[i][j];
            if(forest[i][j]=='M'){
                mecho=node(i,j);
            }
            else if(forest[i][j]=='D'){
                home=node(i,j);
            }
        }
    }
    bfsBees();
    int ans=binarySearch();
    cout<<ans<<endl;
    return 0;
}

Subtask #1
53.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 112 ms 8684 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Incorrect 1 ms 1004 KB Output isn't correct
13 Correct 1 ms 876 KB Output is correct
14 Correct 2 ms 1004 KB Output is correct
15 Incorrect 1 ms 492 KB Output isn't correct
16 Incorrect 1 ms 492 KB Output isn't correct
17 Incorrect 1 ms 620 KB Output isn't correct
18 Incorrect 1 ms 620 KB Output isn't correct
19 Incorrect 1 ms 620 KB Output isn't correct
20 Incorrect 1 ms 620 KB Output isn't correct
21 Incorrect 1 ms 748 KB Output isn't correct
22 Incorrect 1 ms 748 KB Output isn't correct
23 Incorrect 1 ms 876 KB Output isn't correct
24 Incorrect 1 ms 876 KB Output isn't correct
25 Incorrect 1 ms 1004 KB Output isn't correct
26 Incorrect 1 ms 1004 KB Output isn't correct
27 Incorrect 1 ms 1004 KB Output isn't correct
28 Incorrect 38 ms 1004 KB Output isn't correct
29 Incorrect 1 ms 1132 KB Output isn't correct
30 Incorrect 1 ms 1132 KB Output isn't correct
31 Incorrect 1 ms 1132 KB Output isn't correct
32 Incorrect 2 ms 1132 KB Output isn't correct
33 Incorrect 15 ms 3948 KB Output isn't correct
34 Incorrect 20 ms 3948 KB Output isn't correct
35 Correct 26 ms 3948 KB Output is correct
36 Incorrect 19 ms 4460 KB Output isn't correct
37 Incorrect 27 ms 4480 KB Output isn't correct
38 Correct 73 ms 4460 KB Output is correct
39 Incorrect 24 ms 4972 KB Output isn't correct
40 Incorrect 33 ms 5024 KB Output isn't correct
41 Correct 44 ms 4972 KB Output is correct
42 Incorrect 29 ms 5484 KB Output isn't correct
43 Incorrect 44 ms 5484 KB Output isn't correct
44 Correct 59 ms 5484 KB Output is correct
45 Incorrect 35 ms 6124 KB Output isn't correct
46 Incorrect 51 ms 5996 KB Output isn't correct
47 Correct 78 ms 6128 KB Output is correct
48 Incorrect 41 ms 6508 KB Output isn't correct
49 Incorrect 57 ms 6508 KB Output isn't correct
50 Correct 91 ms 6508 KB Output is correct
51 Incorrect 49 ms 7020 KB Output isn't correct
52 Incorrect 67 ms 7020 KB Output isn't correct
53 Correct 130 ms 7020 KB Output is correct
54 Incorrect 58 ms 7532 KB Output isn't correct
55 Incorrect 86 ms 7660 KB Output isn't correct
56 Correct 178 ms 7532 KB Output is correct
57 Incorrect 72 ms 8044 KB Output isn't correct
58 Incorrect 112 ms 8092 KB Output isn't correct
59 Correct 146 ms 8172 KB Output is correct
60 Incorrect 76 ms 8556 KB Output isn't correct
61 Incorrect 109 ms 8684 KB Output isn't correct
62 Correct 198 ms 8708 KB Output is correct
63 Correct 154 ms 8556 KB Output is correct
64 Correct 210 ms 8684 KB Output is correct
65 Correct 194 ms 8556 KB Output is correct
66 Correct 168 ms 8608 KB Output is correct
67 Correct 153 ms 8556 KB Output is correct
68 Correct 74 ms 8556 KB Output is correct
69 Correct 58 ms 8556 KB Output is correct
70 Correct 55 ms 8556 KB Output is correct
71 Correct 51 ms 8556 KB Output is correct
72 Correct 47 ms 8556 KB Output is correct
73 Correct 47 ms 8812 KB Output is correct
74 Correct 80 ms 8812 KB Output is correct
75 Correct 92 ms 8812 KB Output is correct
76 Correct 88 ms 8812 KB Output is correct
77 Correct 86 ms 8812 KB Output is correct
78 Correct 103 ms 8812 KB Output is correct
79 Correct 75 ms 8812 KB Output is correct
80 Correct 85 ms 8812 KB Output is correct
81 Correct 88 ms 8928 KB Output is correct
82 Correct 80 ms 8796 KB Output is correct
83 Correct 116 ms 8812 KB Output is correct
84 Correct 92 ms 8812 KB Output is correct
85 Correct 94 ms 8812 KB Output is correct
86 Correct 111 ms 8812 KB Output is correct
87 Correct 106 ms 8820 KB Output is correct
88 Correct 128 ms 8768 KB Output is correct
89 Correct 116 ms 8684 KB Output is correct
90 Correct 122 ms 8684 KB Output is correct
91 Correct 110 ms 8684 KB Output is correct
92 Correct 111 ms 8684 KB Output is correct