oj.uz

Submission #46077

# Submission time Handle Problem Language Result Execution time Memory
46077 2018-04-17T05:18:01 Z RockyB Robots (APIO13_robots) C++11
30 / 100
 1500 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 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;
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;
	inline node() {}
	inline node(int l, int r, int x, int y) : l(l), r(r), x(x), y(y) {}
};

vector <node> q[N * N];

inline bool check(int x, int y) {
	return 0 <= x && x < n && 0 <= y && y < m && a[x][y] != 'x';
}
inline 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
	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++;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			for (int c = 0; c < tmr; c++) 
			dp[i][j][c] = inf;
		}
	}

	memset(res, -1, sizeof(res));

	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));
			}
		}
	}	
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (check(i, j)) {
				for (int t = 0; t < 4; t++) go(i, j, t);
			}
		}
	}
	int to = n * m;
	for (int cur = 0; cur <= to; ++cur) {
		for (auto v : q[cur]) {
			if (v.l == 0 && v.r == h - 1) cout << cur, ioi

			for (int t = 0; t < 4; ++t) {
				pair <int, int> &to = res[v.x][v.y][t];
				if (to.f == -1) continue;


				int add = mp(v.x, v.y) != to;
				//if (mp(v.x, v.y) == to) assert(0);

				int &up1 = dp[to.f][to.s][id[v.l][v.r]];
				if (up1 > cur + add) {
					up1 = cur + add;
					q[up1].pb(node(v.l, v.r, to.f, to.s));
				}
				for (int i = v.r + 1; i < h; ++i) {
					int cost = cur + dp[to.f][to.s][id[v.r + 1][i]] + add;
					int &up2 = dp[to.f][to.s][id[v.l][i]];
					if (up2 > cost) {
						up2 = cost;
						q[up2].pb(node(v.l, i, to.f, to.s));
					}
				}
				for (int i = v.l - 1; i >= 0; --i) {
					int cost = cur + dp[to.f][to.s][id[i][v.l - 1]] + add;
					int &up3 = dp[to.f][to.s][id[i][v.r]];
					if (up3 > cost) {
						up3 = cost;
						q[up3].pb(node(i, v.r, to.f, to.s));
					}
				}
			}
		}
		if (sz(q[cur])) q[cur].clear();
	}
	cout << -1;
	ioi
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 13 ms 14132 KB Output is correct
3 Correct 13 ms 14132 KB Output is correct
4 Correct 15 ms 14156 KB Output is correct
5 Correct 14 ms 14172 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 13 ms 14132 KB Output is correct
3 Correct 13 ms 14132 KB Output is correct
4 Correct 15 ms 14156 KB Output is correct
5 Correct 14 ms 14172 KB Output is correct
6 Correct 13 ms 14184 KB Output is correct
7 Correct 13 ms 14184 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 13 ms 14216 KB Output is correct
10 Correct 13 ms 14344 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 13 ms 14132 KB Output is correct
3 Correct 13 ms 14132 KB Output is correct
4 Correct 15 ms 14156 KB Output is correct
5 Correct 14 ms 14172 KB Output is correct
6 Correct 13 ms 14184 KB Output is correct
7 Correct 13 ms 14184 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 13 ms 14216 KB Output is correct
10 Correct 13 ms 14344 KB Output is correct
11 Correct 448 ms 66524 KB Output is correct
12 Correct 29 ms 66524 KB Output is correct
13 Correct 32 ms 66524 KB Output is correct
14 Execution timed out 1596 ms 163840 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 13 ms 14132 KB Output is correct
3 Correct 13 ms 14132 KB Output is correct
4 Correct 15 ms 14156 KB Output is correct
5 Correct 14 ms 14172 KB Output is correct
6 Correct 13 ms 14184 KB Output is correct
7 Correct 13 ms 14184 KB Output is correct
8 Correct 13 ms 14208 KB Output is correct
9 Correct 13 ms 14216 KB Output is correct
10 Correct 13 ms 14344 KB Output is correct
11 Correct 448 ms 66524 KB Output is correct
12 Correct 29 ms 66524 KB Output is correct
13 Correct 32 ms 66524 KB Output is correct
14 Execution timed out 1596 ms 163840 KB Time limit exceeded
15 Halted 0 ms 0 KB -