oj.uz

Submission #1046893

# Submission time Handle Problem Language Result Execution time Memory
1046893 2024-08-07T05:57:38 Z lozergam Maze (JOI23_ho_t3) C++17
8 / 100
 56 ms 7640 KB 
#pragma GCC optimize("Ofast")
#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
 
vector<vector<bool>> a, vis;
arr(2) s, e;
ll n, m, k;
ll ans;
vector<arr(2)> v, g;
 
inline void bfs()
{
	while(!v.empty())
	{
		auto x = v.back();
		v.pop_back();
		
		if(x[0] != 1 and !vis[x[0] - 1][x[1]])
		{
			if(a[x[0] - 1][x[1]])
				g.pb({x[0] - 1, x[1]});
			else
            {
                vis[x[0] - 1][x[1]] = 1;
				v.pb({x[0] - 1, x[1]});
            }
		}
		
		if(x[0] != n and !vis[x[0] + 1][x[1]])
		{
			if(a[x[0] + 1][x[1]])
				g.pb({x[0] + 1, x[1]});
			else
            {
				v.pb({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.pb({x[0], x[1] - 1});
			else
            {
				v.pb({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.pb({x[0], x[1] + 1});
			else
            {
				v.pb({x[0], x[1] + 1});
                vis[x[0]][x[1] + 1] = 1;
            }
		}
	}
}
 
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);
	
	cin >> n >> m >> k;
	
	a.resize(n + 1);
	vis.resize(n + 1);
	
	For(i, n + 1)
	{
		a[i].resize(m + 1, 0);
		
		vis[i].resize(m + 1, 0);
		
		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.pb(s);
	vis[s[0]][s[1]] = 1;
 
	while(1)
	{
		bfs();
		
		if(vis[e[0]][e[1]])
			break;
		
		for(auto x : g)
		{
			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.pb({r[i], c[j]});
						vis[r[i]][c[j]] = 1;
					}
					
			ll m = 150;
						
			if(k != 1)
			{
				For(i, m)
				{
					ll t = rand() % (c[1] - c[0]) + c[0];
					For(j, 2)
					{
						if(!vis[r[j]][t])
						{
							v.pb({r[j], t});
							vis[r[j]][t] = 1;
						}
						if(!vis[t][c[j]])
						{
							v.pb({t, c[j]});
							vis[t][c[j]] = 1;
						}
					}
				}
			}
		}
		
		g.clear();
		
		ans++;
	}
	
	cout << ans << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:83:2: note: in expansion of macro 'For'
   83 |  For(i, n + 1)
      |  ^~~
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:89:3: note: in expansion of macro 'For'
   89 |   For(j, m + 1)
      |   ^~~
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:133:4: note: in expansion of macro 'For'
  133 |    For(i, 2)
      |    ^~~
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:134:5: note: in expansion of macro 'For'
  134 |     For(j, 2)
      |     ^~~
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:145:5: note: in expansion of macro 'For'
  145 |     For(i, m)
      |     ^~~
Main.cpp:8:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    8 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:148:6: note: in expansion of macro 'For'
  148 |      For(j, 2)
      |      ^~~

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 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 0 ms 348 KB Output is correct
14 Correct 1 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 348 KB Output is correct
20 Correct 1 ms 480 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 576 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 2 ms 984 KB Output is correct
32 Correct 6 ms 604 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 3 ms 528 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 604 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 54 ms 1052 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 8 ms 348 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 17 ms 668 KB Output is correct
45 Correct 15 ms 600 KB Output is correct
46 Correct 23 ms 7640 KB Output is correct
47 Correct 56 ms 1044 KB Output is correct
48 Correct 38 ms 860 KB Output is correct
49 Correct 20 ms 1112 KB Output is correct
50 Correct 24 ms 1116 KB Output is correct
51 Correct 45 ms 1880 KB Output is correct
52 Correct 38 ms 1372 KB Output is correct
53 Correct 42 ms 1136 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 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 Runtime error 0 ms 348 KB Execution killed with signal 11
9 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 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 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 Runtime error 0 ms 604 KB Execution killed with signal 11
15 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 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 Runtime error 0 ms 348 KB Execution killed with signal 11
9 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 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 Runtime error 0 ms 348 KB Execution killed with signal 11
9 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 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 0 ms 348 KB Output is correct
14 Correct 1 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 348 KB Output is correct
20 Correct 1 ms 480 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 576 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 2 ms 984 KB Output is correct
32 Correct 6 ms 604 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 3 ms 528 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 604 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 54 ms 1052 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 8 ms 348 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 17 ms 668 KB Output is correct
45 Correct 15 ms 600 KB Output is correct
46 Correct 23 ms 7640 KB Output is correct
47 Correct 56 ms 1044 KB Output is correct
48 Correct 38 ms 860 KB Output is correct
49 Correct 20 ms 1112 KB Output is correct
50 Correct 24 ms 1116 KB Output is correct
51 Correct 45 ms 1880 KB Output is correct
52 Correct 38 ms 1372 KB Output is correct
53 Correct 42 ms 1136 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 Runtime error 0 ms 348 KB Execution killed with signal 11
62 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 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 0 ms 348 KB Output is correct
14 Correct 1 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 348 KB Output is correct
20 Correct 1 ms 480 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 576 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 2 ms 984 KB Output is correct
32 Correct 6 ms 604 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 3 ms 528 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 604 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 54 ms 1052 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 8 ms 348 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 17 ms 668 KB Output is correct
45 Correct 15 ms 600 KB Output is correct
46 Correct 23 ms 7640 KB Output is correct
47 Correct 56 ms 1044 KB Output is correct
48 Correct 38 ms 860 KB Output is correct
49 Correct 20 ms 1112 KB Output is correct
50 Correct 24 ms 1116 KB Output is correct
51 Correct 45 ms 1880 KB Output is correct
52 Correct 38 ms 1372 KB Output is correct
53 Correct 42 ms 1136 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 Runtime error 0 ms 348 KB Execution killed with signal 11
62 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 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 0 ms 348 KB Output is correct
14 Correct 1 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 348 KB Output is correct
20 Correct 1 ms 480 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 576 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 2 ms 984 KB Output is correct
32 Correct 6 ms 604 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 3 ms 528 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 604 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 54 ms 1052 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 8 ms 348 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 17 ms 668 KB Output is correct
45 Correct 15 ms 600 KB Output is correct
46 Correct 23 ms 7640 KB Output is correct
47 Correct 56 ms 1044 KB Output is correct
48 Correct 38 ms 860 KB Output is correct
49 Correct 20 ms 1112 KB Output is correct
50 Correct 24 ms 1116 KB Output is correct
51 Correct 45 ms 1880 KB Output is correct
52 Correct 38 ms 1372 KB Output is correct
53 Correct 42 ms 1136 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 Runtime error 0 ms 348 KB Execution killed with signal 11
62 Halted 0 ms 0 KB -