oj.uz

Submission #885967

# Submission time Handle Problem Language Result Execution time Memory
885967 2023-12-11T09:01:53 Z JakobZorz Mecho (IOI09_mecho) C++17
72 / 100
 985 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=0,r=2e5;
    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
72.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 946 ms 2400 KB Output is correct
8 Incorrect 2 ms 344 KB Output isn't correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Incorrect 6 ms 484 KB Output isn't correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 5 ms 348 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 5 ms 472 KB Output is correct
29 Correct 5 ms 472 KB Output is correct
30 Correct 7 ms 348 KB Output is correct
31 Correct 6 ms 600 KB Output is correct
32 Correct 9 ms 348 KB Output is correct
33 Correct 92 ms 600 KB Output is correct
34 Correct 97 ms 708 KB Output is correct
35 Correct 155 ms 756 KB Output is correct
36 Correct 128 ms 604 KB Output is correct
37 Correct 127 ms 604 KB Output is correct
38 Correct 209 ms 860 KB Output is correct
39 Correct 154 ms 884 KB Output is correct
40 Correct 180 ms 872 KB Output is correct
41 Correct 260 ms 1104 KB Output is correct
42 Correct 199 ms 860 KB Output is correct
43 Correct 201 ms 860 KB Output is correct
44 Correct 347 ms 1056 KB Output is correct
45 Correct 243 ms 860 KB Output is correct
46 Correct 238 ms 1084 KB Output is correct
47 Correct 447 ms 1308 KB Output is correct
48 Correct 292 ms 1116 KB Output is correct
49 Correct 310 ms 1364 KB Output is correct
50 Correct 461 ms 1116 KB Output is correct
51 Incorrect 318 ms 1352 KB Output isn't correct
52 Correct 343 ms 1116 KB Output is correct
53 Correct 563 ms 1436 KB Output is correct
54 Incorrect 318 ms 1480 KB Output isn't correct
55 Correct 399 ms 1480 KB Output is correct
56 Correct 635 ms 1572 KB Output is correct
57 Incorrect 318 ms 1624 KB Output isn't correct
58 Correct 462 ms 1876 KB Output is correct
59 Correct 732 ms 1696 KB Output is correct
60 Incorrect 353 ms 1628 KB Output isn't correct
61 Correct 484 ms 1880 KB Output is correct
62 Correct 907 ms 2112 KB Output is correct
63 Correct 766 ms 1876 KB Output is correct
64 Correct 784 ms 1812 KB Output is correct
65 Correct 725 ms 1820 KB Output is correct
66 Correct 787 ms 1820 KB Output is correct
67 Incorrect 841 ms 1828 KB Output isn't correct
68 Correct 659 ms 1928 KB Output is correct
69 Correct 642 ms 1940 KB Output is correct
70 Correct 674 ms 1928 KB Output is correct
71 Correct 677 ms 1920 KB Output is correct
72 Correct 657 ms 1920 KB Output is correct
73 Correct 835 ms 3076 KB Output is correct
74 Correct 824 ms 3076 KB Output is correct
75 Correct 923 ms 3080 KB Output is correct
76 Correct 888 ms 3080 KB Output is correct
77 Correct 882 ms 3320 KB Output is correct
78 Incorrect 916 ms 2644 KB Output isn't correct
79 Correct 844 ms 2644 KB Output is correct
80 Correct 907 ms 2644 KB Output is correct
81 Correct 898 ms 2716 KB Output is correct
82 Correct 881 ms 2616 KB Output is correct
83 Correct 985 ms 2504 KB Output is correct
84 Correct 898 ms 2516 KB Output is correct
85 Correct 888 ms 2724 KB Output is correct
86 Correct 879 ms 2508 KB Output is correct
87 Correct 873 ms 2512 KB Output is correct
88 Correct 908 ms 2536 KB Output is correct
89 Correct 860 ms 2528 KB Output is correct
90 Correct 932 ms 2648 KB Output is correct
91 Correct 879 ms 2640 KB Output is correct
92 Correct 912 ms 2420 KB Output is correct