oj.uz

답안 #32813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
32813 2017-10-15T14:26:33 Z aome Soccer (JOI17_soccer) C++14
100 / 100
 843 ms 28148 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

#define int long long

typedef pair<int, int> ii;
typedef pair<ii, ii> p;
const int N = 505;
const int INF = 1e18;

int h, w;
int n, A, B, C;
int endX, endY;
int res = INF;
int g[N][N];
int f[N][N][5]; 
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
priority_queue<p> pq;

signed main() {
	ios::sync_with_stdio(false);
	cin >> h >> w;
	cin >> A >> B >> C;
	cin >> n;
	for (int i = 0; i <= h; ++i) {
		for (int j = 0; j <= w; ++j) {
			for (int k = 0; k < 5; ++k) {
				f[i][j][k] = INF;
			}
		}
	}
	memset(g, -1, sizeof g);
	queue<ii> qu;
	for (int i = 0; i < n; ++i) {
		int x, y; cin >> x >> y;
		if (!i) {
			f[x][y][4] = 0, pq.push(p(ii(0, 4), ii(x, y)));
		}
		if (i == n - 1) {
			endX = x, endY = y;
		}
		g[x][y] = 0, qu.push(ii(x, y));
	}
	while (qu.size()) {
		int x = qu.front().fi, y = qu.front().se; qu.pop();
		for (int i = 0; i < 4; ++i) {
			int nx = x + dx[i], ny = y + dy[i];
			if (nx < 0 || ny < 0 || nx > h || ny > w) continue;
			if (g[nx][ny] == -1) {
				g[nx][ny] = g[x][y] + 1, qu.push(ii(nx, ny));
			}
		}
	}
	while (pq.size()) {
		int x = pq.top().se.fi, y = pq.top().se.se, F = -pq.top().fi.fi, t = pq.top().fi.se; pq.pop();
		if (F != f[x][y][t]) continue;
		res = min(res, F + (abs(x - endX) + abs(y - endY)) * C);
		if (t != 4 && f[x][y][4] > f[x][y][t] + g[x][y] * C) {
			f[x][y][4] = f[x][y][t] + g[x][y] * C, pq.push(p(ii(-f[x][y][4], 4), ii(x, y)));
		}
		if (t != 4) {
			int nx = x + dx[t], ny = y + dy[t];
			if (nx < 0 || ny < 0 || nx > h || ny > w) {}
			else if (f[nx][ny][t] > f[x][y][t] + A) {
				f[nx][ny][t] = f[x][y][t] + A, pq.push(p(ii(-f[nx][ny][t], t), ii(nx, ny)));
			}
		}
		if (t == 4) {
			for (int i = 0; i < 4; ++i) {
				int nx = x + dx[i], ny = y + dy[i];
				if (nx < 0 || ny < 0 || nx > h || ny > w) continue;
				if (f[nx][ny][4] > f[x][y][4] + C) {
					f[nx][ny][4] = f[x][y][4] + C, pq.push(p(ii(-f[nx][ny][4], 4), ii(nx, ny)));
				}
				if (f[nx][ny][i] > f[x][y][4] + A + B) {
					f[nx][ny][i] = f[x][y][4] + A + B, pq.push(p(ii(-f[nx][ny][i], i), ii(nx, ny)));
				}
			}
		}
	}
	cout << res << '\n';
	// int x, y, t;
	// while (cin >> x >> y >> t) cout << f[x][y][t] << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 17248 KB Output is correct
2 Correct 0 ms 14132 KB Output is correct
3 Correct 556 ms 26472 KB Output is correct
4 Correct 516 ms 26472 KB Output is correct
5 Correct 113 ms 14556 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 539 ms 26504 KB Output is correct
2 Correct 603 ms 26552 KB Output is correct
3 Correct 429 ms 26508 KB Output is correct
4 Correct 466 ms 26484 KB Output is correct
5 Correct 399 ms 26552 KB Output is correct
6 Correct 509 ms 26484 KB Output is correct
7 Correct 549 ms 26640 KB Output is correct
8 Correct 553 ms 26560 KB Output is correct
9 Correct 663 ms 26644 KB Output is correct
10 Correct 103 ms 17344 KB Output is correct
11 Correct 513 ms 26656 KB Output is correct
12 Correct 533 ms 26552 KB Output is correct
13 Correct 323 ms 26484 KB Output is correct
14 Correct 593 ms 26656 KB Output is correct
15 Correct 379 ms 26648 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 17248 KB Output is correct
2 Correct 0 ms 14132 KB Output is correct
3 Correct 556 ms 26472 KB Output is correct
4 Correct 516 ms 26472 KB Output is correct
5 Correct 113 ms 14556 KB Output is correct
6 Correct 539 ms 26504 KB Output is correct
7 Correct 603 ms 26552 KB Output is correct
8 Correct 429 ms 26508 KB Output is correct
9 Correct 466 ms 26484 KB Output is correct
10 Correct 399 ms 26552 KB Output is correct
11 Correct 509 ms 26484 KB Output is correct
12 Correct 549 ms 26640 KB Output is correct
13 Correct 553 ms 26560 KB Output is correct
14 Correct 663 ms 26644 KB Output is correct
15 Correct 103 ms 17344 KB Output is correct
16 Correct 513 ms 26656 KB Output is correct
17 Correct 533 ms 26552 KB Output is correct
18 Correct 323 ms 26484 KB Output is correct
19 Correct 593 ms 26656 KB Output is correct
20 Correct 379 ms 26648 KB Output is correct
21 Correct 153 ms 15752 KB Output is correct
22 Correct 619 ms 26508 KB Output is correct
23 Correct 629 ms 20408 KB Output is correct
24 Correct 676 ms 20688 KB Output is correct
25 Correct 559 ms 26516 KB Output is correct
26 Correct 603 ms 26832 KB Output is correct
27 Correct 303 ms 16248 KB Output is correct
28 Correct 399 ms 16516 KB Output is correct
29 Correct 636 ms 22052 KB Output is correct
30 Correct 336 ms 15852 KB Output is correct
31 Correct 553 ms 26644 KB Output is correct
32 Correct 843 ms 28148 KB Output is correct
33 Correct 473 ms 26484 KB Output is correct
34 Correct 719 ms 26652 KB Output is correct
35 Correct 299 ms 15852 KB Output is correct