Submission #1109984

# Submission time Handle Problem Language Result Execution time Memory
1109984 2024-11-08T10:29:23 Z dsyz Mecho (IOI09_mecho) C++17
38 / 100
130 ms 11632 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N,S;
	cin>>N>>S;
	pair<ll,ll> start = {-1,-1};
	pair<ll,ll> end = {-1,-1};
	char arr[N][N];
	for(ll i = 0;i < N;i++){
		for(ll j = 0;j < N;j++){
			cin>>arr[i][j];
			if(arr[i][j] == 'M') start = {i,j};
			if(arr[i][j] == 'D') end = {i,j};
		}
	}
	queue<pair<ll,ll> > q;
	ll fromhive[N][N];
	for(ll i = 0;i < N;i++){
		for(ll j = 0;j < N;j++){
			fromhive[i][j] = 1e18;
			if(arr[i][j] == 'H'){
				q.push({i,j});
				fromhive[i][j] = 0;
			}
		}
	}
	int Hy[] = {0,0,-1,1};
	int Wx[] = {-1,1,0,0};
	while(!q.empty()){
		ll y = q.front().first;
		ll x = q.front().second;
		q.pop();
		for(ll i = 0;i < 4;i++){
			ll a = y + Hy[i];
			ll b = x + Wx[i];
			if(a < 0 || a >= N || b < 0 || b >= N || arr[a][b] == 'T' || arr[a][b] == 'D'){
				continue;	
			}
			if(fromhive[a][b] == 1e18){
				q.push({a,b});
				fromhive[a][b] = fromhive[y][x] + 1;
			}
		}
	}
	ll high = 1e6 + 5;
	ll low = -1;
	while(high - low > 1){
		ll mid = (high + low) / 2;
		ll dist[N][N];
		memset(dist,-1,sizeof(dist));
		q.push(start);
		dist[start.first][start.second] = 0;
		ll time = max(0ll,mid);
		ll add = 0;
		while(true){
			queue<pair<ll,ll> > newq;
			while(!q.empty()){
				ll y = q.front().first;
				ll x = q.front().second;
				q.pop();
				for(ll i = 0;i < 4;i++){
					ll a = y + Hy[i];
					ll b = x + Wx[i];
					if(a < 0 || a >= N || b < 0 || b >= N || arr[a][b] == 'T'){
						continue;	
					}
					if(dist[a][b] == -1 && dist[y][x] + 1 <= S + add && time < fromhive[a][b]){
						dist[a][b] = dist[y][x] + 1;
						if(dist[a][b] == S + add){
							for(ll ind = 0;ind < 4;ind++){
								ll aa = a + Hy[ind];
								ll bb = b + Wx[ind];
								if(aa < 0 || aa >= N || bb < 0 || bb >= N || arr[aa][bb] == 'T'){
									continue;
								}
								if(dist[aa][bb] == -1 && time + 1 < fromhive[aa][bb]){
									newq.push({a,b});
									break;
								}
							}
						}else{
							q.push({a,b});
						}
					}
				}
			}
			time++;
			add += S;
			while(!newq.empty()){
				q.push(newq.front());
				newq.pop();
			}
			if(q.empty()){
				break;
			}
		}
		if(dist[end.first][end.second] == -1){
			high = mid;
		}else{
			low = mid;
		}
	}
	cout<<low<<'\n';
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 74 ms 11232 KB Output is correct
8 Incorrect 1 ms 336 KB Output isn't correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Correct 1 ms 336 KB Output is correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Correct 1 ms 336 KB Output is correct
17 Incorrect 1 ms 336 KB Output isn't correct
18 Correct 1 ms 336 KB Output is correct
19 Incorrect 1 ms 336 KB Output isn't correct
20 Correct 1 ms 336 KB Output is correct
21 Incorrect 1 ms 508 KB Output isn't correct
22 Correct 1 ms 336 KB Output is correct
23 Incorrect 1 ms 336 KB Output isn't correct
24 Correct 1 ms 336 KB Output is correct
25 Incorrect 1 ms 336 KB Output isn't correct
26 Correct 1 ms 336 KB Output is correct
27 Incorrect 1 ms 336 KB Output isn't correct
28 Correct 1 ms 504 KB Output is correct
29 Incorrect 1 ms 336 KB Output isn't correct
30 Correct 1 ms 336 KB Output is correct
31 Incorrect 1 ms 336 KB Output isn't correct
32 Correct 1 ms 336 KB Output is correct
33 Incorrect 7 ms 2384 KB Output isn't correct
34 Correct 6 ms 2384 KB Output is correct
35 Correct 17 ms 2500 KB Output is correct
36 Incorrect 7 ms 2896 KB Output isn't correct
37 Correct 7 ms 2896 KB Output is correct
38 Correct 22 ms 2896 KB Output is correct
39 Incorrect 10 ms 3676 KB Output isn't correct
40 Correct 9 ms 3664 KB Output is correct
41 Correct 29 ms 3840 KB Output is correct
42 Incorrect 14 ms 4432 KB Output isn't correct
43 Correct 13 ms 4432 KB Output is correct
44 Correct 36 ms 4432 KB Output is correct
45 Incorrect 14 ms 5456 KB Output isn't correct
46 Correct 13 ms 5456 KB Output is correct
47 Correct 46 ms 5456 KB Output is correct
48 Incorrect 18 ms 6224 KB Output isn't correct
49 Correct 19 ms 6224 KB Output is correct
50 Correct 52 ms 6376 KB Output is correct
51 Incorrect 21 ms 7248 KB Output isn't correct
52 Correct 17 ms 7248 KB Output is correct
53 Correct 66 ms 7248 KB Output is correct
54 Incorrect 25 ms 8356 KB Output isn't correct
55 Correct 20 ms 8464 KB Output is correct
56 Correct 72 ms 8528 KB Output is correct
57 Incorrect 24 ms 9800 KB Output isn't correct
58 Correct 21 ms 9808 KB Output is correct
59 Correct 78 ms 9808 KB Output is correct
60 Incorrect 31 ms 11088 KB Output isn't correct
61 Correct 24 ms 11088 KB Output is correct
62 Correct 95 ms 11080 KB Output is correct
63 Correct 92 ms 11088 KB Output is correct
64 Correct 129 ms 11088 KB Output is correct
65 Correct 130 ms 11016 KB Output is correct
66 Incorrect 125 ms 11236 KB Output isn't correct
67 Correct 93 ms 10948 KB Output is correct
68 Correct 52 ms 11000 KB Output is correct
69 Correct 47 ms 11088 KB Output is correct
70 Correct 43 ms 11080 KB Output is correct
71 Correct 37 ms 11088 KB Output is correct
72 Incorrect 35 ms 11012 KB Output isn't correct
73 Incorrect 36 ms 11508 KB Output isn't correct
74 Correct 57 ms 11620 KB Output is correct
75 Correct 65 ms 11596 KB Output is correct
76 Correct 60 ms 11592 KB Output is correct
77 Correct 68 ms 11520 KB Output is correct
78 Correct 63 ms 11516 KB Output is correct
79 Correct 52 ms 11532 KB Output is correct
80 Correct 54 ms 11632 KB Output is correct
81 Correct 60 ms 11600 KB Output is correct
82 Correct 48 ms 11580 KB Output is correct
83 Correct 67 ms 11344 KB Output is correct
84 Correct 63 ms 11348 KB Output is correct
85 Correct 62 ms 11384 KB Output is correct
86 Correct 64 ms 11344 KB Output is correct
87 Correct 65 ms 11336 KB Output is correct
88 Correct 68 ms 11344 KB Output is correct
89 Correct 78 ms 11336 KB Output is correct
90 Correct 72 ms 11344 KB Output is correct
91 Correct 69 ms 11336 KB Output is correct
92 Correct 68 ms 11336 KB Output is correct