oj.uz

Submission #103334

# Submission time Handle Problem Language Result Execution time Memory
103334 2019-03-29T18:46:25 Z luciocf Portals (BOI14_portals) C++14
70 / 100
 205 ms 2856 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 210;

typedef pair<int, int> pii;
typedef pair<int, pii> piii;

int dist[maxn][maxn];
int prox[4][maxn][maxn];
int ox, oy, dx, dy, n, m;

bool mark[maxn][maxn];

char tab[maxn][maxn];

int linha[] = {-1, 1, 0, 0};
int coluna[] = {0, 0, -1, 1};

void bfs(void)
{
	for (int i = 0; i <= n+1; i++)
		for (int j = 0; j <= m+1; j++)
			dist[i][j] = 1e9+10;
 
	dist[ox][oy] = 0;
	priority_queue<piii, vector<piii>, greater<piii>> fila;
 
	fila.push({0, {ox, oy}});
 
	while (!fila.empty())
	{
		int x = fila.top().second.first, y = fila.top().second.second;
		fila.pop();
 
		if (mark[x][y]) continue;
 
		mark[x][y] = true;
 
		for (int i = 0; i < 4; i++)
		{
			int a = x+linha[i], b = y+coluna[i];
			if (a < 0 || a > n+1 || b < 0 || b > m+1 || tab[a][b] == '#') continue;
 
			if (dist[x][y]+1 < dist[a][b])
			{
				dist[a][b] = dist[x][y]+1;
				fila.push({dist[a][b], {a, b}});
			}
		}

		int d = 1e9+10;

		for (int i = prox[0][x][y]; i <= prox[1][x][y]; i++)
			d = min({d, abs(i-x)+abs(prox[2][x][y]-y), abs(i-x)+abs(prox[3][x][y]-y)});

		for (int i = prox[2][x][y]; i <= prox[3][x][y]; i++)
			d = min({d, abs(i-y)+abs(prox[0][x][y]-x), abs(i-y)+abs(prox[1][x][y]-x)});
 
		for (int a = x; a >= 1; a--)
		{
			if (tab[a-1][y] != '#') continue;
 
			if (dist[x][y]+d < dist[a][y])
			{
				dist[a][y] = dist[x][y]+d;
				fila.push({dist[a][y], {a, y}});
			}
 
			break;
		}
 
		for (int a = x; a <= n; a++)
		{
			if (tab[a+1][y] != '#') continue;
 
			if (dist[x][y]+d < dist[a][y])
			{
				dist[a][y] = dist[x][y]+d;
				fila.push({dist[a][y], {a, y}});
			}
 
			break;
		}
 
		for (int b = y; b >= 1; b--)
		{
			if (tab[x][b-1] != '#') continue;
 
			if (dist[x][y]+d < dist[x][b])
			{
				dist[x][b] = dist[x][y]+d;
				fila.push({dist[x][b], {x, b}});
			}
 
			break;
		}
 
		for (int b = y; b <= m; b++)
		{
			if (tab[x][b+1] != '#') continue;
 
			if (dist[x][y]+d < dist[x][b])
			{
				dist[x][b] = dist[x][y]+d;
				fila.push({dist[x][b], {x, b}});
			}
 
			break;
		}
	}
}

int main(void)
{
	scanf("%d %d", &n, &m);

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			scanf(" %c", &tab[i][j]);

			if (tab[i][j] == 'S') ox = i, oy = j;
			if (tab[i][j] == 'C') dx = i, dy = j;
		}
	}

	for (int i = 0; i <= n; i++) tab[i][0] = tab[i][m+1] = '#';
	for (int j = 0; j <= m; j++) tab[0][j] = tab[n+1][j] = '#';

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			for (int a = i-1; a >= 0; a--)
			{
				if (tab[a][j] == '#')
				{
					prox[0][i][j] = a;
					break;
				}
			}

			for (int a = i+1; a <= n+1; a++)
			{
				if (tab[a][j] == '#')
				{
					prox[1][i][j] = a;
					break;
				}
			}

			for (int b = j-1; b >= 0; b--)
			{
				if (tab[i][b] == '#')
				{
					prox[2][i][j] = b;
					break;
				}
			}

			for (int b = j+1; b <= m+1; b++)
			{
				if (tab[i][b] == '#')
				{
					prox[3][i][j] = b;
					break;
				}
			}
		}
	}

	bfs();

	printf("%d\n", dist[dx][dy]);
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:117:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
portals.cpp:123:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c", &tab[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 11 ms 1408 KB Output is correct
6 Correct 13 ms 1280 KB Output is correct
7 Correct 18 ms 1252 KB Output is correct
8 Correct 9 ms 1324 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 356 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 16 ms 1280 KB Output is correct
16 Correct 13 ms 1280 KB Output is correct
17 Correct 14 ms 1280 KB Output is correct
18 Correct 15 ms 1280 KB Output is correct
19 Correct 71 ms 1260 KB Output is correct
20 Correct 65 ms 1376 KB Output is correct
21 Correct 10 ms 1252 KB Output is correct
22 Correct 12 ms 1280 KB Output is correct
23 Correct 12 ms 1284 KB Output is correct
24 Correct 78 ms 1344 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 4 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 10 ms 1280 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 11 ms 1280 KB Output is correct
15 Correct 13 ms 1340 KB Output is correct
16 Correct 15 ms 1252 KB Output is correct
17 Correct 17 ms 1324 KB Output is correct
18 Correct 22 ms 1372 KB Output is correct
19 Correct 64 ms 1280 KB Output is correct
20 Correct 66 ms 1348 KB Output is correct
21 Correct 10 ms 1280 KB Output is correct
22 Correct 15 ms 1280 KB Output is correct
23 Correct 16 ms 1280 KB Output is correct
24 Runtime error 205 ms 2856 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -