oj.uz

Submission #947338

# Submission time Handle Problem Language Result Execution time Memory
947338 2024-03-15T22:26:57 Z narsuk Mecho (IOI09_mecho) C++17
79 / 100
 697 ms 9684 KB 
#include <bits/stdc++.h>
using namespace std;
//
#define ll long long int
 
#define endl "\n"; 
 
const int maxn = 801;

// array<int,n>
// pq 


int n,st;

pair<int,int>mv[4]={ {0,1},{0,-1} , {1,0}, {-1,0} };

char g[maxn][maxn];
char g1[maxn][maxn];
char g2[maxn][maxn];

bool val(int x , int y){
	if(x<0 || x>=n || y<0 || y>=n || g[x][y]=='T' )return 0;
	return 1;
}
 

int xc,yc;
int xcc;
int ycc;
int beetime[maxn][maxn];

void bbfs(){
	int vis[n][n];
	queue<pair<pair<int,int>,int>>q;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			beetime[i][j]=INT_MAX;
			if(g1[i][j]=='H'){
				q.push({{i,j},0}); 
			}
			vis[i][j]=0;
		}
	}
	while(!q.empty()){
		pair<int,int>cur;
		cur=q.front().first;
		int dt = q.front().second;
		q.pop();
		if(vis[cur.first][cur.second])continue;
		vis[cur.first][cur.second]=1;

		if(g1[cur.first][cur.second]=='D' || g1[cur.first][cur.second]=='T'){
			continue;
		} 
		beetime[cur.first][cur.second]=dt;
		// cout<<cur.first<<" "<<cur.second<<endl;
		for(auto ele : mv){
			int xx = cur.first+ele.first;
			int yy = cur.second+ele.second;
			if(val(xx,yy)){
				q.push({{xx,yy},dt+1});
			}
		}
	}

}




// int mbfs(int x){
bool tme(int marc , int bee){
	int ccur = marc/st;
	// if(ccur*st!=marc){
	// 	return (marc/st)-1<bee;
	// }
	return marc/st <bee;
}

 

bool check(int x){

	bbfs();


	queue<pair<pair<int,int>,int>>q;
	bool vis[n][n];
	int dist[n][n];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			vis[i][j]=0;
			dist[i][j]=INT_MAX;
		}
	}

	q.push({{xc,yc},0});
	if(beetime[xc][yc]<=x)q.pop();
	while(!q.empty()){
		pair<int,int>cur=q.front().first;
		int dt = q.front().second;
		dist[cur.first][cur.second]=dt;
		q.pop();
		if(vis[cur.first][cur.second])continue;
		vis[cur.first][cur.second]=1;
		if(g[cur.first][cur.second]=='D'){
			return 1;
		}

		for(auto ele :mv){
			int xx = cur.first+ele.first;
			int yy = cur.second+ele.second;

			if(val(xx,yy) && !vis[xx][yy] && tme(dt+1 , beetime[xx][yy]-x) && g[xx][yy]!='H'){
				q.push({{xx,yy} , dt+1});
			}
		}

	}
	// for(int i=0;i<n;i++){
	// 	for(int j=0;j<n;j++){
	// 		cout<<vis[i][j]<<" ";
	// 	}
	// 	cout<<endl;
	// }

	for(auto ele : mv){
		int xx = xcc+ele.first;
		int yy = ycc+ele.second;

		if(val(xx,yy) && vis[xx][yy]==1 && tme(dist[xx][yy] ,beetime[xx][yy]-x)){
		// cout<<xx<<" "<<yy<<endl;
			return 1;
		}
	}

	return 0;
}

void solu(){
	cin>>n>>st;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cin>>g[i][j];
			g1[i][j]=g[i][j];
			if(g[i][j]=='M'){
				xc=i;
				yc=j;
			}
			if(g[i][j]=='D'){
				xcc = i;
				ycc = j;
			}
		}
	}
	// cout<<endl;
	int l=0;
	int r = n*n;
	int ans=0;
	while(l<r){
		int mid = l + (r-l+1)/2;
		// cout<<mid<<endl;
		if(check(mid)){
			ans=max(mid,ans);
			l=mid;
		}else{
			r=mid-1;
		}
	}
	// cout<<check(2)<<endl;
	if(ans==0){
		cout<<"-1"<<endl;
		return;
	}
	cout<<ans<<endl;


}
int main(){
		// ios_base::sync_with_stdio(0);
		// cin.tie(0);
		// int cass;
		// cin>>cass; 
		// for(int i=0;i<cass;i++)
		solu();
    return 0;
}

