oj.uz

답안 #1061664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061664 2024-08-16T11:33:26 Z beaconmc Maze (JOI23_ho_t3) C++14
8 / 100
 410 ms 52948 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;



bool iswithin(ll a, ll b, ll x, ll y){
	ll A = abs(x-a), B = abs(y-b);
	if ((A<=n && B < n) ||(A<n && B <= n)){
		return 1;
	}
	return 0;
}

vector<array<ll,2>> getvalid(ll a, ll b){
	vector<array<ll,2>> 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});
	// }

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

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


	vector<array<ll,2>> 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 (iswithin(node[0],node[1],x,y)){
			if (visited[x][y]> node[2]+1){
				visited[x][y] = node[2]+1;
				sus.push_back({x,y,node[2]+1});
			}
			
		}


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

		vector<array<ll,2>> 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]});
					}
				}
			}
		}

		for (auto&i : temp){
			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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 472 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 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 19 ms 1372 KB Output is correct
20 Correct 8 ms 2080 KB Output is correct
21 Correct 12 ms 2904 KB Output is correct
22 Correct 14 ms 1488 KB Output is correct
23 Correct 17 ms 1368 KB Output is correct
24 Correct 12 ms 2592 KB Output is correct
25 Correct 9 ms 2588 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 35 ms 2908 KB Output is correct
30 Correct 10 ms 2040 KB Output is correct
31 Correct 19 ms 4956 KB Output is correct
32 Correct 41 ms 2908 KB Output is correct
33 Correct 34 ms 2904 KB Output is correct
34 Correct 32 ms 5452 KB Output is correct
35 Correct 33 ms 5452 KB Output is correct
36 Correct 21 ms 3160 KB Output is correct
37 Correct 33 ms 2904 KB Output is correct
38 Correct 4 ms 2908 KB Output is correct
39 Correct 410 ms 28320 KB Output is correct
40 Correct 13 ms 3332 KB Output is correct
41 Correct 19 ms 6480 KB Output is correct
42 Correct 53 ms 4700 KB Output is correct
43 Correct 40 ms 6684 KB Output is correct
44 Correct 70 ms 14584 KB Output is correct
45 Correct 78 ms 17800 KB Output is correct
46 Correct 406 ms 43488 KB Output is correct
47 Correct 392 ms 28548 KB Output is correct
48 Correct 298 ms 28496 KB Output is correct
49 Correct 212 ms 52948 KB Output is correct
50 Correct 191 ms 51932 KB Output is correct
51 Correct 277 ms 29008 KB Output is correct
52 Correct 206 ms 28688 KB Output is correct
53 Correct 331 ms 28508 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 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 348 KB Output is correct
13 Correct 0 ms 348 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Incorrect 2 ms 1108 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 472 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 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 19 ms 1372 KB Output is correct
20 Correct 8 ms 2080 KB Output is correct
21 Correct 12 ms 2904 KB Output is correct
22 Correct 14 ms 1488 KB Output is correct
23 Correct 17 ms 1368 KB Output is correct
24 Correct 12 ms 2592 KB Output is correct
25 Correct 9 ms 2588 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 35 ms 2908 KB Output is correct
30 Correct 10 ms 2040 KB Output is correct
31 Correct 19 ms 4956 KB Output is correct
32 Correct 41 ms 2908 KB Output is correct
33 Correct 34 ms 2904 KB Output is correct
34 Correct 32 ms 5452 KB Output is correct
35 Correct 33 ms 5452 KB Output is correct
36 Correct 21 ms 3160 KB Output is correct
37 Correct 33 ms 2904 KB Output is correct
38 Correct 4 ms 2908 KB Output is correct
39 Correct 410 ms 28320 KB Output is correct
40 Correct 13 ms 3332 KB Output is correct
41 Correct 19 ms 6480 KB Output is correct
42 Correct 53 ms 4700 KB Output is correct
43 Correct 40 ms 6684 KB Output is correct
44 Correct 70 ms 14584 KB Output is correct
45 Correct 78 ms 17800 KB Output is correct
46 Correct 406 ms 43488 KB Output is correct
47 Correct 392 ms 28548 KB Output is correct
48 Correct 298 ms 28496 KB Output is correct
49 Correct 212 ms 52948 KB Output is correct
50 Correct 191 ms 51932 KB Output is correct
51 Correct 277 ms 29008 KB Output is correct
52 Correct 206 ms 28688 KB Output is correct
53 Correct 331 ms 28508 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 472 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 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 19 ms 1372 KB Output is correct
20 Correct 8 ms 2080 KB Output is correct
21 Correct 12 ms 2904 KB Output is correct
22 Correct 14 ms 1488 KB Output is correct
23 Correct 17 ms 1368 KB Output is correct
24 Correct 12 ms 2592 KB Output is correct
25 Correct 9 ms 2588 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 35 ms 2908 KB Output is correct
30 Correct 10 ms 2040 KB Output is correct
31 Correct 19 ms 4956 KB Output is correct
32 Correct 41 ms 2908 KB Output is correct
33 Correct 34 ms 2904 KB Output is correct
34 Correct 32 ms 5452 KB Output is correct
35 Correct 33 ms 5452 KB Output is correct
36 Correct 21 ms 3160 KB Output is correct
37 Correct 33 ms 2904 KB Output is correct
38 Correct 4 ms 2908 KB Output is correct
39 Correct 410 ms 28320 KB Output is correct
40 Correct 13 ms 3332 KB Output is correct
41 Correct 19 ms 6480 KB Output is correct
42 Correct 53 ms 4700 KB Output is correct
43 Correct 40 ms 6684 KB Output is correct
44 Correct 70 ms 14584 KB Output is correct
45 Correct 78 ms 17800 KB Output is correct
46 Correct 406 ms 43488 KB Output is correct
47 Correct 392 ms 28548 KB Output is correct
48 Correct 298 ms 28496 KB Output is correct
49 Correct 212 ms 52948 KB Output is correct
50 Correct 191 ms 51932 KB Output is correct
51 Correct 277 ms 29008 KB Output is correct
52 Correct 206 ms 28688 KB Output is correct
53 Correct 331 ms 28508 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 472 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 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 19 ms 1372 KB Output is correct
20 Correct 8 ms 2080 KB Output is correct
21 Correct 12 ms 2904 KB Output is correct
22 Correct 14 ms 1488 KB Output is correct
23 Correct 17 ms 1368 KB Output is correct
24 Correct 12 ms 2592 KB Output is correct
25 Correct 9 ms 2588 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 35 ms 2908 KB Output is correct
30 Correct 10 ms 2040 KB Output is correct
31 Correct 19 ms 4956 KB Output is correct
32 Correct 41 ms 2908 KB Output is correct
33 Correct 34 ms 2904 KB Output is correct
34 Correct 32 ms 5452 KB Output is correct
35 Correct 33 ms 5452 KB Output is correct
36 Correct 21 ms 3160 KB Output is correct
37 Correct 33 ms 2904 KB Output is correct
38 Correct 4 ms 2908 KB Output is correct
39 Correct 410 ms 28320 KB Output is correct
40 Correct 13 ms 3332 KB Output is correct
41 Correct 19 ms 6480 KB Output is correct
42 Correct 53 ms 4700 KB Output is correct
43 Correct 40 ms 6684 KB Output is correct
44 Correct 70 ms 14584 KB Output is correct
45 Correct 78 ms 17800 KB Output is correct
46 Correct 406 ms 43488 KB Output is correct
47 Correct 392 ms 28548 KB Output is correct
48 Correct 298 ms 28496 KB Output is correct
49 Correct 212 ms 52948 KB Output is correct
50 Correct 191 ms 51932 KB Output is correct
51 Correct 277 ms 29008 KB Output is correct
52 Correct 206 ms 28688 KB Output is correct
53 Correct 331 ms 28508 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -