oj.uz

Submission #742735

# Submission time Handle Problem Language Result Execution time Memory
742735 2023-05-16T20:17:05 Z CSQ31 Mecho (IOI09_mecho) C++17
24 / 100
 167 ms 7648 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int n,s,dx[4] = {0,0,1,-1},dy[4] = {1,-1,0,0};
int dist[1000][1000],bdist[1000][1000];
char grid[1000][1000];
pii st,ed;
bool check(int tim){
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			dist[i][j] = 1e9;
		}
	}
	queue<pii>q;
	q.push(st);
	dist[st.fi][st.se] = 1;
	while(!q.empty()){
		pii v = q.front();
		q.pop();
		int d = dist[v.fi][v.se];
		int k = d/s;
		if(k+tim >= bdist[v.fi][v.se]){
			dist[v.fi][v.se] = 1e9;
			continue;
		}
		for(int i=0;i<4;i++){
			int x = v.fi+dx[i];
			int y = v.se+dy[i];
			if(x>=0 && x<n && y>=0 && y<n && grid[x][y] != 'H' && grid[x][y] != 'T' && dist[x][y] ==1e9){
				dist[x][y] = dist[v.fi][v.se]+1;
				q.push({x,y});
			}
		}
	}
	return dist[ed.fi][ed.se] != 1e9;
}
int main()
{
	owo
	cin>>n>>s;
	queue<pii>bee;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cin>>grid[i][j];	
			bdist[i][j] = 1e9;
			if(grid[i][j] == 'M')st = {i,j};
			if(grid[i][j] == 'D')ed = {i,j};
			if(grid[i][j] == 'H'){
				bdist[i][j] = 0;
				bee.push({i,j});
			}
				
		}
	}
	while(!bee.empty()){
		pii v = bee.front();
		bee.pop();
		for(int i=0;i<4;i++){
			int x = v.fi+dx[i];
			int y = v.se+dy[i];
			if(x>=0 && x<n && y>=0 && y<n && bdist[x][y] == 1e9 && grid[x][y] == 'G'){
				bdist[x][y] = bdist[v.fi][v.se] +1;
				bee.push({x,y});
			}
		}
	}
	if(!check(0)){
		cout<<-1;
		return 0;
	}
	int l = 0,r = n*n;
	while(r>=l){
		int mid = (l+r)/2;
		if(check(mid))l = mid+1;
		else r = mid-1;
	}
	cout<<r<<'\n';
	
}

Subtask #1
24.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Correct 68 ms 7380 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 1 ms 852 KB Output isn't correct
13 Incorrect 1 ms 724 KB Output isn't correct
14 Correct 1 ms 852 KB Output is correct
15 Incorrect 1 ms 468 KB Output isn't correct
16 Correct 0 ms 468 KB Output is correct
17 Incorrect 1 ms 468 KB Output isn't correct
18 Correct 0 ms 468 KB Output is correct
19 Incorrect 1 ms 568 KB Output isn't correct
20 Correct 1 ms 596 KB Output is correct
21 Incorrect 1 ms 596 KB Output isn't correct
22 Correct 1 ms 596 KB Output is correct
23 Incorrect 1 ms 724 KB Output isn't correct
24 Correct 1 ms 772 KB Output is correct
25 Incorrect 1 ms 852 KB Output isn't correct
26 Correct 1 ms 852 KB Output is correct
27 Incorrect 1 ms 852 KB Output isn't correct
28 Correct 1 ms 852 KB Output is correct
29 Incorrect 1 ms 852 KB Output isn't correct
30 Correct 1 ms 852 KB Output is correct
31 Incorrect 1 ms 980 KB Output isn't correct
32 Correct 1 ms 980 KB Output is correct
33 Incorrect 6 ms 3412 KB Output isn't correct
34 Correct 7 ms 3412 KB Output is correct
35 Correct 19 ms 3420 KB Output is correct
36 Incorrect 7 ms 3796 KB Output isn't correct
37 Correct 8 ms 3796 KB Output is correct
38 Correct 22 ms 3864 KB Output is correct
39 Incorrect 8 ms 4180 KB Output isn't correct
40 Correct 9 ms 4180 KB Output is correct
41 Correct 32 ms 4280 KB Output is correct
42 Incorrect 11 ms 4732 KB Output isn't correct
43 Correct 14 ms 4744 KB Output is correct
44 Correct 39 ms 4728 KB Output is correct
45 Incorrect 11 ms 5180 KB Output isn't correct
46 Correct 17 ms 5176 KB Output is correct
47 Correct 48 ms 5180 KB Output is correct
48 Incorrect 14 ms 5588 KB Output isn't correct
49 Correct 16 ms 5612 KB Output is correct
50 Correct 69 ms 5644 KB Output is correct
51 Incorrect 16 ms 5944 KB Output isn't correct
52 Correct 18 ms 5972 KB Output is correct
53 Correct 66 ms 5972 KB Output is correct
54 Incorrect 16 ms 6484 KB Output isn't correct
55 Correct 21 ms 6484 KB Output is correct
56 Correct 75 ms 6492 KB Output is correct
57 Incorrect 18 ms 6820 KB Output isn't correct
58 Correct 23 ms 6816 KB Output is correct
59 Correct 88 ms 6928 KB Output is correct
60 Incorrect 21 ms 7372 KB Output isn't correct
61 Correct 27 ms 7356 KB Output is correct
62 Correct 108 ms 7288 KB Output is correct
63 Incorrect 30 ms 7316 KB Output isn't correct
64 Incorrect 167 ms 7364 KB Output isn't correct
65 Correct 143 ms 7244 KB Output is correct
66 Correct 107 ms 7244 KB Output is correct
67 Correct 31 ms 7308 KB Output is correct
68 Correct 43 ms 7392 KB Output is correct
69 Incorrect 41 ms 7348 KB Output isn't correct
70 Correct 35 ms 7380 KB Output is correct
71 Correct 37 ms 7352 KB Output is correct
72 Incorrect 36 ms 7300 KB Output isn't correct
73 Incorrect 64 ms 7640 KB Output isn't correct
74 Incorrect 65 ms 7604 KB Output isn't correct
75 Correct 61 ms 7640 KB Output is correct
76 Incorrect 54 ms 7648 KB Output isn't correct
77 Correct 55 ms 7584 KB Output is correct
78 Correct 27 ms 7572 KB Output is correct
79 Correct 64 ms 7544 KB Output is correct
80 Correct 55 ms 7520 KB Output is correct
81 Correct 72 ms 7612 KB Output is correct
82 Correct 54 ms 7612 KB Output is correct
83 Correct 75 ms 7472 KB Output is correct
84 Incorrect 81 ms 7556 KB Output isn't correct
85 Correct 78 ms 7520 KB Output is correct
86 Correct 73 ms 7532 KB Output is correct
87 Correct 68 ms 7576 KB Output is correct
88 Correct 71 ms 7508 KB Output is correct
89 Incorrect 84 ms 7528 KB Output isn't correct
90 Correct 83 ms 7520 KB Output is correct
91 Correct 75 ms 7524 KB Output is correct
92 Correct 79 ms 7524 KB Output is correct