본문 바로가기

전체 글98

[BOJ] 1261번 알고스팟 -deque #include #include using namespace std; int dis[101][101]; bool check[101][101]; int board[101][101]; int dy[4] = {-1,0,1,0}; int dx[4] = {0,-1,0,1}; int n,m; void bfs(int y,int x){ deque> q; q.push_front(make_pair(y,x)); check[y][x] = true; dis[y][x] = 0; while(!q.empty()){ y = q.front().first; x = q.front().second; q.pop_front(); for(int dir=0;dir>m>>n; for(int i=0;i>temp; .. 2019. 10. 12.
[BOJ] 13549번 숨바꼭질3 #include #include using namespace std; int n,k; bool check[200001]; int dis[200001]; void bfs(){ queue q0; queue q1; q0.push(n); check[n] = true; dis[n] = 0; while(!q0.empty()){ int start = q0.front(); q0.pop(); for(int i=0;i>n>>k; bfs(); cout 2019. 10. 11.
[BOJ] 14226번 이모티콘 #include #include #include #include using namespace std; bool check[1001][1001]; int dis[1001][1001]; int board[1001][1001]; int bfs(int s) { int y,x; queue> 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>s; int minNum = bfs(s.. 2019. 10. 8.
[BOJ] 1697번 숨바꼭질 #include #include #include using namespace std; int n,k; bool check[100001]; int dis[100001]; int b[100001]; void bfs() { int s; queue q; q.push(n); dis[n] = 0; check[n] = true; while(!q.empty()) { s = q.front(); q.pop(); for(int i=0;i>n>>k; bfs(); cout 2019. 10. 7.
반응형

티스토리툴바