oj.uz

답안 #882834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882834 2023-12-03T20:02:23 Z abhinavshukla408 Mecho (IOI09_mecho) C++17
22 / 100
 341 ms 31312 KB 
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <math.h>
 
using namespace std;
 
#define endl "\n"
#define int int64_t 
#define pb push_back
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR0(i,a) FOR(i,0,a)
#define FOR1(i,a) for (int i = (1); i <= (a); ++i)
#define TRAV(a,x) for (auto& a: x)

using pii = pair<int,int>;
using vi = vector<int>;
vi dx = {-1,0,1,0};
vi dy = {0,-1,0,1};
const int NMAX=800;
int N;
int S;
pii start={0,0};
pii end2={0,0};

bool f(int k,string grid[NMAX][NMAX],int distBees[NMAX][NMAX]){
	queue<pii> cur;
	cur.push(start);
	int dist[N][N];
	FOR0(i,N){
		FOR0(j,N){
			dist[i][j]=-1;
		}
	}
	dist[start.first][start.second]=0;
	while(!cur.empty()){
		pii curNode=cur.front();
		cur.pop();
		FOR0(i,4){
			int newR=curNode.first+dx[i];
			int newC=curNode.second+dy[i];
			if(newR<0 || newR>=N || newC<0 || newC>=N){continue;}
			if((grid[newR][newC]=="G" || grid[newR][newC]=="D") && dist[newR][newC]==(-1)){
				if((distBees[newR][newC]-k)>((dist[curNode.first][curNode.second]+1)/S)){
					//cout<<newR<<" "<<newC<<endl;
					dist[newR][newC]=dist[curNode.first][curNode.second]+1;
					cur.push({newR,newC});
				}
			}
		}
	}

	if(dist[end2.first][end2.second]!=(-1)){
		return true;
	}
	return false;

}

int last_true(int lo, int hi,string grid[NMAX][NMAX],int distBees[NMAX][NMAX]) {
	// if none of the values in the range work, return lo - 1
	lo--;
	while (lo < hi) {
		// find the middle of the current range (rounding up)
		int mid = lo + (hi - lo + 1) / 2;
		if (f(mid,grid,distBees)) {
			// if mid works, then all numbers smaller than mid also work
			lo = mid;
		} else {
			// if mid does not work, greater values would not work either
			hi = mid - 1;
		}
	}
	return lo;
}


int32_t main(){

	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	// cout<<"yo"<<endl;
	// return 0;
	cin>>N>>S;
	string grid[NMAX][NMAX];
	int distBees[NMAX][NMAX];
	
	queue<pii> cur;
	FOR0(r,N){
		string in;
		cin>>in;
		FOR0(c,N){
			distBees[r][c]=-1;
			grid[r][c]=(in.at(c));
			if(grid[r][c]=="H"){
				cur.push({r,c});
				distBees[r][c]=0;
			}
			if(grid[r][c]=="M"){
				start={r,c};
			}
			if(grid[r][c]=="D"){
				end2={r,c};
			}
		}
	}
	// return 0;
	while(!cur.empty()){
		pii curNode=cur.front();
		int curR=curNode.first;
		int curC=curNode.second;
		cur.pop();
		FOR0(i,4){
				int newR=curNode.first+dx[i];
				int newC=curNode.second+dy[i];
				if(newR<0 || newR>=N || newC<0 || newC>=N){continue;}
				if(grid[newR][newC]!="M" && distBees[newR][newC]==(-1)){
					distBees[newR][newC]=distBees[curR][curC]+1;
					cur.push({newR,newC});
				}
		}
	}
	//return 0;
	int ans=last_true(0,100000000,grid,distBees);
	if(ans==100000000){
		ans=-1;
	}
	cout<<ans<<endl;
	



	return 0;
}

