oj.uz

답안 #947236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947236 2024-03-15T18:20:02 Z narsuk Mecho (IOI09_mecho) C++17
47 / 100
 242 ms 5608 KB 
#include <bits/stdc++.h>
using namespace std;
//
#define ll long long int
 
#define endl "\n"; 
 
const int maxn = 601;

// 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});
	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;

		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 = 1e6;
	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;
	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
47.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2496 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Runtime error 18 ms 5064 KB Execution killed with signal 11
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Incorrect 2 ms 2396 KB Output isn't correct
14 Incorrect 4 ms 2492 KB Output isn't correct
15 Correct 1 ms 2400 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 2396 KB Output is correct
20 Correct 1 ms 2400 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2400 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 2 ms 2656 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 34 ms 3420 KB Output is correct
34 Correct 33 ms 3416 KB Output is correct
35 Correct 80 ms 3436 KB Output is correct
36 Correct 44 ms 3672 KB Output is correct
37 Correct 42 ms 3676 KB Output is correct
38 Correct 104 ms 3676 KB Output is correct
39 Correct 56 ms 3928 KB Output is correct
40 Correct 53 ms 3932 KB Output is correct
41 Correct 133 ms 3932 KB Output is correct
42 Correct 72 ms 4480 KB Output is correct
43 Correct 66 ms 4188 KB Output is correct
44 Correct 166 ms 4268 KB Output is correct
45 Correct 82 ms 4444 KB Output is correct
46 Correct 78 ms 4324 KB Output is correct
47 Correct 223 ms 4596 KB Output is correct
48 Correct 100 ms 4940 KB Output is correct
49 Correct 97 ms 4864 KB Output is correct
50 Correct 242 ms 4972 KB Output is correct
51 Incorrect 21 ms 4700 KB Output isn't correct
52 Incorrect 59 ms 4808 KB Output isn't correct
53 Incorrect 97 ms 4900 KB Output isn't correct
54 Incorrect 24 ms 4696 KB Output isn't correct
55 Incorrect 64 ms 4696 KB Output isn't correct
56 Incorrect 85 ms 4876 KB Output isn't correct
57 Incorrect 24 ms 4688 KB Output isn't correct
58 Incorrect 67 ms 4696 KB Output isn't correct
59 Incorrect 115 ms 4884 KB Output isn't correct
60 Runtime error 18 ms 5468 KB Execution killed with signal 11
61 Runtime error 18 ms 5380 KB Execution killed with signal 11
62 Runtime error 18 ms 5536 KB Execution killed with signal 11
63 Runtime error 18 ms 5464 KB Execution killed with signal 11
64 Runtime error 18 ms 5468 KB Execution killed with signal 11
65 Runtime error 23 ms 5608 KB Execution killed with signal 11
66 Runtime error 18 ms 5496 KB Execution killed with signal 11
67 Runtime error 18 ms 5440 KB Execution killed with signal 11
68 Runtime error 19 ms 5400 KB Execution killed with signal 11
69 Runtime error 18 ms 5464 KB Execution killed with signal 11
70 Runtime error 19 ms 5460 KB Execution killed with signal 11
71 Runtime error 18 ms 5468 KB Execution killed with signal 11
72 Runtime error 18 ms 5464 KB Execution killed with signal 11
73 Runtime error 18 ms 5464 KB Execution killed with signal 11
74 Runtime error 18 ms 5468 KB Execution killed with signal 11
75 Runtime error 18 ms 5392 KB Execution killed with signal 11
76 Runtime error 18 ms 5468 KB Execution killed with signal 11
77 Runtime error 22 ms 5468 KB Execution killed with signal 11
78 Runtime error 23 ms 5552 KB Execution killed with signal 11
79 Runtime error 18 ms 5456 KB Execution killed with signal 11
80 Runtime error 18 ms 5268 KB Execution killed with signal 11
81 Runtime error 20 ms 5408 KB Execution killed with signal 11
82 Runtime error 18 ms 5296 KB Execution killed with signal 11
83 Runtime error 18 ms 5396 KB Execution killed with signal 11
84 Runtime error 18 ms 5204 KB Execution killed with signal 11
85 Runtime error 18 ms 5464 KB Execution killed with signal 11
86 Runtime error 18 ms 5460 KB Execution killed with signal 11
87 Runtime error 18 ms 5472 KB Execution killed with signal 11
88 Runtime error 18 ms 5464 KB Execution killed with signal 11
89 Runtime error 18 ms 5456 KB Execution killed with signal 11
90 Runtime error 22 ms 5464 KB Execution killed with signal 11
91 Runtime error 19 ms 5468 KB Execution killed with signal 11
92 Runtime error 20 ms 5460 KB Execution killed with signal 11