MLASERP - Laser Phones

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long LL;

#define sz(a) (int((a).size()))
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N 105

char a[N][N]; //field map
bool vst[N][N];
int h, w, d[4][2] = {{-1,0},{1,0},{0,-1},{0,1}}; //h: so cot, w: so hang
ii p[2];

void enter() {
	int k = 0;
	scanf("%d%d",&h,&w);
	rep(i,w) scanf("%s", a[i]);
	rep(i,w) rep(j,h) if(a[i][j] == 'C') p[k++] = ii(i,j);
}

void solve() {
	queue<ii> qu; qu.push(p[0]); vst[p[0].fi][p[0].se] = 1;
	for(int cnt = -1; !qu.empty(); ++cnt) {
		rep(K,qu.size()) {
			if(qu.front() == p[1]) {
				printf("%d\n", cnt);
				return;
			}
			int x = qu.front().fi, y = qu.front().se; qu.pop();
			rep(k,4)
				for(int i=x,j=y; i>=0&&i<w&&j>=0&&j<h&&a[i][j]!='*'; i+=d[k][0],j+=d[k][1]) {
					if(vst[i][j]) continue;
					qu.push(ii(i,j));
					vst[i][j] = 1;
				}
			
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen( "input.txt", "r", stdin );
	//freopen( "output.txt", "w", stdout );
#endif
	enter();
	solve();
	return 0;
}

Download