oj.uz

Submission #969893

# Submission time Handle Problem Language Result Execution time Memory
969893 2024-04-25T18:36:05 Z Halym2007 Robots (APIO13_robots) C++17
30 / 100
 110 ms 79624 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 5;
#define ff first
#define ss second
#define pii pair <int, int>
#define pb push_back
char a[N][N];
queue <pii> q;

// yokary saga asak cepe
int aa[] = {-1, 0, 1, 0};
int bb[] = {0, 1, 0, -1};
int n, h, w, state[N][N][4], dis[N][N][10], dp[N][N][10][10];
bool vis[N][N][10];
pii val[N][N][4];
vector <pii> v[N];

pii ugur (int x, int y, int typ) {
	if (a[x][y] == 'A') typ--;
	else if (a[x][y] == 'C') typ++;
	typ += 4;typ %= 4;
	
	if (state[x][y][typ] == 2) return val[x][y][typ];
	else if (state[x][y][typ] == 1) {
		return {-1, -1};
	}
	state[x][y][typ] = 1;
	int new_x = x + aa[typ], new_y = y + bb[typ];
	if (new_x < 1 or new_y < 1 or new_x > h or new_y > w or a[new_x][new_y] == 'x') {
		val[x][y][typ] = {x, y};
	}
	else {
		val[x][y][typ] = ugur (new_x, new_y, typ);
	}
	state[x][y][typ] = 2;
	return val[x][y][typ];
}


void solve (int x, int y, int typ) {
	dis[x][y][typ] = 0;
	vis[x][y][typ] = 1;
	q.push ({x, y});
	while (!q.empty()) {
		pii a1 = q.front();
//		cout << a1.ff << " " << a1.ss << "\n";
		q.pop();
		for (int i = 0; i < 4; ++i) {
			pii tr = ugur (a1.ff, a1.ss, i);
			if (tr.ff != -1 and tr.ss != -1) {
				if (vis[tr.ff][tr.ss][typ]) continue;
				vis[tr.ff][tr.ss][typ] = 1;
				dis[tr.ff][tr.ss][typ] = dis[a1.ff][a1.ss][typ] + 1;
				q.push({tr.ff, tr.ss});
			}
		}
	}
}

int main () {
//	ios::sync_with_stdio(0);cin.tie(0);
//	freopen ("input.txt", "r", zstdin);
	
	cin >> n >> w >> h;
	for (int i = 1; i <= h; ++i) {
		for (int j = 1; j <= w; ++j) {
			cin >> a[i][j];
		}
	}
//	cout << ugur (1, 1, 2).ff << " " << ugur(1, 1, 2).ss;
//	return 0;
	for (int i = 1; i <= h; ++i) {
		for (int j = 1; j <= w; ++j) {
			for (int k = 1; k <= n; ++k) {
				dis[i][j][k] = 1e9;
			}
		}
	}
	for (int i = 1; i <= h; ++i) {
		for (int j = 1; j <= w; ++j) {
			if (a[i][j] >= '1' and a[i][j] <= '9') {
				dis[i][j][int(a[i][j] - 48)] = 0;
				solve (i, j, int(a[i][j] - 48));
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = i; j <= n; ++j) {
			for (int l = 1; l <= h; ++l) {
				for (int r = 1; r <= w; ++r) {
					dp[l][r][i][j] = 1e9;
				}
			}
		}
	}
//	return cout << dis[1][10][2], 0;
//	cout << "vvv-> " << dis[1][7][4] << "\n";
//	return 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j + i - 1 <= n; ++j) {
			int git = j + i - 1;
			if (i == 1) {
				for (int l = 1; l <= h; ++l) {
					for (int r = 1; r <= w; ++r) {
						dp[l][r][j][j] = dis[l][r][j];
					}
				}
//				if (i == 1 and j == 2) {
//					cout << "oo : ->" << dp[1][10][2][2];
//					return 0;
//				}
				continue;
			}
			// tapmaly dp[l][r][j][git]
//			cout << dp[1][10][1][2];
//			return 0;
			for (int k = 0; k < N; ++k) v[i].clear();
			for (int l = 1; l <= h; ++l) {
				for (int r = 1; r <= w; ++r) {
					for (int k = j; k < git; ++k) {
						int sym = dp[l][r][j][k] + dp[l][r][k + 1][git];
						dp[l][r][j][git] = min (dp[l][r][j][git], sym);
						if (sym < N) 
							v[sym].pb ({l, r});
					}
				}
			}
//			if (j == 3 and git == 4) {
//				cout << "lkl ";
//				cout << j << " " << git << " " << dp[1][7][j][git];
//				return 0;
//			}
			for (int k = 1; k < N; ++k) {
				for (pii x : v[k]) {
					for (int l = 0; l < 4; ++l) {
						pii new_x = ugur (x.ff, x.ss, l);
//						if (j == 1 and i == 2) {
//							cout << new_x.ff << " " << new_x.ss << " " << dp[new_x.ff][new_x.ss][j][git] + 1 << "\n";
//							return 0;
//						}
						if (new_x.ff != -1 and new_x.ss != -1) {
//							assert (k == dp[x.ff][x.ss][j][git]);
							if (dp[x.ff][x.ss][j][git] > dp[new_x.ff][new_x.ss][j][git] + 1) {
								dp[x.ff][x.ss][j][git] = dp[new_x.ff][new_x.ss][j][git] + 1;
							}
						}
					}
//					if (j == 1 and i == 2) {
//						return 0;		
//					}
				}
			}
//			if (j == 1 and i == 2) {
//				cout << j << " " << git << " " << dp[1][1][j][git];
//				return 0;
//			}
		}
	}
//	cout << dp[1][7][3][4];
//	return 0;
	int jogap = 1e9;
	for (int i = 1; i <= h; ++i) {
		for (int j = 1; j <= w; ++j) {
			jogap = min (jogap, dp[i][j][1][n]);
		}
	}
	if (jogap == 1e9) jogap = -1;
	cout << jogap;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Incorrect 110 ms 79624 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Incorrect 110 ms 79624 KB Output isn't correct
12 Halted 0 ms 0 KB -