oj.uz

Submission #885979

# Submission time Handle Problem Language Result Execution time Memory
885979 2023-12-11T09:21:11 Z JakobZorz Mecho (IOI09_mecho) C++17
97 / 100
 948 ms 3324 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=3e5;
    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
97.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 917 ms 2276 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 468 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 376 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 456 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 500 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 4 ms 344 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 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 100 ms 604 KB Output is correct
34 Correct 106 ms 756 KB Output is correct
35 Correct 114 ms 756 KB Output is correct
36 Correct 154 ms 784 KB Output is correct
37 Correct 131 ms 604 KB Output is correct
38 Correct 148 ms 860 KB Output is correct
39 Correct 167 ms 856 KB Output is correct
40 Correct 164 ms 880 KB Output is correct
41 Correct 191 ms 1108 KB Output is correct
42 Correct 203 ms 860 KB Output is correct
43 Correct 201 ms 860 KB Output is correct
44 Correct 231 ms 1296 KB Output is correct
45 Correct 264 ms 856 KB Output is correct
46 Correct 235 ms 1076 KB Output is correct
47 Correct 276 ms 1128 KB Output is correct
48 Correct 312 ms 1116 KB Output is correct
49 Correct 318 ms 1360 KB Output is correct
50 Correct 331 ms 1116 KB Output is correct
51 Correct 375 ms 1360 KB Output is correct
52 Correct 340 ms 1340 KB Output is correct
53 Correct 397 ms 1432 KB Output is correct
54 Correct 406 ms 1372 KB Output is correct
55 Correct 400 ms 1500 KB Output is correct
56 Correct 449 ms 1552 KB Output is correct
57 Correct 455 ms 1636 KB Output is correct
58 Correct 452 ms 1636 KB Output is correct
59 Correct 515 ms 1724 KB Output is correct
60 Incorrect 510 ms 1808 KB Output isn't correct
61 Correct 556 ms 1876 KB Output is correct
62 Correct 619 ms 1916 KB Output is correct
63 Correct 601 ms 1820 KB Output is correct
64 Correct 671 ms 2056 KB Output is correct
65 Correct 601 ms 1628 KB Output is correct
66 Correct 646 ms 1628 KB Output is correct
67 Correct 595 ms 1804 KB Output is correct
68 Correct 586 ms 1928 KB Output is correct
69 Correct 484 ms 1884 KB Output is correct
70 Correct 565 ms 1924 KB Output is correct
71 Correct 611 ms 1924 KB Output is correct
72 Correct 657 ms 1924 KB Output is correct
73 Correct 641 ms 3072 KB Output is correct
74 Correct 824 ms 3324 KB Output is correct
75 Correct 866 ms 3320 KB Output is correct
76 Correct 869 ms 3080 KB Output is correct
77 Correct 847 ms 3324 KB Output is correct
78 Correct 852 ms 2644 KB Output is correct
79 Correct 812 ms 2640 KB Output is correct
80 Correct 948 ms 2644 KB Output is correct
81 Correct 834 ms 2644 KB Output is correct
82 Correct 845 ms 2644 KB Output is correct
83 Correct 861 ms 2512 KB Output is correct
84 Correct 834 ms 2512 KB Output is correct
85 Correct 876 ms 2516 KB Output is correct
86 Correct 874 ms 2508 KB Output is correct
87 Correct 825 ms 2732 KB Output is correct
88 Correct 860 ms 2536 KB Output is correct
89 Correct 818 ms 2420 KB Output is correct
90 Correct 823 ms 2532 KB Output is correct
91 Correct 840 ms 2524 KB Output is correct
92 Correct 833 ms 2532 KB Output is correct