Submission #73589379

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;

const int N = 250010;
int n, m, dis[N];
char c[505][505];
vector <pii> g[N];
bool vis[N];

inline int id(int x, int y) {
	return m * (x - 1) + y;
}

inline void add(int u, int v, int w) {
	g[u].push_back({v, w});
}

inline int dij(int s) {
	priority_queue <pii, vector<pii>, greater<pii>> q;
	for(int i = 1; i <= n * m; i ++) dis[i] = 1e9;
	dis[s] = 0; q.push({0, s});
	while(!q.empty()) {
		int u = q.top().se; q.pop();  
		if(vis[u]) continue;
		vis[u] = 1;
		for(auto &i : g[u]) {
			int v = i.fi, w = i.se;
			if(dis[v] > dis[u] + w) {
				dis[v] = dis[u] + w;
				q.push({dis[v], v});
			}
		}
	}
	return dis[id(n, m)]; 
}

signed main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	cin.tie(0) -> ios::sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			cin >> c[i][j];
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			if(c[i][j + 1] == '#') add(id(i, j), id(i, j + 1), 1);
			if(c[i][j + 1] == '.') add(id(i, j), id(i, j + 1), 0);
			
			if(c[i][j - 1] == '#') add(id(i, j), id(i, j - 1), 1);
			if(c[i][j - 1] == '.') add(id(i, j), id(i, j - 1), 0);
		
			if(c[i + 1][j] == '#') add(id(i, j), id(i + 1, j), 1);
			if(c[i + 1][j] == '.') add(id(i, j), id(i + 1, j), 0);
			
			if(c[i - 1][j] == '#') add(id(i, j), id(i - 1, j), 1);
			if(c[i - 1][j] == '.') add(id(i, j), id(i - 1, j), 0);
		}
	}
	cout << dij(id(1, 1));
	return 0;
}

Submission Info

Submission Time
Task D - Escape from the Maze
User hyf719346
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1641 Byte
Status AC
Exec Time 67 ms
Memory 33224 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 10
AC × 62
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, sample06.txt, sample07.txt, sample08.txt, sample09.txt, sample10.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, sample06.txt, sample07.txt, sample08.txt, sample09.txt, sample10.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt
Case Name Status Exec Time Memory
in01.txt AC 2 ms 3372 KiB
in02.txt AC 2 ms 3712 KiB
in03.txt AC 2 ms 3524 KiB
in04.txt AC 2 ms 3584 KiB
in05.txt AC 2 ms 3932 KiB
in06.txt AC 36 ms 31352 KiB
in07.txt AC 45 ms 31420 KiB
in08.txt AC 46 ms 31276 KiB
in09.txt AC 38 ms 31372 KiB
in10.txt AC 61 ms 31480 KiB
in11.txt AC 61 ms 33188 KiB
in12.txt AC 54 ms 31276 KiB
in13.txt AC 49 ms 31564 KiB
in14.txt AC 46 ms 31488 KiB
in15.txt AC 2 ms 3500 KiB
in16.txt AC 2 ms 3748 KiB
in17.txt AC 39 ms 31372 KiB
in18.txt AC 62 ms 31712 KiB
in19.txt AC 41 ms 31396 KiB
in20.txt AC 53 ms 33224 KiB
in21.txt AC 42 ms 31556 KiB
in22.txt AC 58 ms 31504 KiB
in23.txt AC 48 ms 31268 KiB
in24.txt AC 38 ms 31276 KiB
in25.txt AC 19 ms 16888 KiB
in26.txt AC 2 ms 3492 KiB
in27.txt AC 2 ms 3576 KiB
in28.txt AC 45 ms 31488 KiB
in29.txt AC 4 ms 4676 KiB
in30.txt AC 2 ms 3596 KiB
in31.txt AC 47 ms 31504 KiB
in32.txt AC 47 ms 33140 KiB
in33.txt AC 2 ms 3576 KiB
in34.txt AC 45 ms 31276 KiB
in35.txt AC 48 ms 31556 KiB
in36.txt AC 67 ms 32068 KiB
in37.txt AC 47 ms 31372 KiB
in38.txt AC 2 ms 3660 KiB
in39.txt AC 2 ms 3756 KiB
in40.txt AC 49 ms 31232 KiB
in41.txt AC 59 ms 31632 KiB
in42.txt AC 29 ms 21292 KiB
in43.txt AC 60 ms 31488 KiB
in44.txt AC 50 ms 31352 KiB
in45.txt AC 56 ms 31632 KiB
in46.txt AC 47 ms 24284 KiB
in47.txt AC 2 ms 3780 KiB
in48.txt AC 2 ms 3660 KiB
in49.txt AC 45 ms 31384 KiB
in50.txt AC 44 ms 31392 KiB
in51.txt AC 43 ms 31268 KiB
in52.txt AC 43 ms 31384 KiB
sample01.txt AC 2 ms 3660 KiB
sample02.txt AC 2 ms 3480 KiB
sample03.txt AC 2 ms 3644 KiB
sample04.txt AC 2 ms 3712 KiB
sample05.txt AC 2 ms 3644 KiB
sample06.txt AC 2 ms 3544 KiB
sample07.txt AC 2 ms 3684 KiB
sample08.txt AC 2 ms 3492 KiB
sample09.txt AC 2 ms 3448 KiB
sample10.txt AC 2 ms 3472 KiB