oj.uz

Submission #885976

# Submission time Handle Problem Language Result Execution time Memory
885976 2023-12-11T09:16:50 Z JakobZorz Mecho (IOI09_mecho) C++17
80 / 100
 920 ms 3320 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--){
        spread_bees();
    }
    
    while(q1.size()||q2.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=1e5;
    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
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 895 ms 2424 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 480 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 2 ms 344 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 4 ms 348 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 92 ms 604 KB Output is correct
34 Correct 110 ms 712 KB Output is correct
35 Correct 143 ms 848 KB Output is correct
36 Correct 119 ms 600 KB Output is correct
37 Correct 112 ms 600 KB Output is correct
38 Correct 186 ms 852 KB Output is correct
39 Incorrect 151 ms 876 KB Output isn't correct
40 Correct 147 ms 860 KB Output is correct
41 Correct 233 ms 860 KB Output is correct
42 Incorrect 163 ms 972 KB Output isn't correct
43 Correct 177 ms 860 KB Output is correct
44 Correct 286 ms 860 KB Output is correct
45 Incorrect 151 ms 856 KB Output isn't correct
46 Correct 223 ms 860 KB Output is correct
47 Correct 349 ms 1172 KB Output is correct
48 Incorrect 159 ms 1216 KB Output isn't correct
49 Correct 268 ms 1116 KB Output is correct
50 Correct 416 ms 1304 KB Output is correct
51 Incorrect 159 ms 1116 KB Output isn't correct
52 Incorrect 339 ms 1344 KB Output isn't correct
53 Correct 502 ms 1432 KB Output is correct
54 Incorrect 162 ms 1372 KB Output isn't correct
55 Incorrect 303 ms 1620 KB Output isn't correct
56 Correct 577 ms 1552 KB Output is correct
57 Incorrect 175 ms 1872 KB Output isn't correct
58 Incorrect 298 ms 1628 KB Output isn't correct
59 Correct 660 ms 1872 KB Output is correct
60 Incorrect 164 ms 1624 KB Output isn't correct
61 Incorrect 307 ms 1804 KB Output isn't correct
62 Correct 775 ms 1844 KB Output is correct
63 Correct 755 ms 1628 KB Output is correct
64 Correct 734 ms 1816 KB Output is correct
65 Correct 735 ms 1816 KB Output is correct
66 Correct 674 ms 1876 KB Output is correct
67 Correct 756 ms 2064 KB Output is correct
68 Correct 661 ms 1924 KB Output is correct
69 Correct 547 ms 1884 KB Output is correct
70 Correct 623 ms 2132 KB Output is correct
71 Correct 632 ms 1936 KB Output is correct
72 Correct 577 ms 1920 KB Output is correct
73 Correct 785 ms 2944 KB Output is correct
74 Correct 825 ms 3204 KB Output is correct
75 Correct 798 ms 3080 KB Output is correct
76 Correct 806 ms 3320 KB Output is correct
77 Correct 832 ms 3320 KB Output is correct
78 Correct 840 ms 2612 KB Output is correct
79 Correct 766 ms 2644 KB Output is correct
80 Correct 765 ms 2644 KB Output is correct
81 Correct 780 ms 2640 KB Output is correct
82 Correct 838 ms 2644 KB Output is correct
83 Correct 920 ms 2732 KB Output is correct
84 Correct 829 ms 2512 KB Output is correct
85 Correct 810 ms 2512 KB Output is correct
86 Correct 849 ms 2724 KB Output is correct
87 Correct 782 ms 2512 KB Output is correct
88 Correct 918 ms 2644 KB Output is correct
89 Correct 873 ms 2416 KB Output is correct
90 Correct 859 ms 2528 KB Output is correct
91 Correct 829 ms 2540 KB Output is correct
92 Correct 881 ms 2548 KB Output is correct