oj.uz

Submission #46024

# Submission time Handle Problem Language Result Execution time Memory
46024 2018-04-17T03:18:20 Z RockyB Robots (APIO13_robots) C++17
30 / 100
 326 ms 163840 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)200 + 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;

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 (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] = go(x + dx[t], y + dy[t], t);
	return res[x][y][t] = {x, y};
}

int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	//cout << (2 * sizeof(dp) + sizeof(res) + sizeof(was) + sizeof(a)) / sqr(1024);
	//ioi
	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;

			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 = inf;
	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 >= inf) ans = -1;
	cout << ans;
	ioi
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 87544 KB Output is correct
2 Correct 62 ms 87712 KB Output is correct
3 Correct 61 ms 87732 KB Output is correct
4 Correct 62 ms 87788 KB Output is correct
5 Correct 75 ms 87788 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 87544 KB Output is correct
2 Correct 62 ms 87712 KB Output is correct
3 Correct 61 ms 87732 KB Output is correct
4 Correct 62 ms 87788 KB Output is correct
5 Correct 75 ms 87788 KB Output is correct
6 Correct 61 ms 87788 KB Output is correct
7 Correct 62 ms 87788 KB Output is correct
8 Correct 72 ms 87788 KB Output is correct
9 Correct 62 ms 87800 KB Output is correct
10 Correct 62 ms 87800 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 87544 KB Output is correct
2 Correct 62 ms 87712 KB Output is correct
3 Correct 61 ms 87732 KB Output is correct
4 Correct 62 ms 87788 KB Output is correct
5 Correct 75 ms 87788 KB Output is correct
6 Correct 61 ms 87788 KB Output is correct
7 Correct 62 ms 87788 KB Output is correct
8 Correct 72 ms 87788 KB Output is correct
9 Correct 62 ms 87800 KB Output is correct
10 Correct 62 ms 87800 KB Output is correct
11 Runtime error 326 ms 163840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 87544 KB Output is correct
2 Correct 62 ms 87712 KB Output is correct
3 Correct 61 ms 87732 KB Output is correct
4 Correct 62 ms 87788 KB Output is correct
5 Correct 75 ms 87788 KB Output is correct
6 Correct 61 ms 87788 KB Output is correct
7 Correct 62 ms 87788 KB Output is correct
8 Correct 72 ms 87788 KB Output is correct
9 Correct 62 ms 87800 KB Output is correct
10 Correct 62 ms 87800 KB Output is correct
11 Runtime error 326 ms 163840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -