oj.uz

답안 #885974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885974 2023-12-11T09:15:45 Z JakobZorz Mecho (IOI09_mecho) C++17
72 / 100
 996 ms 3080 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;
    }
    if(l==2e5-1)
        l=-1;
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 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 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 996 ms 2268 KB Output is correct
8 Incorrect 2 ms 348 KB Output isn't correct
9 Correct 3 ms 456 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 416 KB Output is correct
14 Incorrect 7 ms 348 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 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 344 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 344 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 5 ms 348 KB Output is correct
29 Correct 5 ms 348 KB Output is correct
30 Correct 6 ms 348 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 100 ms 708 KB Output is correct
34 Correct 95 ms 604 KB Output is correct
35 Correct 162 ms 784 KB Output is correct
36 Correct 129 ms 788 KB Output is correct
37 Correct 130 ms 600 KB Output is correct
38 Correct 214 ms 860 KB Output is correct
39 Correct 159 ms 876 KB Output is correct
40 Correct 150 ms 856 KB Output is correct
41 Correct 292 ms 932 KB Output is correct
42 Correct 210 ms 860 KB Output is correct
43 Correct 204 ms 860 KB Output is correct
44 Correct 339 ms 856 KB Output is correct
45 Correct 243 ms 860 KB Output is correct
46 Correct 247 ms 1104 KB Output is correct
47 Correct 410 ms 1128 KB Output is correct
48 Correct 300 ms 1112 KB Output is correct
49 Correct 290 ms 1220 KB Output is correct
50 Correct 508 ms 1112 KB Output is correct
51 Incorrect 317 ms 1116 KB Output isn't correct
52 Correct 359 ms 1364 KB Output is correct
53 Correct 573 ms 1688 KB Output is correct
54 Incorrect 317 ms 1480 KB Output isn't correct
55 Correct 427 ms 1616 KB Output is correct
56 Correct 670 ms 1372 KB Output is correct
57 Incorrect 329 ms 1652 KB Output isn't correct
58 Correct 463 ms 1644 KB Output is correct
59 Correct 776 ms 1712 KB Output is correct
60 Incorrect 335 ms 1792 KB Output isn't correct
61 Correct 489 ms 1792 KB Output is correct
62 Correct 889 ms 1876 KB Output is correct
63 Correct 765 ms 1624 KB Output is correct
64 Correct 838 ms 1800 KB Output is correct
65 Correct 753 ms 1872 KB Output is correct
66 Correct 796 ms 1872 KB Output is correct
67 Incorrect 818 ms 1808 KB Output isn't correct
68 Correct 670 ms 2132 KB Output is correct
69 Correct 637 ms 1924 KB Output is correct
70 Correct 680 ms 1880 KB Output is correct
71 Correct 676 ms 1880 KB Output is correct
72 Correct 669 ms 1928 KB Output is correct
73 Correct 862 ms 3076 KB Output is correct
74 Correct 864 ms 3080 KB Output is correct
75 Correct 942 ms 3064 KB Output is correct
76 Correct 941 ms 3080 KB Output is correct
77 Correct 868 ms 3072 KB Output is correct
78 Incorrect 938 ms 2640 KB Output isn't correct
79 Correct 879 ms 2644 KB Output is correct
80 Correct 909 ms 2864 KB Output is correct
81 Correct 940 ms 2860 KB Output is correct
82 Correct 875 ms 2640 KB Output is correct
83 Correct 990 ms 2512 KB Output is correct
84 Correct 930 ms 2512 KB Output is correct
85 Correct 930 ms 2520 KB Output is correct
86 Correct 925 ms 2500 KB Output is correct
87 Correct 930 ms 2744 KB Output is correct
88 Correct 962 ms 2420 KB Output is correct
89 Correct 898 ms 2528 KB Output is correct
90 Correct 921 ms 2528 KB Output is correct
91 Correct 964 ms 2636 KB Output is correct
92 Correct 942 ms 2640 KB Output is correct