oj.uz

Submission #1046190

# Submission time Handle Problem Language Result Execution time Memory
1046190 2024-08-06T11:21:46 Z lozergam Maze (JOI23_ho_t3) C++17
35 / 100
 2000 ms 408124 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#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>

const ll INF = 1e18;
vector<vector<bool>> a, vis;
arr(2) s, e;
ll n, m, k;
ll ans;
vector<arr(2)> v, g;
vector<set<ll>> row, col;
ll cnt;

void bfs()
{
    cnt++;
    // debug(cnt);
	while(!v.empty())
	{
		auto x = v.back();
        // debug(x[0]);
        // debug(x[1]);
		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);
	row.resize(n + 1);
	col.resize(m + 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;
				
			row[i].insert(j);
			col[j].insert(i);
		}
        
	For(i, n + 1)
		row[i].insert(INF);
	For(i, m + 1)
		col[i].insert(INF);
	
	v.pb(s);
	vis[s[0]][s[1]] = 1;

// 2 4 2
// 1 1
// 2 4
// .###
// ###.

	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, 1ll);
			r[1] = min(x[0] + k - 1, n);
			c[0] = max(x[1] - k + 1, 1ll);
			c[1] = min(x[1] + k - 1, m);
			
			// debug(x[0]);
			// debug(x[1]);
			// debug(r[0]);
			// debug(r[1]);
			// debug(c[0]);
			// debug(c[1]);
			// debug(endl);

			auto it = row[r[0]].lower_bound(c[0]);
			
			while((*it) <= c[1])
			{
				if(!vis[r[0]][(*it)])
				{
					vis[r[0]][(*it)] = 1;
					v.pb({r[0], (*it)});
				}
				
				row[r[0]].erase(it);
				it = row[r[0]].lower_bound(c[0]);
			}
			
			it = row[r[1]].lower_bound(c[0]);
			
			while((*it) <= c[1])
			{
				if(!vis[r[1]][(*it)])
				{
					vis[r[1]][(*it)] = 1;
					v.pb({r[1], (*it)});
				}
				
				row[r[1]].erase(it);
				it = row[r[1]].lower_bound(c[0]);
			}
			
			it = col[c[0]].lower_bound(r[0]);
			
			while((*it) <= r[1])
			{
				if(!vis[(*it)][c[0]])
				{
					vis[(*it)][c[0]] = 1;
					v.pb({(*it), c[0]});
				}
				
				col[c[0]].erase(it);
				it = col[c[0]].lower_bound(r[0]);
			}
			
			it = col[c[1]].lower_bound(r[0]);
			
			while((*it) <= r[1])
			{
				if(!vis[(*it)][c[1]])
				{
					vis[(*it)][c[1]] = 1;
					v.pb({(*it), c[1]});
				}
				
				col[c[1]].erase(it);
				it = col[c[1]].lower_bound(r[0]);
			}
			
			v.pb(x);
			vis[x[0]][x[1]] = 1;
			
			if(e[0] >= r[0] and e[0] <= r[1] and e[1] >= c[0] and e[1] <= c[1])
				vis[e[0]][e[1]] = 1;
		}
		
		g.clear();
		
		ans++;
	}
	
	cout << ans << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:90:2: note: in expansion of macro 'For'
   90 |  For(i, n + 1)
      |  ^~~
Main.cpp:7:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    7 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:96:3: note: in expansion of macro 'For'
   96 |   For(j, m + 1)
      |   ^~~
Main.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:118:2: note: in expansion of macro 'For'
  118 |  For(i, n + 1)
      |  ^~~
Main.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define For(i, n) for(int (i) = 0; (i) < (n); (i)++)
      |                           ^
Main.cpp:120:2: note: in expansion of macro 'For'
  120 |  For(i, m + 1)
      |  ^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 868 ms 401632 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 18 ms 12580 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 604 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 344 KB Output is correct
12 Correct 0 ms 344 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 1 ms 604 KB Output is correct
18 Correct 1 ms 708 KB Output is correct
19 Execution timed out 2095 ms 408012 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
19.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 863 ms 400104 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 18 ms 12976 KB Output is correct
12 Correct 1 ms 344 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 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 1 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 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 856 KB Output is correct

Subtask #3
16.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 604 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 604 KB Output is correct
12 Correct 0 ms 604 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 452 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 344 KB Output is correct
21 Correct 1 ms 344 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 712 KB Output is correct
25 Correct 7 ms 4188 KB Output is correct
26 Correct 9 ms 6360 KB Output is correct
27 Correct 10 ms 6656 KB Output is correct
28 Correct 10 ms 6884 KB Output is correct
29 Correct 12 ms 6232 KB Output is correct
30 Correct 10 ms 6236 KB Output is correct
31 Correct 10 ms 6460 KB Output is correct
32 Correct 10 ms 6380 KB Output is correct
33 Correct 10 ms 6252 KB Output is correct
34 Correct 21 ms 14356 KB Output is correct
35 Correct 28 ms 15828 KB Output is correct
36 Correct 26 ms 15820 KB Output is correct
37 Correct 25 ms 14940 KB Output is correct
38 Correct 29 ms 14676 KB Output is correct
39 Correct 108 ms 53428 KB Output is correct
40 Correct 354 ms 146756 KB Output is correct
41 Correct 385 ms 154540 KB Output is correct
42 Correct 397 ms 153668 KB Output is correct
43 Correct 363 ms 143956 KB Output is correct
44 Correct 361 ms 143952 KB Output is correct
45 Correct 452 ms 180664 KB Output is correct
46 Correct 410 ms 180132 KB Output is correct

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 863 ms 400104 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 18 ms 12976 KB Output is correct
12 Correct 1 ms 344 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 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 1 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 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Execution timed out 2044 ms 408124 KB Time limit exceeded
34 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 863 ms 400104 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 18 ms 12976 KB Output is correct
12 Correct 1 ms 344 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 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 1 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 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Execution timed out 2044 ms 408124 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 868 ms 401632 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 18 ms 12580 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 604 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 344 KB Output is correct
12 Correct 0 ms 344 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 1 ms 604 KB Output is correct
18 Correct 1 ms 708 KB Output is correct
19 Execution timed out 2095 ms 408012 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 868 ms 401632 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 18 ms 12580 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 604 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 344 KB Output is correct
12 Correct 0 ms 344 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 1 ms 604 KB Output is correct
18 Correct 1 ms 708 KB Output is correct
19 Execution timed out 2095 ms 408012 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 868 ms 401632 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 18 ms 12580 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 604 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 344 KB Output is correct
12 Correct 0 ms 344 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 1 ms 604 KB Output is correct
18 Correct 1 ms 708 KB Output is correct
19 Execution timed out 2095 ms 408012 KB Time limit exceeded
20 Halted 0 ms 0 KB -