oj.uz

Submission #103301

# Submission time Handle Problem Language Result Execution time Memory
103301 2019-03-29T17:32:57 Z luciocf Portals (BOI14_portals) C++14
0 / 100
 3 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 210;

typedef pair<int, int> pii;

int dist[maxn][maxn], wall[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};

int find_wall(int x, int y)
{
	memset(mark, 0, sizeof mark);

	dist[x][y] = 0, mark[x][y] = true;
	queue<pii> fila;

	fila.push({x, y});

	while (!fila.empty())
	{
		int x = fila.front().first, y = fila.front().second;
		fila.pop();

		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 || mark[a][b] || tab[a][b] == '#') continue;

			dist[a][b] = dist[x][y]+1, mark[a][b] = true;
			fila.push({a, b});
		}
	}

	int ans = 1e9+10;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (tab[i-1][j] == '#' || tab[i+1][j] == '#' ||
				tab[i][j-1] == '#' || tab[i][j+1] == '#')
				ans = min(ans, dist[i][j]+1);

	return ans;
}

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<pair<int, pii>> 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 || mark[a][b] || 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}});
			}
		}

		for (int a = x; a >= 1; a--)
		{
			if (tab[a-1][y] != '#') continue;
			if (mark[a][y]) break;

			if (dist[x][y]+wall[a][y] < dist[a][y])
			{
				dist[a][y] = dist[x][y]+1;
				fila.push({dist[a][y], {a, y}});
			}

			break;
		}

		for (int a = x; a <= n; a++)
		{
			if (tab[a+1][y] != '#') continue;
			if (mark[a][y]) break;

			if (dist[x][y]+wall[a][y] < dist[a][y])
			{
				dist[a][y] = dist[x][y]+1;
				fila.push({dist[a][y], {a, y}});
			}

			break;
		}

		for (int b = y; b >= 1; b--)
		{
			if (tab[x][b-1] != '#') continue;
			if (mark[x][b]) break;

			if (dist[x][y]+wall[x][b] < dist[x][b])
			{
				dist[x][b] = dist[x][y]+wall[x][b];
				fila.push({dist[x][b], {x, b}});
			}

			break;
		}

		for (int b = y; b <= m; b++)
		{
			if (tab[x][b+1] != '#') continue;
			if (mark[x][b]) break;

			if (dist[x][y]+wall[x][b] < dist[x][b])
			{
				dist[x][b] = dist[x][y]+wall[x][b];
				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;

			wall[i][j] = 1;
		}
	}

	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] = '#';

	if (n > 50 || m > 50)
	{
		bfs();
		printf("%d\n", dist[dx][dy]);
		return 0;
	}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			wall[i][j] = find_wall(i, j);

	memset(mark, 0, sizeof mark);
	bfs();

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

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:145: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:151: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
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -