oj.uz

답안 #947340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947340 2024-03-15T22:28:26 Z narsuk Mecho (IOI09_mecho) C++17
79 / 100
 736 ms 10068 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=-1;
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Incorrect 0 ms 2396 KB Output isn't correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 603 ms 8568 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2648 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 2648 KB Output isn't correct
14 Correct 3 ms 4696 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 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 1 ms 2496 KB Output is correct
24 Correct 1 ms 2648 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 2 ms 4700 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4700 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 35 ms 5396 KB Output is correct
34 Correct 30 ms 5208 KB Output is correct
35 Correct 78 ms 5388 KB Output is correct
36 Correct 41 ms 5468 KB Output is correct
37 Correct 41 ms 5468 KB Output is correct
38 Correct 96 ms 5468 KB Output is correct
39 Correct 51 ms 5724 KB Output is correct
40 Correct 53 ms 5836 KB Output is correct
41 Correct 149 ms 5864 KB Output is correct
42 Correct 67 ms 6096 KB Output is correct
43 Correct 62 ms 6104 KB Output is correct
44 Correct 154 ms 5980 KB Output is correct
45 Correct 82 ms 6368 KB Output is correct
46 Correct 77 ms 6284 KB Output is correct
47 Correct 184 ms 6432 KB Output is correct
48 Correct 109 ms 6692 KB Output is correct
49 Correct 92 ms 6492 KB Output is correct
50 Correct 233 ms 6684 KB Output is correct
51 Correct 109 ms 7072 KB Output is correct
52 Correct 138 ms 6884 KB Output is correct
53 Correct 295 ms 7116 KB Output is correct
54 Correct 135 ms 7408 KB Output is correct
55 Correct 126 ms 7268 KB Output is correct
56 Correct 349 ms 7488 KB Output is correct
57 Correct 152 ms 7816 KB Output is correct
58 Correct 155 ms 7868 KB Output is correct
59 Correct 409 ms 7916 KB Output is correct
60 Correct 177 ms 8276 KB Output is correct
61 Correct 171 ms 8156 KB Output is correct
62 Correct 483 ms 8388 KB Output is correct
63 Incorrect 440 ms 8348 KB Output isn't correct
64 Correct 551 ms 8320 KB Output is correct
65 Correct 494 ms 8384 KB Output is correct
66 Correct 455 ms 8212 KB Output is correct
67 Correct 447 ms 8268 KB Output is correct
68 Incorrect 447 ms 8460 KB Output isn't correct
69 Correct 423 ms 8388 KB Output is correct
70 Correct 508 ms 8464 KB Output is correct
71 Correct 475 ms 8460 KB Output is correct
72 Correct 424 ms 8276 KB Output is correct
73 Correct 642 ms 10068 KB Output is correct
74 Correct 617 ms 10068 KB Output is correct
75 Correct 687 ms 10048 KB Output is correct
76 Correct 736 ms 9932 KB Output is correct
77 Correct 688 ms 10036 KB Output is correct
78 Correct 592 ms 9812 KB Output is correct
79 Correct 568 ms 9832 KB Output is correct
80 Correct 611 ms 9948 KB Output is correct
81 Correct 570 ms 9792 KB Output is correct
82 Correct 567 ms 9832 KB Output is correct
83 Incorrect 594 ms 9572 KB Output isn't correct
84 Correct 623 ms 9420 KB Output is correct
85 Correct 622 ms 9556 KB Output is correct
86 Correct 620 ms 9520 KB Output is correct
87 Correct 578 ms 9556 KB Output is correct
88 Incorrect 604 ms 9492 KB Output isn't correct
89 Correct 644 ms 9320 KB Output is correct
90 Correct 614 ms 9296 KB Output is correct
91 Correct 673 ms 9320 KB Output is correct
92 Correct 582 ms 9348 KB Output is correct