답안 #762817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762817	2023-06-21T19:54:36 Z	bLIC	Mecho (IOI09_mecho)	C++17	100 / 100	192 ms	11456 KB

mecho

/**
 *  Author: Anil Byar
**/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully

const int maxN = 1;
const int maxK = 8001;

int dx[] = {1, 0, 0, -1};
int dy[] = {0, 1, -1, 0};

void solve(){
    ll n, s;cin>>n>>s;
    vector<string> grid(n);
    for (int i = 0;i<n;i++) cin>>grid[i];

    vvl beetime(n, vl(n, INFLL));
    queue<pii> q;
    for (int i = 0;i<n;i++) for (int j = 0;j<n;j++) if (grid[i][j]=='H') {
        q.emplace(i, j);
        beetime[i][j] = 0;
    }
    while(!q.empty()){
        auto [x, y] = q.front();q.pop();
        ll tim = beetime[x][y] + s;
        for (int i = 0;i<4;i++){
            int xx = x+dx[i];
            int yy = y+dy[i];
            if (xx<0 || xx>=n || yy<0 || yy>=n || tim>=beetime[xx][yy] || grid[xx][yy]=='T' || grid[xx][yy]=='D'){
                continue;
            }
            beetime[xx][yy] = tim;
            q.emplace(xx, yy);
        }
    }
    int mx, my;

    int fx, fy;
    for (int i = 0;i<n;i++){
        for (int j = 0;j<n;j++){
            if (grid[i][j]=='M'){
                mx = i, my = j;
            } else if (grid[i][j]=='D') fx=i, fy = j;
        }
    }
    auto check = [&](ll m){
        vvl mtim(n, vl(n, INF));
        queue<array<ll, 2>> qq;
        vector<vector<bool>> poss(n, vector<bool>(n, false));
        qq.push({mx, my});
        mtim[mx][my] = m*s;
        if (mtim[mx][my]>=beetime[mx][my]) return false;
        while(!qq.empty()){
            auto [x, y] = qq.front();qq.pop();
            poss[x][y] = true;
            ll tim = mtim[x][y]+1;

            for (int i = 0;i<4;i++){
                int xx = x+dx[i];
                int yy = y+dy[i];
                if (xx<0 || yy<0 || xx>=n || yy>=n || grid[xx][yy]=='T' || tim>=beetime[xx][yy] || tim>=mtim[xx][yy]){
                    continue;
                }
                mtim[xx][yy] = tim;
                qq.push({xx, yy});
            }
        }
        if (poss[fx][fy]) return true;

        // mtim.assign(n, vi(n, INF));
        // mtim[fx][fy] = 0;

        // while(!q.empty()) q.pop();
        // q.emplace(fx, fy);
    
        // while(!q.empty()){
        //     auto [x, y] = q.front();q.pop();
        //     if (poss[x][y]) return true;

        //     int tim = mtim[x][y] + 1;
        //     for (int i = 0;i<4;i++){
        //         int xx = x+dx[i];
        //         int yy = y+dy[i];
        //         if (xx<0 || xx>=n || yy<0 || yy>=n || grid[xx][yy]=='T' || tim>=mtim[xx][yy]  || tim>s){
        //             continue;
        //         }
        //         mtim[xx][yy] = tim;
        //         q.emplace(xx, yy);
        //     }
        // }
        
        return false;
    };

    int l = -1, r = INF;
    while(r-l>1){
        int mid = (l+r)/2;
        if (check(mid)) l = mid;
        else r = mid;
        // cout<<l<<" "<<r<<endl;
    } 
    cout<<l;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
    freopen("debug.dbg", "w", stderr);
    int tt = clock();
#endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifndef ONLINE_JUDGE
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:208:14: warning: unused variable 'i' [-Wunused-variable]
  208 |     int t=1, i = 1;
      |              ^
mecho.cpp: In function 'void solve()':
mecho.cpp:157:20: warning: 'fx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  157 |         if (poss[fx][fy]) return true;
      |                    ^
mecho.cpp:140:20: warning: 'my' may be used uninitialized in this function [-Wmaybe-uninitialized]
  140 |         mtim[mx][my] = m*s;
      |                    ^
mecho.cpp:140:16: warning: 'mx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  140 |         mtim[mx][my] = m*s;
      |                ^

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	100 ms	11360 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	372 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	7 ms	2428 KB	Output is correct
34	Correct	8 ms	2500 KB	Output is correct
35	Correct	21 ms	2444 KB	Output is correct
36	Correct	8 ms	3092 KB	Output is correct
37	Correct	9 ms	3072 KB	Output is correct
38	Correct	28 ms	3132 KB	Output is correct
39	Correct	11 ms	3836 KB	Output is correct
40	Correct	11 ms	3840 KB	Output is correct
41	Correct	35 ms	3804 KB	Output is correct
42	Correct	13 ms	4620 KB	Output is correct
43	Correct	15 ms	4624 KB	Output is correct
44	Correct	50 ms	4676 KB	Output is correct
45	Correct	15 ms	5516 KB	Output is correct
46	Correct	15 ms	5532 KB	Output is correct
47	Correct	55 ms	5552 KB	Output is correct
48	Correct	22 ms	6544 KB	Output is correct
49	Correct	19 ms	6520 KB	Output is correct
50	Correct	69 ms	6532 KB	Output is correct
51	Correct	20 ms	7636 KB	Output is correct
52	Correct	26 ms	7760 KB	Output is correct
53	Correct	79 ms	7620 KB	Output is correct
54	Correct	33 ms	8708 KB	Output is correct
55	Correct	28 ms	8724 KB	Output is correct
56	Correct	100 ms	8820 KB	Output is correct
57	Correct	25 ms	9952 KB	Output is correct
58	Correct	27 ms	9976 KB	Output is correct
59	Correct	109 ms	10000 KB	Output is correct
60	Correct	31 ms	11260 KB	Output is correct
61	Correct	35 ms	11344 KB	Output is correct
62	Correct	126 ms	11368 KB	Output is correct
63	Correct	112 ms	11376 KB	Output is correct
64	Correct	168 ms	11324 KB	Output is correct
65	Correct	192 ms	11328 KB	Output is correct
66	Correct	131 ms	11360 KB	Output is correct
67	Correct	108 ms	11412 KB	Output is correct
68	Correct	79 ms	11312 KB	Output is correct
69	Correct	75 ms	11344 KB	Output is correct
70	Correct	58 ms	11348 KB	Output is correct
71	Correct	64 ms	11308 KB	Output is correct
72	Correct	59 ms	11424 KB	Output is correct
73	Correct	66 ms	11348 KB	Output is correct
74	Correct	73 ms	11380 KB	Output is correct
75	Correct	78 ms	11428 KB	Output is correct
76	Correct	78 ms	11420 KB	Output is correct
77	Correct	79 ms	11360 KB	Output is correct
78	Correct	83 ms	11360 KB	Output is correct
79	Correct	72 ms	11380 KB	Output is correct
80	Correct	79 ms	11436 KB	Output is correct
81	Correct	86 ms	11328 KB	Output is correct
82	Correct	72 ms	11336 KB	Output is correct
83	Correct	88 ms	11292 KB	Output is correct
84	Correct	85 ms	11320 KB	Output is correct
85	Correct	81 ms	11328 KB	Output is correct
86	Correct	95 ms	11456 KB	Output is correct
87	Correct	97 ms	11400 KB	Output is correct
88	Correct	94 ms	11440 KB	Output is correct
89	Correct	98 ms	11456 KB	Output is correct
90	Correct	117 ms	11420 KB	Output is correct
91	Correct	95 ms	11416 KB	Output is correct
92	Correct	92 ms	11392 KB	Output is correct