oj.uz

Submission #1046982

# Submission time Handle Problem Language Result Execution time Memory
1046982 2024-08-07T07:19:10 Z lozergam Maze (JOI23_ho_t3) C++17
8 / 100
 49 ms 11612 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll int
#define pb push_back
#define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define debug(x) cout << #x << " : " << x << endl << flush
#define endl '\n'
#define sz(x) (ll)x.size()
#define arr(x) array<ll, x>
#define insert emplace
 
arr(2) s, e;
ll n, m, k;
ll ans;
arr(2) v[6000000], g[6000000];
ll pv = -1, pg = -1;

int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 
  	mt19937 mt(time(nullptr));  
 
	cin >> n >> m >> k;
	
	bool a[n + 1][m + 1], vis[n + 1][m + 1];
	
	For(i, n + 1)
		For(j, m + 1)
			vis[i][j] = 0;
	
	cin >> s[0] >> s[1];
	cin >> e[0] >> e[1];
	
	for(int i = 1;i <= n; i++)
		for(int j = 1;j <= m; j++)
		{
			char c;
			cin >> c;
			
			if(c == '.')
				a[i][j] = 0;
			else 
				a[i][j] = 1;
		}
	
	v[++pv] = s;
	vis[s[0]][s[1]] = 1;
 
	while(1)
	{
		while(pv != -1)
		{
			auto x = v[pv];
			if(x[0] == e[0] and x[1] == e[1])
				break;
			pv--;
			
			if(x[0] != 1 and !vis[x[0] - 1][x[1]])
			{
				if(a[x[0] - 1][x[1]])
					g[++pg] = {x[0] - 1, x[1]};
				else
	            {
	                vis[x[0] - 1][x[1]] = 1;
					v[++pv] = {x[0] - 1, x[1]};
	            }
			}
			
			if(x[0] != n and !vis[x[0] + 1][x[1]])
			{
				if(a[x[0] + 1][x[1]])
					g[++pg] = {x[0] + 1, x[1]};
				else
	            {
					v[++pv] = {x[0] + 1, x[1]};
	                vis[x[0] + 1][x[1]] = 1;
	            }
			}
			
			if(x[1] != 1 and !vis[x[0]][x[1] - 1])
			{
				if(a[x[0]][x[1] - 1])
					g[++pg] = {x[0], x[1] - 1};
				else
	            {
					v[++pv] = {x[0], x[1] - 1};
	                vis[x[0]][x[1] - 1] = 1;
	            }
			}
			
			if(x[1] != m and !vis[x[0]][x[1] + 1])
			{
				if(a[x[0]][x[1] + 1])
					g[++pg] = {x[0], x[1] + 1};
				else
	            {
					v[++pv] = {x[0], x[1] + 1};
	                vis[x[0]][x[1] + 1] = 1;
	            }
			}
		}
		
		if(vis[e[0]][e[1]])
			break;
		
		while(pg >= 0)
		{
			arr(2) x = g[pg];
			arr(2) r, c;
			
			r[0] = max(x[0] - k + 1, 1);
			r[1] = min(x[0] + k - 1, n);
			c[0] = max(x[1] - k + 1, 1);
			c[1] = min(x[1] + k - 1, m);
 
			if(e[0] >= r[0] and e[0] <= r[1] and e[1] >= c[0] and e[1] <= c[1])
			{
				cout << ans + 1 << endl;
				return 0;
			}
			
			For(i, 2)
				For(j, 2)
					if(!vis[r[i]][c[j]])
					{
						v[++pv] = {r[i], c[j]};
						vis[r[i]][c[j]] = 1;
					}
			
								
			ll m = 120;
						
			if(k != 1)
			{
				For(i, m)
				{
					long long rn = mt();
					For(j, 2)
					{
						rn *= rn;
						ll t = rn % (c[1] - c[0]) + c[0];
						if(!vis[r[j]][t])
						{
							v[++pv] = {r[j], t};
							vis[r[j]][t] = 1;
						}
					}
				
					For(j, 2)
					{
						rn *= rn;
						ll t = rn % (r[1] - r[0]) + r[0];
						if(!vis[t][c[j]])
						{
							v[++pv] = {t, c[j]};
							vis[t][c[j]] = 1;
						}
					}
				}
			}
			pg--;
		}
		
		pg = -1;
		
		ans++;
	}
	
	cout << ans << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:32:2: note: in expansion of macro 'For'
   32 |  For(i, n + 1)
      |  ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:33:3: note: in expansion of macro 'For'
   33 |   For(j, m + 1)
      |   ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:127:4: note: in expansion of macro 'For'
  127 |    For(i, 2)
      |    ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:128:5: note: in expansion of macro 'For'
  128 |     For(j, 2)
      |     ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:140:5: note: in expansion of macro 'For'
  140 |     For(i, m)
      |     ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:143:6: note: in expansion of macro 'For'
  143 |      For(j, 2)
      |      ^~~
