답안 #762816

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762816	2023-06-21T19:53:52 Z	bLIC	Mecho (IOI09_mecho)	C++17	0 / 100	174 ms	11444 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

0.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	212 KB	Output isn't correct
2	Incorrect	0 ms	212 KB	Output isn't correct
3	Incorrect	0 ms	212 KB	Output isn't correct
4	Incorrect	0 ms	212 KB	Output isn't correct
5	Incorrect	0 ms	212 KB	Output isn't correct
6	Incorrect	0 ms	212 KB	Output isn't correct
7	Incorrect	101 ms	11352 KB	Output isn't correct
8	Incorrect	0 ms	212 KB	Output isn't correct
9	Incorrect	0 ms	212 KB	Output isn't correct
10	Incorrect	0 ms	212 KB	Output isn't correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Incorrect	1 ms	340 KB	Output isn't correct
13	Incorrect	1 ms	340 KB	Output isn't correct
14	Incorrect	1 ms	340 KB	Output isn't correct
15	Incorrect	0 ms	212 KB	Output isn't correct
16	Incorrect	0 ms	212 KB	Output isn't correct
17	Incorrect	1 ms	212 KB	Output isn't correct
18	Incorrect	1 ms	212 KB	Output isn't correct
19	Incorrect	1 ms	212 KB	Output isn't correct
20	Incorrect	0 ms	212 KB	Output isn't correct
21	Incorrect	1 ms	340 KB	Output isn't correct
22	Incorrect	1 ms	340 KB	Output isn't correct
23	Incorrect	1 ms	340 KB	Output isn't correct
24	Incorrect	1 ms	340 KB	Output isn't correct
25	Incorrect	1 ms	340 KB	Output isn't correct
26	Incorrect	1 ms	340 KB	Output isn't correct
27	Incorrect	1 ms	340 KB	Output isn't correct
28	Incorrect	1 ms	340 KB	Output isn't correct
29	Incorrect	1 ms	340 KB	Output isn't correct
30	Incorrect	1 ms	340 KB	Output isn't correct
31	Incorrect	1 ms	340 KB	Output isn't correct
32	Incorrect	1 ms	340 KB	Output isn't correct
33	Incorrect	7 ms	2428 KB	Output isn't correct
34	Incorrect	8 ms	2480 KB	Output isn't correct
35	Incorrect	22 ms	2512 KB	Output isn't correct
36	Incorrect	9 ms	3092 KB	Output isn't correct
37	Incorrect	9 ms	3028 KB	Output isn't correct
38	Incorrect	28 ms	3172 KB	Output isn't correct
39	Incorrect	10 ms	3840 KB	Output isn't correct
40	Incorrect	11 ms	3796 KB	Output isn't correct
41	Incorrect	35 ms	3812 KB	Output isn't correct
42	Incorrect	13 ms	4640 KB	Output isn't correct
43	Incorrect	13 ms	4640 KB	Output isn't correct
44	Incorrect	46 ms	4660 KB	Output isn't correct
45	Incorrect	15 ms	5528 KB	Output isn't correct
46	Incorrect	16 ms	5508 KB	Output isn't correct
47	Incorrect	57 ms	5544 KB	Output isn't correct
48	Incorrect	18 ms	6512 KB	Output isn't correct
49	Incorrect	19 ms	6520 KB	Output isn't correct
50	Incorrect	67 ms	6644 KB	Output isn't correct
51	Incorrect	22 ms	7572 KB	Output isn't correct
52	Incorrect	23 ms	7568 KB	Output isn't correct
53	Incorrect	79 ms	7620 KB	Output isn't correct
54	Incorrect	32 ms	8756 KB	Output isn't correct
55	Incorrect	28 ms	8748 KB	Output isn't correct
56	Incorrect	94 ms	8800 KB	Output isn't correct
57	Incorrect	26 ms	9972 KB	Output isn't correct
58	Incorrect	27 ms	10000 KB	Output isn't correct
59	Incorrect	123 ms	10052 KB	Output isn't correct
60	Incorrect	30 ms	11332 KB	Output isn't correct
61	Incorrect	32 ms	11284 KB	Output isn't correct
62	Incorrect	145 ms	11420 KB	Output isn't correct
63	Incorrect	112 ms	11316 KB	Output isn't correct
64	Incorrect	174 ms	11300 KB	Output isn't correct
65	Incorrect	164 ms	11376 KB	Output isn't correct
66	Incorrect	130 ms	11348 KB	Output isn't correct
67	Incorrect	111 ms	11312 KB	Output isn't correct
68	Incorrect	75 ms	11292 KB	Output isn't correct
69	Incorrect	72 ms	11356 KB	Output isn't correct
70	Incorrect	59 ms	11348 KB	Output isn't correct
71	Incorrect	63 ms	11400 KB	Output isn't correct
72	Incorrect	58 ms	11376 KB	Output isn't correct
73	Incorrect	63 ms	11392 KB	Output isn't correct
74	Incorrect	89 ms	11288 KB	Output isn't correct
75	Incorrect	80 ms	11368 KB	Output isn't correct
76	Incorrect	75 ms	11412 KB	Output isn't correct
77	Incorrect	77 ms	11444 KB	Output isn't correct
78	Incorrect	89 ms	11424 KB	Output isn't correct
79	Incorrect	72 ms	11332 KB	Output isn't correct
80	Incorrect	76 ms	11324 KB	Output isn't correct
81	Incorrect	85 ms	11404 KB	Output isn't correct
82	Incorrect	79 ms	11364 KB	Output isn't correct
83	Incorrect	90 ms	11388 KB	Output isn't correct
84	Incorrect	104 ms	11296 KB	Output isn't correct
85	Incorrect	113 ms	11304 KB	Output isn't correct
86	Incorrect	90 ms	11404 KB	Output isn't correct
87	Incorrect	87 ms	11444 KB	Output isn't correct
88	Incorrect	93 ms	11376 KB	Output isn't correct
89	Incorrect	106 ms	11356 KB	Output isn't correct
90	Incorrect	99 ms	11444 KB	Output isn't correct
91	Incorrect	91 ms	11364 KB	Output isn't correct
92	Incorrect	93 ms	11304 KB	Output isn't correct