답안 #1094990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094990	2024-10-01T06:36:22 Z	Rafat	Mecho (IOI09_mecho)	C++14	100 / 100	126 ms	7244 KB

mecho

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>

using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and 
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod =  1e9+7, MOD = 998244353;
double eps = 1e-12;
// #define forn(i,e) for(ll i = 0; i < e; i++)
#define FOR(s, e, i) for(int i = s; i <= e; i++)
// #define rforn(i,s) for(ll i = s; i >= 0; i--)
#define ROF(s ,e, i) for(int i = s; i >= e; i--)
#define coutAll(A) for(auto asdafas : A) cout <<  asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout <<  asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >>  asdafas;
#define finAll(A) for(auto &asdafas : A) fin >>  asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll> 
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
//#define MAXN 1000000
struct info{
    int i, j, dist;
    bool isbear;
    // info(int x, int y, bool b) : i(x), j(y), dist(0), isbear(b){}
};
void solve(int it)
{
    ll n, s;
    cin >> n >> s;
    vector<string>A(n);
    cinAll(A);
    int bi, bj, hi, hj;
    vp32 hives;
    queue<p32>q;
    vv32 dist_bee(n, v32(n, 1e9));
    FOR(0, n - 1, i){
        FOR(0, n - 1, j){
            if(A[i][j] == 'D'){
                hi = i;
                hj = j;
                continue;
            }
            if(A[i][j] == 'M'){
                bi = i;
                bj = j;
                continue;
            }
            if(A[i][j] == 'H'){
                hives.emplace_back(i, j);
                q.push({i, j});
                dist_bee[i][j] = 0;
            }
        }
    }
    int dx[] = {1, -1, 0, 0};
    int dy[] = {0, 0, 1, -1};
    while(!q.empty()){
        auto u = q.front();
        q.pop();
        FOR(0, 3, i){
            int ni = u.fi + dx[i];
            int nj = u.se + dy[i];
            if(ni < 0) continue;
            if(nj < 0) continue;
            if(ni > n-1) continue;
            if(nj > n-1) continue;
            if(A[ni][nj] == 'T') continue;
            if(A[ni][nj] == 'D') continue;
            if(dist_bee[ni][nj] != 1e9) continue;
            dist_bee[ni][nj] = dist_bee[u.fi][u.se] + 1;
            q.push({ni, nj});
        }        
    }
    auto ok = [&](ll rest)->bool{
        q.push({bi, bj});
        vv32 dist(n, v32(n, 1e9));
        dist[bi][bj] = 0;
        if(rest >= dist_bee[bi][bj]) return false;
        while(!q.empty()){
            auto u = q.front();
            q.pop();
            FOR(0, 3, i){
                int ni = u.fi + dx[i];
                int nj = u.se + dy[i];
                if(ni < 0) continue;
                if(nj < 0) continue;
                if(ni > n-1) continue;
                if(nj > n-1) continue;
                if(A[ni][nj] == 'T') continue;
                if(dist[ni][nj] != 1e9) continue;
                if((dist[u.fi][u.se] + 1)/s+rest >= dist_bee[ni][nj]) continue;
                if(A[ni][nj] == 'D') return true;
                dist[ni][nj] = dist[u.fi][u.se] + 1;
                q.push({ni, nj});
            }        
        }
        return false;
    };
    int l = 0, r = 1e6, ans = -1;
    while(l <= r){
        ll mid = (l + r) / 2;
        if(ok(mid)){
            ans = mid;
            l = mid + 1;
        }else{
            r = mid - 1;
        }
    }
    cout << ans;
}


int main()
{
    fast_cin();    
    ll t = 1;
    // cin >> t;
    for(int it=1; it<=t; it++)
    {
        //cout << "Case " << it << ": ";
        solve(it);
    }
    return 0;
}

Compilation message

mecho.cpp: In function 'void solve(int)':
mecho.cpp:90:17: warning: variable 'hi' set but not used [-Wunused-but-set-variable]
   90 |     int bi, bj, hi, hj;
      |                 ^~
