답안 #762763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762763	2023-06-21T18:24:44 Z	bLIC	Mecho (IOI09_mecho)	C++17	38 / 100	175 ms	6984 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(){
    int n, s;cin>>n>>s;
    vector<string> grid(n);
    for (int i = 0;i<n;i++) cin>>grid[i];

    vvi beetime(n, vi(n, INF));
    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();
        int tim = beetime[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 || tim>=beetime[xx][yy] || grid[xx][yy]=='T' || grid[xx][yy]=='D'){
                continue;
            }
            beetime[xx][yy] = tim;
            q.emplace(xx, yy);
        }
    }

    auto check = [&](int m){
        vvi mtim(n, vi(n, INF));
        queue<array<int, 3>> qq;
        int fx, fy;
        for (int i = 0;i<n;i++){
            for (int j = 0;j<n;j++){
                if (grid[i][j]=='M'){
                    qq.push({i, j, 0});
                    mtim[i][j] = m;
                } else if (grid[i][j]=='D') fx=i, fy = j;
            }
        }
        vector<vector<bool>> poss(n, vector<bool>(n, false));

        while(!qq.empty()){
            auto [x, y, step] = qq.front();qq.pop();
            poss[x][y] = true;
            step++;
            int tim = mtim[x][y];
            if (step==1) tim++;
            if (step==s) step = 0;
            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, step});
            }
        }
        if (poss[fx][fy]) return true;

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

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

            int tim = beetime[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;
}

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:205:14: warning: unused variable 'i' [-Wunused-variable]
  205 |     int t=1, i = 1;
      |              ^

Subtask #1

38.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	324 KB	Output isn't correct
2	Incorrect	1 ms	320 KB	Output isn't correct
3	Incorrect	1 ms	280 KB	Output isn't correct
4	Incorrect	0 ms	212 KB	Output isn't correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	99 ms	6968 KB	Output is correct
8	Incorrect	1 ms	212 KB	Output isn't correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Incorrect	1 ms	340 KB	Output isn't correct
13	Incorrect	1 ms	340 KB	Output isn't correct
14	Correct	1 ms	340 KB	Output is correct
15	Incorrect	1 ms	320 KB	Output isn't correct
16	Correct	1 ms	212 KB	Output is correct
17	Incorrect	1 ms	316 KB	Output isn't correct
18	Correct	1 ms	212 KB	Output is correct
19	Incorrect	1 ms	212 KB	Output isn't correct
20	Correct	1 ms	212 KB	Output is correct
21	Incorrect	1 ms	340 KB	Output isn't correct
22	Correct	1 ms	320 KB	Output is correct
23	Incorrect	1 ms	340 KB	Output isn't correct
24	Correct	1 ms	340 KB	Output is correct
25	Incorrect	1 ms	340 KB	Output isn't correct
26	Correct	1 ms	340 KB	Output is correct
27	Incorrect	1 ms	340 KB	Output isn't correct
28	Correct	1 ms	324 KB	Output is correct
29	Incorrect	1 ms	324 KB	Output isn't correct
30	Correct	2 ms	340 KB	Output is correct
31	Incorrect	1 ms	340 KB	Output isn't correct
32	Correct	1 ms	324 KB	Output is correct
33	Incorrect	11 ms	1592 KB	Output isn't correct
34	Correct	10 ms	1592 KB	Output is correct
35	Correct	25 ms	1596 KB	Output is correct
36	Incorrect	11 ms	2040 KB	Output isn't correct
37	Correct	11 ms	1980 KB	Output is correct
38	Correct	29 ms	1980 KB	Output is correct
39	Incorrect	14 ms	2408 KB	Output isn't correct
40	Correct	14 ms	2404 KB	Output is correct
41	Correct	39 ms	2404 KB	Output is correct
42	Incorrect	16 ms	2932 KB	Output isn't correct
43	Correct	16 ms	2932 KB	Output is correct
44	Correct	49 ms	2896 KB	Output is correct
45	Incorrect	27 ms	3488 KB	Output isn't correct
46	Correct	20 ms	3468 KB	Output is correct
47	Correct	59 ms	3484 KB	Output is correct
48	Incorrect	23 ms	4028 KB	Output isn't correct
49	Correct	24 ms	4064 KB	Output is correct
50	Correct	80 ms	4104 KB	Output is correct
51	Incorrect	27 ms	4668 KB	Output isn't correct
52	Correct	28 ms	4660 KB	Output is correct
53	Correct	85 ms	4716 KB	Output is correct
54	Incorrect	33 ms	5328 KB	Output isn't correct
55	Correct	34 ms	5332 KB	Output is correct
56	Correct	96 ms	5392 KB	Output is correct
57	Incorrect	43 ms	6072 KB	Output isn't correct
58	Correct	36 ms	6056 KB	Output is correct
59	Correct	119 ms	6092 KB	Output is correct
60	Incorrect	42 ms	6864 KB	Output isn't correct
61	Correct	40 ms	6912 KB	Output is correct
62	Correct	130 ms	6896 KB	Output is correct
63	Correct	123 ms	6868 KB	Output is correct
64	Correct	175 ms	6892 KB	Output is correct
65	Correct	168 ms	6928 KB	Output is correct
66	Incorrect	122 ms	6928 KB	Output isn't correct
67	Correct	130 ms	6860 KB	Output is correct
68	Correct	68 ms	6868 KB	Output is correct
69	Correct	67 ms	6892 KB	Output is correct
70	Correct	55 ms	6932 KB	Output is correct
71	Correct	58 ms	6876 KB	Output is correct
72	Incorrect	66 ms	6888 KB	Output isn't correct
73	Incorrect	57 ms	6932 KB	Output isn't correct
74	Correct	77 ms	6832 KB	Output is correct
75	Correct	83 ms	6912 KB	Output is correct
76	Correct	77 ms	6892 KB	Output is correct
77	Correct	94 ms	6892 KB	Output is correct
78	Correct	103 ms	6872 KB	Output is correct
79	Correct	84 ms	6920 KB	Output is correct
80	Correct	83 ms	6912 KB	Output is correct
81	Correct	88 ms	6908 KB	Output is correct
82	Correct	81 ms	6880 KB	Output is correct
83	Correct	92 ms	6892 KB	Output is correct
84	Correct	85 ms	6896 KB	Output is correct
85	Correct	84 ms	6908 KB	Output is correct
86	Correct	90 ms	6984 KB	Output is correct
87	Correct	88 ms	6892 KB	Output is correct
88	Correct	121 ms	6856 KB	Output is correct
89	Correct	92 ms	6892 KB	Output is correct
90	Correct	96 ms	6876 KB	Output is correct
91	Correct	94 ms	6876 KB	Output is correct
92	Correct	126 ms	6932 KB	Output is correct