oj.uz

답안 #885977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885977 2023-12-11T09:18:14 Z JakobZorz Mecho (IOI09_mecho) C++17
88 / 100
 963 ms 3076 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=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
88.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 408 KB Output is correct
7 Correct 941 ms 2268 KB Output is correct
8 Correct 2 ms 344 KB Output is 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 480 KB Output is correct
14 Correct 9 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 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 3 ms 348 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 5 ms 468 KB Output is correct
29 Correct 5 ms 472 KB Output is correct
30 Correct 5 ms 348 KB Output is correct
31 Correct 6 ms 348 KB Output is correct
32 Correct 6 ms 600 KB Output is correct
33 Correct 99 ms 604 KB Output is correct
34 Correct 100 ms 708 KB Output is correct
35 Correct 146 ms 604 KB Output is correct
36 Correct 127 ms 788 KB Output is correct
37 Correct 121 ms 784 KB Output is correct
38 Correct 194 ms 860 KB Output is correct
39 Correct 168 ms 1108 KB Output is correct
40 Correct 161 ms 856 KB Output is correct
41 Correct 245 ms 964 KB Output is correct
42 Correct 186 ms 860 KB Output is correct
43 Correct 194 ms 972 KB Output is correct
44 Correct 302 ms 1036 KB Output is correct
45 Correct 236 ms 1080 KB Output is correct
46 Correct 238 ms 1084 KB Output is correct
47 Correct 367 ms 1368 KB Output is correct
48 Correct 267 ms 1216 KB Output is correct
49 Correct 283 ms 1116 KB Output is correct
50 Correct 443 ms 1396 KB Output is correct
51 Incorrect 312 ms 1112 KB Output isn't correct
52 Correct 348 ms 1344 KB Output is correct
53 Correct 518 ms 1436 KB Output is correct
54 Incorrect 318 ms 1476 KB Output isn't correct
55 Correct 371 ms 1488 KB Output is correct
56 Correct 609 ms 1620 KB Output is correct
57 Incorrect 316 ms 1628 KB Output isn't correct
58 Correct 453 ms 1632 KB Output is correct
59 Correct 697 ms 1964 KB Output is correct
60 Incorrect 319 ms 1628 KB Output isn't correct
61 Correct 508 ms 1624 KB Output is correct
62 Correct 805 ms 2120 KB Output is correct
63 Correct 800 ms 1820 KB Output is correct
64 Correct 781 ms 1816 KB Output is correct
65 Correct 787 ms 1624 KB Output is correct
66 Correct 719 ms 1820 KB Output is correct
67 Correct 780 ms 1628 KB Output is correct
68 Correct 688 ms 2136 KB Output is correct
69 Correct 602 ms 2136 KB Output is correct
70 Correct 662 ms 1924 KB Output is correct
71 Correct 676 ms 2132 KB Output is correct
72 Correct 626 ms 1928 KB Output is correct
73 Correct 815 ms 3060 KB Output is correct
74 Correct 855 ms 3076 KB Output is correct
75 Correct 842 ms 3076 KB Output is correct
76 Correct 836 ms 2948 KB Output is correct
77 Correct 880 ms 3064 KB Output is correct
78 Correct 887 ms 2900 KB Output is correct
79 Correct 804 ms 2644 KB Output is correct
80 Correct 810 ms 2640 KB Output is correct
81 Correct 821 ms 2864 KB Output is correct
82 Correct 866 ms 2640 KB Output is correct
83 Correct 963 ms 2508 KB Output is correct
84 Correct 877 ms 2716 KB Output is correct
85 Correct 888 ms 2516 KB Output is correct
86 Correct 883 ms 2748 KB Output is correct
87 Correct 834 ms 2736 KB Output is correct
88 Correct 958 ms 2416 KB Output is correct
89 Correct 893 ms 2420 KB Output is correct
90 Correct 892 ms 2532 KB Output is correct
91 Correct 876 ms 2532 KB Output is correct
92 Correct 895 ms 2420 KB Output is correct