oj.uz

Submission #1055581

# Submission time Handle Problem Language Result Execution time Memory
1055581 2024-08-12T22:55:37 Z _rain_ Maze (JOI23_ho_t3) C++14
8 / 100
 73 ms 28320 KB 
#include<bits/stdc++.h>
using i64 = long long;
using namespace std;
#define all(datastructure) datastructure.begin(),datastructure.end()
#define find(_vector , _data) upper_bound(_vector.begin(),_vector.end(),_data) - _vector.begin()

int numrow , numcol , k;
int sourcex , sourcey;
int sinkx , sinky;

struct _D
{
	int x , y;
	int stepx , stepy;
};
queue<_D> freezone , banzone;
const int dx[] = {0 , 0 , 1 , -1};
const int dy[] = {1 , -1 , 0 , 0};
bool Zone(int x , int y)
{
	return x > 0 && x <= numrow && y > 0 && y <= numcol;
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
//	freopen("text.inp","r",stdin);
//	freopen("text.out","w",stdout);
	cin >> numrow >> numcol >> k;
	cin >> sourcex >> sourcey;
	cin >> sinkx >> sinky;
	vector<vector<char>> a(numrow+2,vector<char>(numcol+2));
	vector<vector<int>> d(numrow+2,vector<int>(numcol+2,-1));
	for (int i = 1; i <= numrow; ++i)
		for (int j = 1; j <= numcol; ++j)
			cin >> a[i][j];
		if (a[sourcex][sourcey] == '.') 
		{
			d[sourcex][sourcey] = 0;
			freezone.push({sourcex,sourcey,0,0});
		}
		else 
		{
			d[sourcex][sourcey] = 1;
			banzone.push({sourcex,sourcey,k-1,k-1});
		}
	while (freezone.size() || banzone.size())
	{
		while (banzone.size())
		{
			_D node = banzone.front(); banzone.pop();
			if (node.stepx == 0 || node.stepy == 0) 
				freezone.push({node.x,node.y,0,0});			
			for (int i = 0; i < 4; ++i)
			{
				int u = node.x + dx[i];
				int v = node.y + dy[i];
				int remx = node.stepx - abs(dx[i]);
				int remy = node.stepy - abs(dy[i]);
				if ((node.stepx&node.stepy) && Zone(u,v) && d[u][v] == -1)
				{
					d[u][v] = d[node.x][node.y];
					if (remx && remy) banzone.push({u , v , remx , remy});
				}
			}
		}
		
		while (freezone.size())
		{
			_D node = freezone.front(); freezone.pop();
			
			for (int i = 0; i < 4; ++i)
			{
				int u = node.x + dx[i];
				int v = node.y + dy[i];
				if (Zone(u,v) && d[u][v] == -1)
				{
					if (a[u][v] == '#') 
					{
						banzone.push({u , v , k - 1 , k - 1});
						d[u][v] = d[node.x][node.y] + 1;
					}
					else 
					{
						freezone.push({u , v , 0 , 0});
						d[u][v] = d[node.x][node.y];
					}
				}
			}
		}
	}
	cout << d[sinkx][sinky];
	return 0;

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   36 |  for (int i = 1; i <= numrow; ++i)
      |  ^~~
Main.cpp:39:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   39 |   if (a[sourcex][sourcey] == '.')
      |   ^~

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 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 408 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 2 ms 604 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 2 ms 728 KB Output is correct
24 Correct 2 ms 1628 KB Output is correct
25 Correct 2 ms 1628 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 840 KB Output is correct
29 Correct 8 ms 1372 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 4 ms 1368 KB Output is correct
32 Correct 6 ms 1344 KB Output is correct
33 Correct 5 ms 1372 KB Output is correct
34 Correct 5 ms 3272 KB Output is correct
35 Correct 6 ms 3268 KB Output is correct
36 Correct 9 ms 1508 KB Output is correct
37 Correct 6 ms 1380 KB Output is correct
38 Correct 6 ms 1372 KB Output is correct
39 Correct 59 ms 9308 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 7 ms 3748 KB Output is correct
42 Correct 9 ms 1624 KB Output is correct
43 Correct 9 ms 3420 KB Output is correct
44 Correct 27 ms 6148 KB Output is correct
45 Correct 31 ms 6724 KB Output is correct
46 Correct 33 ms 9556 KB Output is correct
47 Correct 73 ms 9308 KB Output is correct
48 Correct 58 ms 9404 KB Output is correct
49 Correct 42 ms 28320 KB Output is correct
50 Correct 54 ms 28320 KB Output is correct
51 Correct 68 ms 9808 KB Output is correct
52 Correct 69 ms 9560 KB Output is correct
53 Correct 59 ms 9308 KB Output is correct

Subtask #2
0 / 19.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 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 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 408 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 2 ms 604 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 2 ms 728 KB Output is correct
24 Correct 2 ms 1628 KB Output is correct
25 Correct 2 ms 1628 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 840 KB Output is correct
29 Correct 8 ms 1372 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 4 ms 1368 KB Output is correct
32 Correct 6 ms 1344 KB Output is correct
33 Correct 5 ms 1372 KB Output is correct
34 Correct 5 ms 3272 KB Output is correct
35 Correct 6 ms 3268 KB Output is correct
36 Correct 9 ms 1508 KB Output is correct
37 Correct 6 ms 1380 KB Output is correct
38 Correct 6 ms 1372 KB Output is correct
39 Correct 59 ms 9308 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 7 ms 3748 KB Output is correct
42 Correct 9 ms 1624 KB Output is correct
43 Correct 9 ms 3420 KB Output is correct
44 Correct 27 ms 6148 KB Output is correct
45 Correct 31 ms 6724 KB Output is correct
46 Correct 33 ms 9556 KB Output is correct
47 Correct 73 ms 9308 KB Output is correct
48 Correct 58 ms 9404 KB Output is correct
49 Correct 42 ms 28320 KB Output is correct
50 Correct 54 ms 28320 KB Output is correct
51 Correct 68 ms 9808 KB Output is correct
52 Correct 69 ms 9560 KB Output is correct
53 Correct 59 ms 9308 KB Output is correct
54 Incorrect 0 ms 348 KB Output isn't correct
55 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 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 408 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 2 ms 604 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 2 ms 728 KB Output is correct
24 Correct 2 ms 1628 KB Output is correct
25 Correct 2 ms 1628 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 840 KB Output is correct
29 Correct 8 ms 1372 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 4 ms 1368 KB Output is correct
32 Correct 6 ms 1344 KB Output is correct
33 Correct 5 ms 1372 KB Output is correct
34 Correct 5 ms 3272 KB Output is correct
35 Correct 6 ms 3268 KB Output is correct
36 Correct 9 ms 1508 KB Output is correct
37 Correct 6 ms 1380 KB Output is correct
38 Correct 6 ms 1372 KB Output is correct
39 Correct 59 ms 9308 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 7 ms 3748 KB Output is correct
42 Correct 9 ms 1624 KB Output is correct
43 Correct 9 ms 3420 KB Output is correct
44 Correct 27 ms 6148 KB Output is correct
45 Correct 31 ms 6724 KB Output is correct
46 Correct 33 ms 9556 KB Output is correct
47 Correct 73 ms 9308 KB Output is correct
48 Correct 58 ms 9404 KB Output is correct
49 Correct 42 ms 28320 KB Output is correct
50 Correct 54 ms 28320 KB Output is correct
51 Correct 68 ms 9808 KB Output is correct
52 Correct 69 ms 9560 KB Output is correct
53 Correct 59 ms 9308 KB Output is correct
54 Incorrect 0 ms 348 KB Output isn't correct
55 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 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 408 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 2 ms 604 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 2 ms 728 KB Output is correct
24 Correct 2 ms 1628 KB Output is correct
25 Correct 2 ms 1628 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 840 KB Output is correct
29 Correct 8 ms 1372 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 4 ms 1368 KB Output is correct
32 Correct 6 ms 1344 KB Output is correct
33 Correct 5 ms 1372 KB Output is correct
34 Correct 5 ms 3272 KB Output is correct
35 Correct 6 ms 3268 KB Output is correct
36 Correct 9 ms 1508 KB Output is correct
37 Correct 6 ms 1380 KB Output is correct
38 Correct 6 ms 1372 KB Output is correct
39 Correct 59 ms 9308 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 7 ms 3748 KB Output is correct
42 Correct 9 ms 1624 KB Output is correct
43 Correct 9 ms 3420 KB Output is correct
44 Correct 27 ms 6148 KB Output is correct
45 Correct 31 ms 6724 KB Output is correct
46 Correct 33 ms 9556 KB Output is correct
47 Correct 73 ms 9308 KB Output is correct
48 Correct 58 ms 9404 KB Output is correct
49 Correct 42 ms 28320 KB Output is correct
50 Correct 54 ms 28320 KB Output is correct
51 Correct 68 ms 9808 KB Output is correct
52 Correct 69 ms 9560 KB Output is correct
53 Correct 59 ms 9308 KB Output is correct
54 Incorrect 0 ms 348 KB Output isn't correct
55 Halted 0 ms 0 KB -