Main.cpp:9:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    9 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:154:6: note: in expansion of macro 'For'
  154 |      For(j, 2)
      |      ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 5 ms 2652 KB Output is correct
30 Correct 1 ms 2700 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 5 ms 2652 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 4 ms 2908 KB Output is correct
36 Correct 4 ms 2908 KB Output is correct
37 Correct 4 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 49 ms 5480 KB Output is correct
40 Correct 3 ms 2648 KB Output is correct
41 Correct 2 ms 3228 KB Output is correct
42 Correct 7 ms 2904 KB Output is correct
43 Correct 4 ms 3164 KB Output is correct
44 Correct 11 ms 4188 KB Output is correct
45 Correct 12 ms 4396 KB Output is correct
46 Correct 19 ms 11612 KB Output is correct
47 Correct 43 ms 5504 KB Output is correct
48 Correct 31 ms 5464 KB Output is correct
49 Correct 16 ms 8384 KB Output is correct
50 Correct 21 ms 8384 KB Output is correct
51 Correct 35 ms 7608 KB Output is correct
52 Correct 27 ms 5468 KB Output is correct
53 Correct 36 ms 5468 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Incorrect 1 ms 2520 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 5 ms 2652 KB Output is correct
30 Correct 1 ms 2700 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 5 ms 2652 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 4 ms 2908 KB Output is correct
36 Correct 4 ms 2908 KB Output is correct
37 Correct 4 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 49 ms 5480 KB Output is correct
40 Correct 3 ms 2648 KB Output is correct
41 Correct 2 ms 3228 KB Output is correct
42 Correct 7 ms 2904 KB Output is correct
43 Correct 4 ms 3164 KB Output is correct
44 Correct 11 ms 4188 KB Output is correct
45 Correct 12 ms 4396 KB Output is correct
46 Correct 19 ms 11612 KB Output is correct
47 Correct 43 ms 5504 KB Output is correct
48 Correct 31 ms 5464 KB Output is correct
49 Correct 16 ms 8384 KB Output is correct
50 Correct 21 ms 8384 KB Output is correct
51 Correct 35 ms 7608 KB Output is correct
52 Correct 27 ms 5468 KB Output is correct
53 Correct 36 ms 5468 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 2396 KB Output is correct
59 Correct 0 ms 2396 KB Output is correct
60 Correct 0 ms 2396 KB Output is correct
61 Incorrect 1 ms 2396 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 5 ms 2652 KB Output is correct
30 Correct 1 ms 2700 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 5 ms 2652 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 4 ms 2908 KB Output is correct
36 Correct 4 ms 2908 KB Output is correct
37 Correct 4 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 49 ms 5480 KB Output is correct
40 Correct 3 ms 2648 KB Output is correct
41 Correct 2 ms 3228 KB Output is correct
42 Correct 7 ms 2904 KB Output is correct
43 Correct 4 ms 3164 KB Output is correct
44 Correct 11 ms 4188 KB Output is correct
45 Correct 12 ms 4396 KB Output is correct
46 Correct 19 ms 11612 KB Output is correct
47 Correct 43 ms 5504 KB Output is correct
48 Correct 31 ms 5464 KB Output is correct
49 Correct 16 ms 8384 KB Output is correct
50 Correct 21 ms 8384 KB Output is correct
51 Correct 35 ms 7608 KB Output is correct
52 Correct 27 ms 5468 KB Output is correct
53 Correct 36 ms 5468 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 2396 KB Output is correct
59 Correct 0 ms 2396 KB Output is correct
60 Correct 0 ms 2396 KB Output is correct
61 Incorrect 1 ms 2396 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 5 ms 2652 KB Output is correct
30 Correct 1 ms 2700 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 5 ms 2652 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 4 ms 2908 KB Output is correct
36 Correct 4 ms 2908 KB Output is correct
37 Correct 4 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 49 ms 5480 KB Output is correct
40 Correct 3 ms 2648 KB Output is correct
41 Correct 2 ms 3228 KB Output is correct
42 Correct 7 ms 2904 KB Output is correct
43 Correct 4 ms 3164 KB Output is correct
44 Correct 11 ms 4188 KB Output is correct
45 Correct 12 ms 4396 KB Output is correct
46 Correct 19 ms 11612 KB Output is correct
47 Correct 43 ms 5504 KB Output is correct
48 Correct 31 ms 5464 KB Output is correct
49 Correct 16 ms 8384 KB Output is correct
50 Correct 21 ms 8384 KB Output is correct
51 Correct 35 ms 7608 KB Output is correct
52 Correct 27 ms 5468 KB Output is correct
53 Correct 36 ms 5468 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 2396 KB Output is correct
59 Correct 0 ms 2396 KB Output is correct
60 Correct 0 ms 2396 KB Output is correct
61 Incorrect 1 ms 2396 KB Output isn't correct
62 Halted 0 ms 0 KB -