제출 #46065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46065		RockyB	로봇 (APIO13_robots)	C++17	0 / 100	50 ms	68296 KiB

robots

/// In The Name Of God

#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb emplace_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)500 + 1;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m, h;
char a[N][N];

int dp[N][N][55];
int id[10][10];

pair <int, int> res[N][N][4];
bool was[N][N][4];

struct node {
	int l, r, x, y;
	node() {}
	node(int l, int r, int x, int y) : l(l), r(r), x(x), y(y) {}
};

vector <node> q[N * N];

bool check(int x, int y) {
	return 0 <= x && x < n && 0 <= y && y < m && a[x][y] != 'x';
}
pair <int, int> goo(int x, int y, int t) {
	if (a[x][y] == 'C') t = (t + 1) % 4;
	if (a[x][y] == 'A') t = (((t - 1) + 4) % 4);
	if (was[x][y][t]) return res[x][y][t];
	was[x][y][t] = 1;
	if (check(x + dx[t], y + dy[t])) return res[x][y][t] = goo(x + dx[t], y + dy[t], t);
	return res[x][y][t] = {x, y};
}
void upd(int &x, int y) {
	x = min(x, y);
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> h >> m >> n;

	int tmr = 0;
	for (int i = 0; i <= h; i++) {
		for (int j = i; j <= h; j++) {
			id[i][j] = tmr++;
		}
	}

	memset(dp, 0x3f, sizeof(dp));

	for (int i = 0; i < n; i++) {
		cin >> a[i];
		for (int j = 0; j < m; j++) {
			if (isdigit(a[i][j])) {
				int d = a[i][j] - '1';
				dp[i][j][id[d][d]] = 0;
				q[0].pb(node(d, d, i, j));
			}
		}
	}	
	memset(res, -1, sizeof(res));
	for (int len = 1; len <= h; len++) {
		for (int l = 0; l + len - 1 < h; l++) {
			int r = l + len - 1;
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					for (int t = 0; t < 4; t++) {
						pair <int, int> go = goo(i, j, t);
						if (go.f == -1) continue;
						int add = mp(i, j) != go;
						upd(dp[go.f][go.s][id[l][r]], dp[i][j][id[l][r]] + add);
						for (int to = r + 1; to < h; to++) {
							upd(dp[go.f][go.s][id[l][to]], dp[i][j][id[l][r]] + dp[go.f][go.s][id[r + 1][to]] + add);
						}
						for (int to = 0; to < l; to++) {
							upd(dp[go.f][go.s][id[to][r]], dp[i][j][id[l][r]] + dp[go.f][go.s][id[to][l - 1]] + add);
						}
					}
				}
			}
		}
	}


	int ans = inf;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			ans = min(ans, dp[i][j][id[0][h - 1]]);
		}
	}
	if (ans >= inf) ans = -1;
	cout << ans;
	ioi
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40