Subtask #1
22.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 25436 KB Output is correct
2 Incorrect 14 ms 25432 KB Output isn't correct
3 Correct 14 ms 25436 KB Output is correct
4 Incorrect 16 ms 25308 KB Output isn't correct
5 Incorrect 15 ms 25432 KB Output isn't correct
6 Incorrect 15 ms 25436 KB Output isn't correct
7 Incorrect 200 ms 30732 KB Output isn't correct
8 Correct 19 ms 25432 KB Output is correct
9 Incorrect 14 ms 25436 KB Output isn't correct
10 Correct 14 ms 25412 KB Output is correct
11 Correct 18 ms 25436 KB Output is correct
12 Incorrect 15 ms 25436 KB Output isn't correct
13 Incorrect 16 ms 25304 KB Output isn't correct
14 Correct 15 ms 25432 KB Output is correct
15 Incorrect 19 ms 25480 KB Output isn't correct
16 Incorrect 15 ms 25488 KB Output isn't correct
17 Incorrect 14 ms 25436 KB Output isn't correct
18 Incorrect 17 ms 25436 KB Output isn't correct
19 Incorrect 15 ms 25436 KB Output isn't correct
20 Incorrect 15 ms 25252 KB Output isn't correct
21 Incorrect 15 ms 25436 KB Output isn't correct
22 Incorrect 14 ms 25436 KB Output isn't correct
23 Incorrect 17 ms 25616 KB Output isn't correct
24 Incorrect 15 ms 25436 KB Output isn't correct
25 Incorrect 15 ms 25452 KB Output isn't correct
26 Incorrect 17 ms 25340 KB Output isn't correct
27 Incorrect 16 ms 25436 KB Output isn't correct
28 Incorrect 15 ms 25436 KB Output isn't correct
29 Incorrect 15 ms 25500 KB Output isn't correct
30 Incorrect 15 ms 25448 KB Output isn't correct
31 Incorrect 15 ms 25688 KB Output isn't correct
32 Incorrect 15 ms 25436 KB Output isn't correct
33 Incorrect 30 ms 26264 KB Output isn't correct
34 Incorrect 28 ms 26460 KB Output isn't correct
35 Correct 53 ms 26460 KB Output is correct
36 Incorrect 27 ms 26916 KB Output isn't correct
37 Incorrect 36 ms 26708 KB Output isn't correct
38 Correct 72 ms 26544 KB Output is correct
39 Incorrect 31 ms 26960 KB Output isn't correct
40 Incorrect 32 ms 26968 KB Output isn't correct
41 Correct 99 ms 27056 KB Output is correct
42 Incorrect 43 ms 27292 KB Output isn't correct
43 Incorrect 37 ms 27216 KB Output isn't correct
44 Correct 112 ms 27464 KB Output is correct
45 Incorrect 39 ms 27828 KB Output isn't correct
46 Incorrect 51 ms 27844 KB Output isn't correct
47 Correct 140 ms 28080 KB Output is correct
48 Incorrect 50 ms 28500 KB Output isn't correct
49 Incorrect 57 ms 28092 KB Output isn't correct
50 Correct 160 ms 28088 KB Output is correct
51 Incorrect 67 ms 28752 KB Output isn't correct
52 Incorrect 66 ms 28820 KB Output isn't correct
53 Correct 200 ms 28828 KB Output is correct
54 Incorrect 56 ms 29268 KB Output isn't correct
55 Incorrect 76 ms 29360 KB Output isn't correct
56 Correct 242 ms 29520 KB Output is correct
57 Incorrect 75 ms 29780 KB Output isn't correct
58 Incorrect 92 ms 29880 KB Output isn't correct
59 Correct 293 ms 30152 KB Output is correct
60 Incorrect 70 ms 30368 KB Output isn't correct
61 Incorrect 89 ms 30292 KB Output isn't correct
62 Correct 341 ms 30644 KB Output is correct
63 Incorrect 87 ms 30384 KB Output isn't correct
64 Incorrect 288 ms 30528 KB Output isn't correct
65 Incorrect 279 ms 30640 KB Output isn't correct
66 Incorrect 86 ms 30532 KB Output isn't correct
67 Correct 109 ms 30364 KB Output is correct
68 Incorrect 78 ms 30692 KB Output isn't correct
69 Incorrect 96 ms 30832 KB Output isn't correct
70 Incorrect 94 ms 30664 KB Output isn't correct
71 Incorrect 84 ms 30688 KB Output isn't correct
72 Incorrect 84 ms 30692 KB Output isn't correct
73 Incorrect 100 ms 31072 KB Output isn't correct
74 Correct 151 ms 30924 KB Output is correct
75 Correct 194 ms 30924 KB Output is correct
76 Correct 149 ms 31056 KB Output is correct
77 Correct 186 ms 31312 KB Output is correct
78 Correct 154 ms 31020 KB Output is correct
79 Correct 139 ms 30808 KB Output is correct
80 Correct 138 ms 31028 KB Output is correct
81 Correct 184 ms 30980 KB Output is correct
82 Correct 142 ms 30804 KB Output is correct
83 Correct 163 ms 30944 KB Output is correct
84 Correct 182 ms 30800 KB Output is correct
85 Correct 152 ms 30896 KB Output is correct
86 Correct 178 ms 30800 KB Output is correct
87 Correct 168 ms 30800 KB Output is correct
88 Correct 163 ms 30840 KB Output is correct
89 Correct 183 ms 30836 KB Output is correct
90 Correct 220 ms 30836 KB Output is correct
91 Correct 186 ms 30800 KB Output is correct
92 Correct 221 ms 30804 KB Output is correct