oj.uz

답안 #46021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46021 2018-04-17T03:07:21 Z RockyB 로봇 (APIO13_robots) C++11
10 / 100
 7 ms 6252 KB 
/// 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 push_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)30 + 7;
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;

#define int ll

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

int dp[1 << 9][N][N];

struct node {
	int cost, mask, x, y;
	node() {}
	node(int cost, int mask, int x, int y) : cost(cost), mask(mask), x(x), y(y) {}
	bool operator < (node r) const {
		if (cost != r.cost) return cost < r.cost;
		if (mask != r.mask) return mask < r.mask;
		if (x != r.x) return x < r.x;
		return y < r.y;
	}
};

bool check(int x, int y) {
	return 1 <= x && x <= n && 1 <= y && y <= m && a[x][y] != 'x';
}

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

pair <int, int> go(int x, int y, int t) {
	if (was[x][y][t]) return res[x][y][t];
	was[x][y][t] = 1;
	if (a[x][y] == 'C') t = (t + 1) % 4;
	if (a[x][y] == 'A') t = (((t - 1) + 4) % 4);
	if (check(x + dx[t], y + dy[t])) return res[x][y][t] = go(x + dx[t], y + dy[t], t);
	return res[x][y][t] = {x, y};
}

int32_t main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> h >> m >> n;
	memset(dp, 0x3f, sizeof(dp));

	set <node> st;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
			if (isdigit(a[i][j])) {
				int x = a[i][j] - '1';
				dp[1 << x][i][j] = 0;
				st.insert(node(0, 1 << x, i, j));
			}
			dp[0][i][j] = 0;
		}
	}	

	memset(res, -1, sizeof(res));
	while (sz(st)) {
		node v = *st.begin();
		st.erase(st.begin());

		for (int i = 0; i < 4; i++) {
			pair <int, int> to = go(v.x, v.y, i);
			if (to.f == -1) continue;
			if (to.s == -1) assert(0);

			for (int mask = 0; mask < (1 << h); mask++) {
				if (!(mask & v.mask)) {
					int nxt = mask | v.mask, cost = v.cost + dp[mask][to.f][to.s] + 1;
					if (dp[nxt][to.f][to.s] > cost) {
						st.erase({cost, nxt, to.f, to.s});
						dp[nxt][to.f][to.s] = cost;
						st.insert({cost, nxt, to.f, to.s});
					}
				}
			}
		}
	}

	int ans = linf;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			ans = min(ans, dp[(1 << h) - 1][i][j]);
		}
	}

	if (ans >= linf) ans = -1;
	cout << ans;
	ioi
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 7 ms 5992 KB Output is correct
3 Correct 5 ms 5992 KB Output is correct
4 Correct 6 ms 6068 KB Output is correct
5 Correct 6 ms 6124 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 7 ms 5992 KB Output is correct
3 Correct 5 ms 5992 KB Output is correct
4 Correct 6 ms 6068 KB Output is correct
5 Correct 6 ms 6124 KB Output is correct
6 Correct 6 ms 6124 KB Output is correct
7 Correct 6 ms 6124 KB Output is correct
8 Correct 6 ms 6252 KB Output is correct
9 Incorrect 6 ms 6252 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 7 ms 5992 KB Output is correct
3 Correct 5 ms 5992 KB Output is correct
4 Correct 6 ms 6068 KB Output is correct
5 Correct 6 ms 6124 KB Output is correct
6 Correct 6 ms 6124 KB Output is correct
7 Correct 6 ms 6124 KB Output is correct
8 Correct 6 ms 6252 KB Output is correct
9 Incorrect 6 ms 6252 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 7 ms 5992 KB Output is correct
3 Correct 5 ms 5992 KB Output is correct
4 Correct 6 ms 6068 KB Output is correct
5 Correct 6 ms 6124 KB Output is correct
6 Correct 6 ms 6124 KB Output is correct
7 Correct 6 ms 6124 KB Output is correct
8 Correct 6 ms 6252 KB Output is correct
9 Incorrect 6 ms 6252 KB Output isn't correct
10 Halted 0 ms 0 KB -