[BOJ] 14226번 이모티콘

#include < iostream>
#include < vector>
#include < queue>
#include < algorithm>

using namespace std;

bool check[1001][1001];
int dis[1001][1001];
int board[1001][1001];


int bfs(int s)
{
	int y,x;
	queue<pair< int,int>> q;
	q.push(make_pair(1,0));
	check[1][0] = true;
	dis[1][0] = 0;
	
	int ans=0;
	bool ok = false;
	
	while(!q.empty()){
		y = q.front().first;
		x = q.front().second;
		q.pop();

		for(int i=0;i<3;i++){
			int ny,nx;

			if(i==0){
				ny = y;
				nx = y;
			}else if(i==1){
				ny = x+y;
				nx = x;
			}else{
				ny = y-1;
				nx = x;
			}

			if(ny<0 || nx<0 || ny>= 1001 || nx>= 1001)
				continue;

			if(check[ny][nx] == false){
				q.push(make_pair(ny,nx));
				check[ny][nx] = true;
				dis[ny][nx] = dis[y][x] + 1;
				if(ny == s){
					if(ny==2){
						int ww =1;
					}
					ans = dis[ny][nx];
					ok = true;
					break;
				}
			}
					}
		if(ok == true)
				break;

	}

	return ans;

	
	
}

int main()
{
	int s;

	cin>>s;

	int minNum = bfs(s);
	
	

	cout<<minNum<<endl;

	return 0;
}

 

 

https://www.acmicpc.net/problem/14226

14226번: 이모티콘