oj.uz

답안 #1061582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061582 2024-08-16T11:03:21 Z beaconmc Maze (JOI23_ho_t3) C++14
8 / 100
 906 ms 52188 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){
	if ((abs(x-a)<=n && abs(y-b) < n) || (abs(x-a)<n && abs(y-b) <= n)){
		return 1;
	}
	return 0;
}

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

	FOR(i,-(n-1), n){
		ans.insert({a-n, b+i});
		ans.insert({a+n, b+i});
		ans.insert({a+i, b-n});
		ans.insert({a+i, b+n});
	}
	// FOR(i,0,r){
	// 	if (iswithin(a, b, i, c-1)) ans.insert({i, c-1}); 
	// 	if (iswithin(a, b, i, 0)) ans.insert({i, 0}); 
	// }
	// FOR(i,0,c){
	// 	if (iswithin(a,b,r-1,i)) ans.insert({r-1, i});
	// 	if (iswithin(a,b,0,i)) ans.insert({0, i});
	// }

	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 (iswithin(node[0],node[1],x,y)){
			visited[x][y] = node[2]+1;
			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

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 24 ms 1436 KB Output is correct
20 Correct 31 ms 2080 KB Output is correct
21 Correct 10 ms 2396 KB Output is correct
22 Correct 27 ms 1488 KB Output is correct
23 Correct 29 ms 1624 KB Output is correct
24 Correct 23 ms 2588 KB Output is correct
25 Correct 22 ms 2588 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 15 ms 1476 KB Output is correct
29 Correct 76 ms 2908 KB Output is correct
30 Correct 24 ms 2040 KB Output is correct
31 Correct 43 ms 5040 KB Output is correct
32 Correct 115 ms 2908 KB Output is correct
33 Correct 80 ms 2908 KB Output is correct
34 Correct 65 ms 5448 KB Output is correct
35 Correct 88 ms 5448 KB Output is correct
36 Correct 43 ms 3164 KB Output is correct
37 Correct 61 ms 2908 KB Output is correct
38 Correct 10 ms 2908 KB Output is correct
39 Correct 884 ms 28540 KB Output is correct
40 Correct 43 ms 3336 KB Output is correct
41 Correct 35 ms 6472 KB Output is correct
42 Correct 117 ms 4696 KB Output is correct
43 Correct 104 ms 6688 KB Output is correct
44 Correct 150 ms 14836 KB Output is correct
45 Correct 170 ms 16260 KB Output is correct
46 Correct 840 ms 43492 KB Output is correct
47 Correct 906 ms 28604 KB Output is correct
48 Correct 733 ms 28756 KB Output is correct
49 Correct 430 ms 52188 KB Output is correct
50 Correct 425 ms 50640 KB Output is correct
51 Correct 617 ms 29064 KB Output is correct
52 Correct 447 ms 28760 KB Output is correct
53 Correct 776 ms 28512 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 1 ms 348 KB Output is correct
4 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #6
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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 24 ms 1436 KB Output is correct
20 Correct 31 ms 2080 KB Output is correct
21 Correct 10 ms 2396 KB Output is correct
22 Correct 27 ms 1488 KB Output is correct
23 Correct 29 ms 1624 KB Output is correct
24 Correct 23 ms 2588 KB Output is correct
25 Correct 22 ms 2588 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 15 ms 1476 KB Output is correct
29 Correct 76 ms 2908 KB Output is correct
30 Correct 24 ms 2040 KB Output is correct
31 Correct 43 ms 5040 KB Output is correct
32 Correct 115 ms 2908 KB Output is correct
33 Correct 80 ms 2908 KB Output is correct
34 Correct 65 ms 5448 KB Output is correct
35 Correct 88 ms 5448 KB Output is correct
36 Correct 43 ms 3164 KB Output is correct
37 Correct 61 ms 2908 KB Output is correct
38 Correct 10 ms 2908 KB Output is correct
39 Correct 884 ms 28540 KB Output is correct
40 Correct 43 ms 3336 KB Output is correct
41 Correct 35 ms 6472 KB Output is correct
42 Correct 117 ms 4696 KB Output is correct
43 Correct 104 ms 6688 KB Output is correct
44 Correct 150 ms 14836 KB Output is correct
45 Correct 170 ms 16260 KB Output is correct
46 Correct 840 ms 43492 KB Output is correct
47 Correct 906 ms 28604 KB Output is correct
48 Correct 733 ms 28756 KB Output is correct
49 Correct 430 ms 52188 KB Output is correct
50 Correct 425 ms 50640 KB Output is correct
51 Correct 617 ms 29064 KB Output is correct
52 Correct 447 ms 28760 KB Output is correct
53 Correct 776 ms 28512 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 24 ms 1436 KB Output is correct
20 Correct 31 ms 2080 KB Output is correct
21 Correct 10 ms 2396 KB Output is correct
22 Correct 27 ms 1488 KB Output is correct
23 Correct 29 ms 1624 KB Output is correct
24 Correct 23 ms 2588 KB Output is correct
25 Correct 22 ms 2588 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 15 ms 1476 KB Output is correct
29 Correct 76 ms 2908 KB Output is correct
30 Correct 24 ms 2040 KB Output is correct
31 Correct 43 ms 5040 KB Output is correct
32 Correct 115 ms 2908 KB Output is correct
33 Correct 80 ms 2908 KB Output is correct
34 Correct 65 ms 5448 KB Output is correct
35 Correct 88 ms 5448 KB Output is correct
36 Correct 43 ms 3164 KB Output is correct
37 Correct 61 ms 2908 KB Output is correct
38 Correct 10 ms 2908 KB Output is correct
39 Correct 884 ms 28540 KB Output is correct
40 Correct 43 ms 3336 KB Output is correct
41 Correct 35 ms 6472 KB Output is correct
42 Correct 117 ms 4696 KB Output is correct
43 Correct 104 ms 6688 KB Output is correct
44 Correct 150 ms 14836 KB Output is correct
45 Correct 170 ms 16260 KB Output is correct
46 Correct 840 ms 43492 KB Output is correct
47 Correct 906 ms 28604 KB Output is correct
48 Correct 733 ms 28756 KB Output is correct
49 Correct 430 ms 52188 KB Output is correct
50 Correct 425 ms 50640 KB Output is correct
51 Correct 617 ms 29064 KB Output is correct
52 Correct 447 ms 28760 KB Output is correct
53 Correct 776 ms 28512 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 24 ms 1436 KB Output is correct
20 Correct 31 ms 2080 KB Output is correct
21 Correct 10 ms 2396 KB Output is correct
22 Correct 27 ms 1488 KB Output is correct
23 Correct 29 ms 1624 KB Output is correct
24 Correct 23 ms 2588 KB Output is correct
25 Correct 22 ms 2588 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 15 ms 1476 KB Output is correct
29 Correct 76 ms 2908 KB Output is correct
30 Correct 24 ms 2040 KB Output is correct
31 Correct 43 ms 5040 KB Output is correct
32 Correct 115 ms 2908 KB Output is correct
33 Correct 80 ms 2908 KB Output is correct
34 Correct 65 ms 5448 KB Output is correct
35 Correct 88 ms 5448 KB Output is correct
36 Correct 43 ms 3164 KB Output is correct
37 Correct 61 ms 2908 KB Output is correct
38 Correct 10 ms 2908 KB Output is correct
39 Correct 884 ms 28540 KB Output is correct
40 Correct 43 ms 3336 KB Output is correct
41 Correct 35 ms 6472 KB Output is correct
42 Correct 117 ms 4696 KB Output is correct
43 Correct 104 ms 6688 KB Output is correct
44 Correct 150 ms 14836 KB Output is correct
45 Correct 170 ms 16260 KB Output is correct
46 Correct 840 ms 43492 KB Output is correct
47 Correct 906 ms 28604 KB Output is correct
48 Correct 733 ms 28756 KB Output is correct
49 Correct 430 ms 52188 KB Output is correct
50 Correct 425 ms 50640 KB Output is correct
51 Correct 617 ms 29064 KB Output is correct
52 Correct 447 ms 28760 KB Output is correct
53 Correct 776 ms 28512 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Halted 0 ms 0 KB -