oj.uz

Submission #757226

# Submission time Handle Problem Language Result Execution time Memory
757226 2023-06-12T20:19:18 Z shadow_sami Mecho (IOI09_mecho) C++17
49 / 100
 836 ms 12360 KB 
#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;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 800+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
char c[mx][mx];
queue<pi> q;
ll dx[4] = {1,0,-1,0};
ll dy[4] = {0,1,0,-1};
pi pos,house;
vector<pi> v;
ll vis[mx][mx];
ll vis2[mx][mx];

bool ok(ll x,ll y){
	return (x >= 0 && x < n && y >= 0 && y < n && vis[x][y] == -1 && c[x][y] != 'T');
}

bool ok2(ll x,ll y){
	return (x >= 0 && x < n && y >= 0 && y < n && vis2[x][y] == -1 && c[x][y] != 'T');
}

void emptify(){
	while(q.size())
		q.pop();
	return;
}

bool meow(ll k){
	fip(0,n+2)
		fjp(0,n+2){
			vis2[i][j] = -1;
			vis[i][j] = -1;
		}
	emptify();
	fx(v){
		vis[x.ff][x.ss] = 0;
		q.push({x.ff,x.ss});
	}
	while(q.size()){
		pi x = q.front();
		// debug(x);
		q.pop();
		fip(0,4){
			if(ok(x.ff+dx[i],x.ss+dy[i])){
				vis[x.ff+dx[i]][x.ss+dy[i]] = vis[x.ff][x.ss] + 1;
				q.push({x.ff+dx[i],x.ss+dy[i]});
			}
		}
	}
	emptify();
	q.push(pos);
	if(vis[pos.ff][pos.ss] <= k)
		q.pop();
	while(q.size()){
		auto x = q.front();
		q.pop();
		fip(0,4) 
			if(ok2(x.ff+dx[i],x.ss+dy[i])){
				if(((vis2[x.ff][x.ss] + 1) / m) + k >= vis[x.ff+dx[i]][x.ss+dy[i]])
					continue;
				vis2[x.ff+dx[i]][x.ss+dy[i]] = (vis2[x.ff][x.ss] + 1) ;
				q.push({x.ff+dx[i],x.ss+dy[i]});
			}
	}
	// fip(0,n){
	// 	fjp(0,n){
	// 		cout<<vis[i][j];
	// 	}
	// 	cout<<nli;
	// }
	fip(0,n)
		fjp(0,n){
			if(-1 != vis2[i][j])
				vis2[i][j]/=m;
		}
	// fip(0,n){
	// 	fjp(0,n){
	// 		cout<<vis2[i][j];
	// 	}
	// 	cout<<nli;
	// }
	f = 0;
	fip(0,4)
		if(house.ff + dx[i] >= 0 && house.ff + dx[i] < n && house.ss + dy[i] >= 0 && house.ss + dy[i] < n && c[house.ff+dx[i]][house.ss+dy[i]] != 'T'){
			if(vis2[house.ff+dx[i]][house.ss+dy[i]] != -1 && vis2[house.ff + dx[i]][house.ss + dy[i]] + k < vis[house.ff + dx[i]][house.ss + dy[i]]){				
				f = 1;
			}
		}	
	return f;
}

