oj.uz

Submission #885980

# Submission time Handle Problem Language Result Execution time Memory
885980 2023-12-11T09:22:14 Z JakobZorz Mecho (IOI09_mecho) C++17
100 / 100
 905 ms 3328 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

int n,s;
vector<string>m,cm;
vector<pair<int,int>>q1,q2;

vector<pair<int,int>>get_nbs(pair<int,int>pos){
    vector<pair<int,int>>res;
    if(pos.first!=0)
        res.emplace_back(pos.first-1,pos.second);
    if(pos.second!=0)
        res.emplace_back(pos.first,pos.second-1);
    if(pos.first!=n-1)
        res.emplace_back(pos.first+1,pos.second);
    if(pos.second!=n-1)
        res.emplace_back(pos.first,pos.second+1);
    return res;
}

void spread_bees(){
    vector<pair<int,int>>q;
    for(pair<int,int>curr:q2){
        vector<pair<int,int>>nbs=get_nbs(curr);
        for(pair<int,int>i:nbs){
            if(cm[i.first][i.second]=='H')
                continue;
            if(cm[i.first][i.second]=='T')
                continue;
            if(cm[i.first][i.second]=='D')
                continue;
            cm[i.first][i.second]='H';
            q.push_back(i);
        }
    }
    q2=q;
}

bool check(int waits){
    cm=m;
    q1.clear();
    q2.clear();
    
    for(int x=0;x<n;x++)
        for(int y=0;y<n;y++){
            if(cm[x][y]=='H')
                q2.emplace_back(x,y);
            
            if(cm[x][y]=='M')
                q1.emplace_back(x,y);
        }
    
    while(waits--&&q2.size()){
        spread_bees();
    }
    
    while(q1.size()){
        for(int i=0;i<s;i++){
            vector<pair<int,int>>q;
            for(pair<int,int>curr:q1){
                if(cm[curr.first][curr.second]!='M')
                    continue;
                vector<pair<int,int>>nbs=get_nbs(curr);
                for(pair<int,int>i:nbs){
                    if(cm[i.first][i.second]=='H')
                        continue;
                    if(cm[i.first][i.second]=='T')
                        continue;
                    if(cm[i.first][i.second]=='D')
                        return true;
                    if(cm[i.first][i.second]=='M')
                        continue;
                    cm[i.first][i.second]='M';
                    q.push_back(i);
                }
            }
            q1=q;
        }
        
        spread_bees();
    }
    
    return false;
}

void solve(){
    cin>>n>>s;
    m.resize(n);
    for(string&i:m)
        cin>>i;
    
    int l=-1,r=4e5;
    while(l<r-1){
        int m=(l+r)/2;
        if(check(m))
            l=m;
        else
            r=m;
    }
    cout<<l<<"\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*
 
7 3
TTTTTTT
TGGGGGT
TGGGGGT
MGGGGGD
TGGGGGT
TGGGGGT
THHHHHT
 
 
7 3
TTTTTTT
TGGGGGT
TGGGGGT
MGGGGGD
TGGGGGT
TGGGGGT
TGHHGGT
 
 */

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 876 ms 2268 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 4 ms 344 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 4 ms 476 KB Output is correct
30 Correct 4 ms 348 KB Output is correct
31 Correct 5 ms 348 KB Output is correct
32 Correct 5 ms 348 KB Output is correct
33 Correct 117 ms 604 KB Output is correct
34 Correct 106 ms 708 KB Output is correct
35 Correct 125 ms 772 KB Output is correct
36 Correct 139 ms 788 KB Output is correct
37 Correct 129 ms 600 KB Output is correct
38 Correct 161 ms 852 KB Output is correct
39 Correct 178 ms 880 KB Output is correct
40 Correct 171 ms 860 KB Output is correct
41 Correct 228 ms 960 KB Output is correct
42 Correct 209 ms 1112 KB Output is correct
43 Correct 216 ms 860 KB Output is correct
44 Correct 252 ms 1060 KB Output is correct
45 Correct 248 ms 856 KB Output is correct
46 Correct 264 ms 1088 KB Output is correct
47 Correct 300 ms 1136 KB Output is correct
48 Correct 294 ms 1116 KB Output is correct
49 Correct 309 ms 1212 KB Output is correct
50 Correct 339 ms 1116 KB Output is correct
51 Correct 376 ms 1348 KB Output is correct
52 Correct 405 ms 1348 KB Output is correct
53 Correct 422 ms 1428 KB Output is correct
54 Correct 403 ms 1476 KB Output is correct
55 Correct 413 ms 1624 KB Output is correct
56 Correct 479 ms 1580 KB Output is correct
57 Correct 485 ms 1644 KB Output is correct
58 Correct 500 ms 1876 KB Output is correct
59 Correct 521 ms 1684 KB Output is correct
60 Correct 539 ms 1628 KB Output is correct
61 Correct 550 ms 1808 KB Output is correct
62 Correct 628 ms 1884 KB Output is correct
63 Correct 601 ms 1824 KB Output is correct
64 Correct 633 ms 1836 KB Output is correct
65 Correct 623 ms 1876 KB Output is correct
66 Correct 644 ms 1628 KB Output is correct
67 Correct 631 ms 1816 KB Output is correct
68 Correct 621 ms 1924 KB Output is correct
69 Correct 555 ms 1916 KB Output is correct
70 Correct 593 ms 1924 KB Output is correct
71 Correct 603 ms 1924 KB Output is correct
72 Correct 693 ms 1928 KB Output is correct
73 Correct 797 ms 3328 KB Output is correct
74 Correct 885 ms 3180 KB Output is correct
75 Correct 885 ms 3076 KB Output is correct
76 Correct 875 ms 3080 KB Output is correct
77 Correct 890 ms 3320 KB Output is correct
78 Correct 843 ms 2704 KB Output is correct
79 Correct 821 ms 2624 KB Output is correct
80 Correct 849 ms 2644 KB Output is correct
81 Correct 841 ms 2612 KB Output is correct
82 Correct 895 ms 2864 KB Output is correct
83 Correct 905 ms 2508 KB Output is correct
84 Correct 868 ms 2512 KB Output is correct
85 Correct 889 ms 2516 KB Output is correct
86 Correct 845 ms 2512 KB Output is correct
87 Correct 832 ms 2512 KB Output is correct
88 Correct 897 ms 2536 KB Output is correct
89 Correct 848 ms 2528 KB Output is correct
90 Correct 832 ms 2524 KB Output is correct
91 Correct 841 ms 2528 KB Output is correct
92 Correct 864 ms 2640 KB Output is correct