oj.uz

Submission #335507

# Submission time Handle Problem Language Result Execution time Memory
335507 2020-12-12T21:25:56 Z DavidDamian Mecho (IOI09_mecho) C++11
100 / 100
 258 ms 8940 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
char forest[805][805];
int n,s;
queue<pii> Q;
int timeBees[805][805];
int dx[4]={1,-1,0,0};
int dy[4]{0,0,1,-1};
void bfsBees(vector<pii> source){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            timeBees[i][j]=INT_MAX;
        }
    }
    for(pii u: source){
        timeBees[u.first][u.second]=0;
        Q.push(u);
    }
    while(!Q.empty()){
        pii u=Q.front();
        Q.pop();
        for(int mov=0;mov<4;mov++){
            int i=u.first+dx[mov];
            int j=u.second+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(timeBees[i][j]==INT_MAX){
                timeBees[i][j]=timeBees[u.first][u.second]+1;
                Q.push(pii(i,j));
            }
        }
    }
}
pii start;
pii goal;
int dist[805][805];
int fuel[805][805];
bool valid(int moment){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            dist[i][j]=INT_MAX;
        }
    }
    if(timeBees[start.first][start.second]<=moment-1) return false;
    dist[start.first][start.second]=moment-1;
    fuel[start.first][start.second]=0;
    Q.push(start);
    while(!Q.empty()){
        pii u=Q.front();
        Q.pop();
        if(dist[u.first][u.second]==timeBees[u.first][u.second] && fuel[u.first][u.second]==0) continue;
        for(int mov=0;mov<4;mov++){
            int i=u.first+dx[mov];
            int j=u.second+dy[mov];
            if(i<1 || i>n) continue;
            if(j<1 || j>n) continue;
            if(forest[i][j]=='T') continue;
            int nxt_dist=dist[u.first][u.second];
            if(fuel[u.first][u.second]==0)
                nxt_dist++;
            if(timeBees[i][j]<nxt_dist) continue;
            if(dist[i][j]==INT_MAX){
                dist[i][j]=nxt_dist;
                fuel[i][j]=(fuel[u.first][u.second]>0)? fuel[u.first][u.second]-1 : s-1;
                Q.push(pii(i,j));
            }
        }
    }
    return dist[goal.first][goal.second]!=INT_MAX;
}
int binarySearch(){
    int k=0;
    for(int b=10000;b>=1;b/=2){
        while(valid(k+b)) k+=b;
    }
    return k-1;
}
int main()
{
    vector<pii> beeSource;
    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]=='H'){
                beeSource.push_back(pii(i,j));
            }
            else if(forest[i][j]=='M'){
                start=pii(i,j);
            }
            else if(forest[i][j]=='D'){
                goal=pii(i,j);
            }
        }
    }
    bfsBees(beeSource);
    int last=binarySearch();
    cout<<last<<'\n';
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 179 ms 7660 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 Correct 1 ms 876 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 1 ms 876 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 620 KB Output is correct
20 Correct 1 ms 620 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 1 ms 748 KB Output is correct
25 Correct 1 ms 748 KB Output is correct
26 Correct 1 ms 876 KB Output is correct
27 Correct 1 ms 876 KB Output is correct
28 Correct 1 ms 876 KB Output is correct
29 Correct 1 ms 876 KB Output is correct
30 Correct 1 ms 876 KB Output is correct
31 Correct 1 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 14 ms 3308 KB Output is correct
34 Correct 18 ms 3564 KB Output is correct
35 Correct 49 ms 3948 KB Output is correct
36 Correct 20 ms 3692 KB Output is correct
37 Correct 19 ms 4076 KB Output is correct
38 Correct 49 ms 4460 KB Output is correct
39 Correct 28 ms 4204 KB Output is correct
40 Correct 26 ms 4716 KB Output is correct
41 Correct 64 ms 4972 KB Output is correct
42 Correct 34 ms 4588 KB Output is correct
43 Correct 33 ms 5228 KB Output is correct
44 Correct 85 ms 5612 KB Output is correct
45 Correct 45 ms 5100 KB Output is correct
46 Correct 44 ms 5868 KB Output is correct
47 Correct 99 ms 5996 KB Output is correct
48 Correct 55 ms 5484 KB Output is correct
49 Correct 51 ms 6252 KB Output is correct
50 Correct 119 ms 6508 KB Output is correct
51 Correct 75 ms 5868 KB Output is correct
52 Correct 65 ms 6764 KB Output is correct
53 Correct 161 ms 7020 KB Output is correct
54 Correct 87 ms 6380 KB Output is correct
55 Correct 86 ms 7404 KB Output is correct
56 Correct 172 ms 7532 KB Output is correct
57 Correct 107 ms 6764 KB Output is correct
58 Correct 96 ms 7788 KB Output is correct
59 Correct 207 ms 8172 KB Output is correct
60 Correct 133 ms 7276 KB Output is correct
61 Correct 117 ms 8428 KB Output is correct
62 Correct 235 ms 8684 KB Output is correct
63 Correct 162 ms 8556 KB Output is correct
64 Correct 258 ms 8520 KB Output is correct
65 Correct 243 ms 8556 KB Output is correct
66 Correct 208 ms 8556 KB Output is correct
67 Correct 162 ms 8556 KB Output is correct
68 Correct 98 ms 8668 KB Output is correct
69 Correct 84 ms 8636 KB Output is correct
70 Correct 78 ms 8556 KB Output is correct
71 Correct 75 ms 8556 KB Output is correct
72 Correct 69 ms 6636 KB Output is correct
73 Correct 73 ms 8940 KB Output is correct
74 Correct 117 ms 8812 KB Output is correct
75 Correct 142 ms 8812 KB Output is correct
76 Correct 134 ms 8812 KB Output is correct
77 Correct 108 ms 8812 KB Output is correct
78 Correct 121 ms 7532 KB Output is correct
79 Correct 101 ms 7148 KB Output is correct
80 Correct 117 ms 7260 KB Output is correct
81 Correct 136 ms 7532 KB Output is correct
82 Correct 123 ms 7276 KB Output is correct
83 Correct 148 ms 7532 KB Output is correct
84 Correct 148 ms 7532 KB Output is correct
85 Correct 147 ms 7532 KB Output is correct
86 Correct 153 ms 7404 KB Output is correct
87 Correct 161 ms 7404 KB Output is correct
88 Correct 144 ms 7660 KB Output is correct
89 Correct 155 ms 7404 KB Output is correct
90 Correct 167 ms 7532 KB Output is correct
91 Correct 173 ms 7532 KB Output is correct
92 Correct 162 ms 7532 KB Output is correct