Compilation message

mecho.cpp: In function 'bool tme(int, int)':
mecho.cpp:74:6: warning: unused variable 'ccur' [-Wunused-variable]
   74 |  int ccur = marc/st;
      |      ^~~~

Subtask #1
79.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Incorrect 0 ms 2396 KB Output isn't correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 615 ms 8672 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Incorrect 2 ms 2652 KB Output isn't correct
14 Correct 3 ms 4700 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 2 ms 4732 KB Output is correct
27 Correct 2 ms 4700 KB Output is correct
28 Correct 2 ms 4856 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 30 ms 5212 KB Output is correct
34 Correct 27 ms 5212 KB Output is correct
35 Correct 69 ms 5308 KB Output is correct
36 Correct 38 ms 5464 KB Output is correct
37 Correct 42 ms 5648 KB Output is correct
38 Correct 96 ms 5468 KB Output is correct
39 Correct 48 ms 5468 KB Output is correct
40 Correct 48 ms 5464 KB Output is correct
41 Correct 123 ms 5720 KB Output is correct
42 Correct 67 ms 5820 KB Output is correct
43 Correct 62 ms 5908 KB Output is correct
44 Correct 164 ms 5936 KB Output is correct
45 Correct 79 ms 5980 KB Output is correct
46 Correct 74 ms 5976 KB Output is correct
47 Correct 184 ms 5972 KB Output is correct
48 Correct 89 ms 6452 KB Output is correct
49 Correct 88 ms 6236 KB Output is correct
50 Correct 234 ms 6496 KB Output is correct
51 Correct 108 ms 6748 KB Output is correct
52 Correct 106 ms 6744 KB Output is correct
53 Correct 282 ms 6992 KB Output is correct
54 Correct 128 ms 7004 KB Output is correct
55 Correct 121 ms 7000 KB Output is correct
56 Correct 323 ms 7160 KB Output is correct
57 Correct 168 ms 7504 KB Output is correct
58 Correct 141 ms 7516 KB Output is correct
59 Correct 389 ms 7560 KB Output is correct
60 Correct 166 ms 7936 KB Output is correct
61 Correct 180 ms 7908 KB Output is correct
62 Correct 441 ms 7976 KB Output is correct
63 Incorrect 414 ms 7764 KB Output isn't correct
64 Correct 542 ms 8016 KB Output is correct
65 Correct 453 ms 7944 KB Output is correct
66 Correct 443 ms 7948 KB Output is correct
67 Correct 437 ms 7952 KB Output is correct
68 Incorrect 425 ms 8020 KB Output isn't correct
69 Correct 417 ms 8220 KB Output is correct
70 Correct 445 ms 8288 KB Output is correct
71 Correct 439 ms 8028 KB Output is correct
72 Correct 413 ms 8028 KB Output is correct
73 Correct 616 ms 9600 KB Output is correct
74 Correct 594 ms 9576 KB Output is correct
75 Correct 642 ms 9684 KB Output is correct
76 Correct 641 ms 9624 KB Output is correct
77 Correct 665 ms 9588 KB Output is correct
78 Correct 574 ms 9408 KB Output is correct
79 Correct 569 ms 9664 KB Output is correct
80 Correct 568 ms 9496 KB Output is correct
81 Correct 573 ms 9408 KB Output is correct
82 Correct 574 ms 9628 KB Output is correct
83 Incorrect 573 ms 9356 KB Output isn't correct
84 Correct 632 ms 9440 KB Output is correct
85 Correct 637 ms 9160 KB Output is correct
86 Correct 697 ms 9136 KB Output is correct
87 Correct 604 ms 9208 KB Output is correct
88 Incorrect 672 ms 9000 KB Output isn't correct
89 Correct 695 ms 8904 KB Output is correct
90 Correct 685 ms 8900 KB Output is correct
91 Correct 616 ms 8904 KB Output is correct
92 Correct 653 ms 8904 KB Output is correct