oj.uz

Submission #1061544

# Submission time Handle Problem Language Result Execution time Memory
1061544 2024-08-16T10:46:22 Z beaconmc Maze (JOI23_ho_t3) C++14
8 / 100
 702 ms 54236 KB 
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;

ll r,c,n;



vector<vector<ll>> grid;
vector<vector<ll>> visited;



vector<vector<ll>> getvalid(ll a, ll b){
	vector<vector<ll>> ans;

	FOR(i,-(n-1), n){
		ans.push_back({a-n, b+i});
		ans.push_back({a+n, b+i});
		ans.push_back({a+i, b-n});
		ans.push_back({a+i, b+n});
	}

	vector<vector<ll>> realans;

	for (auto&i : ans){
		if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c) realans.push_back(i);
	}

	return realans;
}



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> r >> c >> n;

	ll a,b;
	ll x,y;
	cin >> a >> b >> x >> y;
	a--;b--;x--;y--;
	
	FOR(i,0,r){

		vector<ll> temp;
		vector<ll> idk;

		string temp2;
		cin >> temp2;
		FOR(j,0,c){
			temp.push_back(temp2[j]);
			idk.push_back(100000000);

		}
		grid.push_back(temp);
		visited.push_back(idk);

	}




	ll ans = -1;

	deque<vector<ll>> sus;



	sus.push_back({a,b,0});
	visited[a][b] = 0;

	while (sus.size()){
		vector<ll> node = sus.front();
		sus.pop_front();


		if (visited[node[0]][node[1]] != node[2]) continue;



		if (node[0] == x && node[1] == y){
			ans = node[2];
			break;
		}
		if ((abs(x-node[0])<=n && abs(y-node[1]) < n) || (abs(x-node[0])<n && abs(y-node[1]) <= n)){
			sus.push_back({x,y,node[2]+1});
		}


		vector<vector<ll>> pos = {{node[0]-1,node[1]},{node[0]+1,node[1]},{node[0],node[1]-1},{node[0],node[1]+1}};

		vector<vector<ll>> temp = getvalid(node[0], node[1]);

		for (auto&i : pos){


			if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c){

				if (grid[i[0]][i[1]] == '.'){
					if (visited[i[0]][i[1]] > node[2]){
						visited[i[0]][i[1]] = node[2];
						sus.push_front({i[0], i[1], node[2]});
					}
				}
				else{

					if (visited[i[0]][i[1]] > node[2]+1 ){

						visited[i[0]][i[1]] = node[2]+1;
						sus.push_back({i[0], i[1], node[2]+1});
					}
				}
			}
		}

		for (auto&i : temp){
			if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c){


				if (visited[i[0]][i[1]] > node[2]+1){
					visited[i[0]][i[1]] = node[2]+1;
					sus.push_back({i[0], i[1], node[2]+1});
				}
			}
		}



	}
	cout << ans << endl;








}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 21 ms 1372 KB Output is correct
20 Correct 14 ms 2076 KB Output is correct
21 Correct 20 ms 3124 KB Output is correct
22 Correct 23 ms 1472 KB Output is correct
23 Correct 25 ms 1372 KB Output is correct
24 Correct 21 ms 2592 KB Output is correct
25 Correct 20 ms 2592 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 13 ms 1368 KB Output is correct
29 Correct 66 ms 2952 KB Output is correct
30 Correct 17 ms 2040 KB Output is correct
31 Correct 31 ms 5060 KB Output is correct
32 Correct 67 ms 2908 KB Output is correct
33 Correct 67 ms 2908 KB Output is correct
34 Correct 52 ms 5448 KB Output is correct
35 Correct 52 ms 5452 KB Output is correct
36 Correct 37 ms 3164 KB Output is correct
37 Correct 55 ms 2908 KB Output is correct
38 Correct 5 ms 2908 KB Output is correct
39 Correct 702 ms 28508 KB Output is correct
40 Correct 21 ms 3336 KB Output is correct
41 Correct 31 ms 6532 KB Output is correct
42 Correct 101 ms 4696 KB Output is correct
43 Correct 67 ms 6688 KB Output is correct
44 Correct 114 ms 14840 KB Output is correct
45 Correct 140 ms 18192 KB Output is correct
46 Correct 665 ms 43312 KB Output is correct
47 Correct 666 ms 28524 KB Output is correct
48 Correct 550 ms 28504 KB Output is correct
49 Correct 333 ms 53464 KB Output is correct
50 Correct 308 ms 54236 KB Output is correct
51 Correct 476 ms 29084 KB Output is correct
52 Correct 337 ms 28700 KB Output is correct
53 Correct 583 ms 28612 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 21 ms 1372 KB Output is correct
20 Correct 14 ms 2076 KB Output is correct
21 Correct 20 ms 3124 KB Output is correct
22 Correct 23 ms 1472 KB Output is correct
23 Correct 25 ms 1372 KB Output is correct
24 Correct 21 ms 2592 KB Output is correct
25 Correct 20 ms 2592 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 13 ms 1368 KB Output is correct
29 Correct 66 ms 2952 KB Output is correct
30 Correct 17 ms 2040 KB Output is correct
31 Correct 31 ms 5060 KB Output is correct
32 Correct 67 ms 2908 KB Output is correct
33 Correct 67 ms 2908 KB Output is correct
34 Correct 52 ms 5448 KB Output is correct
35 Correct 52 ms 5452 KB Output is correct
36 Correct 37 ms 3164 KB Output is correct
37 Correct 55 ms 2908 KB Output is correct
38 Correct 5 ms 2908 KB Output is correct
39 Correct 702 ms 28508 KB Output is correct
40 Correct 21 ms 3336 KB Output is correct
41 Correct 31 ms 6532 KB Output is correct
42 Correct 101 ms 4696 KB Output is correct
43 Correct 67 ms 6688 KB Output is correct
44 Correct 114 ms 14840 KB Output is correct
45 Correct 140 ms 18192 KB Output is correct
46 Correct 665 ms 43312 KB Output is correct
47 Correct 666 ms 28524 KB Output is correct
48 Correct 550 ms 28504 KB Output is correct
49 Correct 333 ms 53464 KB Output is correct
50 Correct 308 ms 54236 KB Output is correct
51 Correct 476 ms 29084 KB Output is correct
52 Correct 337 ms 28700 KB Output is correct
53 Correct 583 ms 28612 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Incorrect 0 ms 348 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 21 ms 1372 KB Output is correct
20 Correct 14 ms 2076 KB Output is correct
21 Correct 20 ms 3124 KB Output is correct
22 Correct 23 ms 1472 KB Output is correct
23 Correct 25 ms 1372 KB Output is correct
24 Correct 21 ms 2592 KB Output is correct
25 Correct 20 ms 2592 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 13 ms 1368 KB Output is correct
29 Correct 66 ms 2952 KB Output is correct
30 Correct 17 ms 2040 KB Output is correct
31 Correct 31 ms 5060 KB Output is correct
32 Correct 67 ms 2908 KB Output is correct
33 Correct 67 ms 2908 KB Output is correct
34 Correct 52 ms 5448 KB Output is correct
35 Correct 52 ms 5452 KB Output is correct
36 Correct 37 ms 3164 KB Output is correct
37 Correct 55 ms 2908 KB Output is correct
38 Correct 5 ms 2908 KB Output is correct
39 Correct 702 ms 28508 KB Output is correct
40 Correct 21 ms 3336 KB Output is correct
41 Correct 31 ms 6532 KB Output is correct
42 Correct 101 ms 4696 KB Output is correct
43 Correct 67 ms 6688 KB Output is correct
44 Correct 114 ms 14840 KB Output is correct
45 Correct 140 ms 18192 KB Output is correct
46 Correct 665 ms 43312 KB Output is correct
47 Correct 666 ms 28524 KB Output is correct
48 Correct 550 ms 28504 KB Output is correct
49 Correct 333 ms 53464 KB Output is correct
50 Correct 308 ms 54236 KB Output is correct
51 Correct 476 ms 29084 KB Output is correct
52 Correct 337 ms 28700 KB Output is correct
53 Correct 583 ms 28612 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Incorrect 0 ms 348 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 21 ms 1372 KB Output is correct
20 Correct 14 ms 2076 KB Output is correct
21 Correct 20 ms 3124 KB Output is correct
22 Correct 23 ms 1472 KB Output is correct
23 Correct 25 ms 1372 KB Output is correct
24 Correct 21 ms 2592 KB Output is correct
25 Correct 20 ms 2592 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 13 ms 1368 KB Output is correct
29 Correct 66 ms 2952 KB Output is correct
30 Correct 17 ms 2040 KB Output is correct
31 Correct 31 ms 5060 KB Output is correct
32 Correct 67 ms 2908 KB Output is correct
33 Correct 67 ms 2908 KB Output is correct
34 Correct 52 ms 5448 KB Output is correct
35 Correct 52 ms 5452 KB Output is correct
36 Correct 37 ms 3164 KB Output is correct
37 Correct 55 ms 2908 KB Output is correct
38 Correct 5 ms 2908 KB Output is correct
39 Correct 702 ms 28508 KB Output is correct
40 Correct 21 ms 3336 KB Output is correct
41 Correct 31 ms 6532 KB Output is correct
42 Correct 101 ms 4696 KB Output is correct
43 Correct 67 ms 6688 KB Output is correct
44 Correct 114 ms 14840 KB Output is correct
45 Correct 140 ms 18192 KB Output is correct
46 Correct 665 ms 43312 KB Output is correct
47 Correct 666 ms 28524 KB Output is correct
48 Correct 550 ms 28504 KB Output is correct
49 Correct 333 ms 53464 KB Output is correct
50 Correct 308 ms 54236 KB Output is correct
51 Correct 476 ms 29084 KB Output is correct
52 Correct 337 ms 28700 KB Output is correct
53 Correct 583 ms 28612 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Incorrect 0 ms 348 KB Output isn't correct
57 Halted 0 ms 0 KB -