ll l,r,mid;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        ans = -1;        
        fip(0,n)
        	fjp(0,n){
        		cin>>c[i][j];
        		if(c[i][j]=='H')
        			v.push_back({i,j});
        		else if(c[i][j]=='M')
        			pos = {i,j};
        		else if(c[i][j]=='D')
        			house = {i,j};
        	}
        // cout<<meow(3)<<nli;
        l = 0,r = 1e9;
        while(l<=r){
        	mid = l + (r-l)/2;
        	if(meow(mid)){
        		ans = mid;
        		l = mid + 1;
        	}else
        		r = mid - 1;
        }
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
49.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 628 ms 11920 KB Output is correct
8 Incorrect 1 ms 468 KB Output isn't correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Incorrect 2 ms 852 KB Output isn't correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 4 ms 848 KB Output is correct
15 Incorrect 1 ms 468 KB Output isn't correct
16 Correct 1 ms 468 KB Output is correct
17 Incorrect 2 ms 592 KB Output isn't correct
18 Correct 1 ms 596 KB Output is correct
19 Incorrect 2 ms 596 KB Output isn't correct
20 Correct 1 ms 596 KB Output is correct
21 Incorrect 2 ms 724 KB Output isn't correct
22 Correct 2 ms 724 KB Output is correct
23 Incorrect 2 ms 852 KB Output isn't correct
24 Correct 3 ms 852 KB Output is correct
25 Incorrect 2 ms 848 KB Output isn't correct
26 Correct 2 ms 852 KB Output is correct
27 Incorrect 3 ms 980 KB Output isn't correct
28 Correct 3 ms 980 KB Output is correct
29 Incorrect 3 ms 980 KB Output isn't correct
30 Correct 3 ms 976 KB Output is correct
31 Incorrect 3 ms 1108 KB Output isn't correct
32 Correct 3 ms 1112 KB Output is correct
33 Incorrect 63 ms 5148 KB Output isn't correct
34 Correct 48 ms 5076 KB Output is correct
35 Correct 87 ms 5076 KB Output is correct
36 Incorrect 64 ms 5860 KB Output isn't correct
37 Correct 61 ms 5864 KB Output is correct
38 Correct 129 ms 5868 KB Output is correct
39 Incorrect 124 ms 6572 KB Output isn't correct
40 Correct 76 ms 6484 KB Output is correct
41 Correct 150 ms 6484 KB Output is correct
42 Incorrect 103 ms 7252 KB Output isn't correct
43 Correct 96 ms 7304 KB Output is correct
44 Correct 179 ms 7296 KB Output is correct
45 Incorrect 133 ms 8020 KB Output isn't correct
46 Correct 139 ms 8020 KB Output is correct
47 Correct 246 ms 8136 KB Output is correct
48 Incorrect 155 ms 8736 KB Output isn't correct
49 Correct 135 ms 8660 KB Output is correct
50 Correct 280 ms 8768 KB Output is correct
51 Incorrect 199 ms 9464 KB Output isn't correct
52 Correct 176 ms 9460 KB Output is correct
53 Correct 366 ms 9488 KB Output is correct
54 Incorrect 219 ms 10196 KB Output isn't correct
55 Correct 211 ms 10200 KB Output is correct
56 Correct 450 ms 10212 KB Output is correct
57 Incorrect 239 ms 10944 KB Output isn't correct
58 Correct 216 ms 10956 KB Output is correct
59 Correct 595 ms 10916 KB Output is correct
60 Incorrect 304 ms 11684 KB Output isn't correct
61 Correct 297 ms 11692 KB Output is correct
62 Correct 699 ms 11704 KB Output is correct
63 Correct 706 ms 11696 KB Output is correct
64 Correct 773 ms 11704 KB Output is correct
65 Correct 797 ms 11728 KB Output is correct
66 Incorrect 760 ms 11704 KB Output isn't correct
67 Correct 724 ms 11704 KB Output is correct
68 Correct 776 ms 11756 KB Output is correct
69 Correct 802 ms 11756 KB Output is correct
70 Correct 735 ms 11756 KB Output is correct
71 Correct 758 ms 11760 KB Output is correct
72 Correct 753 ms 11756 KB Output is correct
73 Correct 820 ms 12296 KB Output is correct
74 Correct 808 ms 12296 KB Output is correct
75 Correct 781 ms 12292 KB Output is correct
76 Correct 650 ms 12300 KB Output is correct
77 Correct 770 ms 12284 KB Output is correct
78 Correct 716 ms 12228 KB Output is correct
79 Correct 710 ms 12228 KB Output is correct
80 Correct 734 ms 12264 KB Output is correct
81 Correct 836 ms 12224 KB Output is correct
82 Correct 709 ms 12360 KB Output is correct
83 Correct 803 ms 12136 KB Output is correct
84 Correct 800 ms 12148 KB Output is correct
85 Correct 804 ms 12140 KB Output is correct
86 Correct 725 ms 12148 KB Output is correct
87 Correct 711 ms 12160 KB Output is correct
88 Correct 691 ms 12032 KB Output is correct
89 Correct 708 ms 12028 KB Output is correct
90 Correct 795 ms 12028 KB Output is correct
91 Correct 684 ms 12024 KB Output is correct
92 Correct 772 ms 12024 KB Output is correct