mecho.cpp:90:21: warning: variable 'hj' set but not used [-Wunused-but-set-variable]
   90 |     int bi, bj, hi, hj;
      |                     ^~
mecho.cpp:135:20: warning: 'bj' may be used uninitialized in this function [-Wmaybe-uninitialized]
  135 |         dist[bi][bj] = 0;
      |                    ^
mecho.cpp:135:16: warning: 'bi' may be used uninitialized in this function [-Wmaybe-uninitialized]
  135 |         dist[bi][bj] = 0;
      |                ^

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	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	452 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	52 ms	6928 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	452 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	856 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	3 ms	1728 KB	Output is correct
34	Correct	4 ms	1676 KB	Output is correct
35	Correct	13 ms	1692 KB	Output is correct
36	Correct	5 ms	1884 KB	Output is correct
37	Correct	5 ms	2140 KB	Output is correct
38	Correct	16 ms	2084 KB	Output is correct
39	Correct	6 ms	2492 KB	Output is correct
40	Correct	6 ms	2492 KB	Output is correct
41	Correct	21 ms	2532 KB	Output is correct
42	Correct	7 ms	3036 KB	Output is correct
43	Correct	7 ms	3036 KB	Output is correct
44	Correct	28 ms	3032 KB	Output is correct
45	Correct	9 ms	3488 KB	Output is correct
46	Correct	9 ms	3484 KB	Output is correct
47	Correct	34 ms	3520 KB	Output is correct
48	Correct	10 ms	4108 KB	Output is correct
49	Correct	11 ms	4132 KB	Output is correct
50	Correct	40 ms	4132 KB	Output is correct
51	Correct	12 ms	4680 KB	Output is correct
52	Correct	13 ms	4688 KB	Output is correct
53	Correct	49 ms	4740 KB	Output is correct
54	Correct	14 ms	5380 KB	Output is correct
55	Correct	14 ms	5364 KB	Output is correct
56	Correct	56 ms	5384 KB	Output is correct
57	Correct	24 ms	6136 KB	Output is correct
58	Correct	16 ms	6136 KB	Output is correct
59	Correct	64 ms	6092 KB	Output is correct
60	Correct	18 ms	6924 KB	Output is correct
61	Correct	21 ms	6952 KB	Output is correct
62	Correct	77 ms	6924 KB	Output is correct
63	Correct	82 ms	6856 KB	Output is correct
64	Correct	126 ms	6872 KB	Output is correct
65	Correct	114 ms	6880 KB	Output is correct
66	Correct	102 ms	6856 KB	Output is correct
67	Correct	80 ms	6872 KB	Output is correct
68	Correct	42 ms	6964 KB	Output is correct
69	Correct	41 ms	6896 KB	Output is correct
70	Correct	40 ms	6892 KB	Output is correct
71	Correct	32 ms	6916 KB	Output is correct
72	Correct	32 ms	6904 KB	Output is correct
73	Correct	30 ms	6928 KB	Output is correct
74	Correct	43 ms	6908 KB	Output is correct
75	Correct	45 ms	6936 KB	Output is correct
76	Correct	42 ms	6916 KB	Output is correct
77	Correct	44 ms	6952 KB	Output is correct
78	Correct	48 ms	6940 KB	Output is correct
79	Correct	40 ms	7108 KB	Output is correct
80	Correct	44 ms	7244 KB	Output is correct
81	Correct	49 ms	6932 KB	Output is correct
82	Correct	39 ms	6932 KB	Output is correct
83	Correct	55 ms	6968 KB	Output is correct
84	Correct	55 ms	6908 KB	Output is correct
85	Correct	51 ms	7060 KB	Output is correct
86	Correct	54 ms	6884 KB	Output is correct
87	Correct	51 ms	6940 KB	Output is correct
88	Correct	56 ms	6940 KB	Output is correct
89	Correct	55 ms	6856 KB	Output is correct
90	Correct	59 ms	6896 KB	Output is correct
91	Correct	58 ms	6916 KB	Output is correct
92	Correct	54 ms	6940 KB	Output is correct