분류 전체보기
-
백준 - 파이프 옮기기 1 [17070]공부/baekjoon 문제 2019. 6. 13. 15:32
#include #include #include using namespace std; class node { public: int i; int j; int status; node(int _i, int _j, int _status) { i = _i; j = _j; status = _status; } node() { i = 0; j = 0; status = 0; } }; int map[16][16]; int result; queue q; void bfs(int n) { q.push(node(0,1,1)); node temp; int status; int i; int j; int right, below, diagonal; while (!q.empty()) { temp = q.front(); i = temp.i..
-
백준 - 아기 상어 [16236]공부/baekjoon 문제 2019. 6. 13. 15:30
#include #include #include #include using namespace std; int m_size = 0; int map[20][20]; bool v[20][20]; int result = 0; int time = 0; bool flag = false; bool flag2 = false; pair s_info; priority_queue pq; queue q; queue w; vector list; int cur = 0; void checking(int i, int j, int info) { v[i][j] = true; if (map[i][j] == 0 || map[i][j] == s_info.first) { q.push(make_pair(map[i][j], make_pair(i,..
-
백준 - 연산자 끼워넣기 [14888]공부/baekjoon 문제 2019. 6. 13. 15:26
#include #include #include using namespace std; int main() { vector numbers; vector cal; int sresult=1000000000; int bresult=-1000000000; int n; int val; cin >> n; for (int i = 0; i > val; numbers.push_back(val); } cin >> val; for (int i = 0; i > val; for (int i = 0; i > val; for (int i = 0; i < val; i++) cal...
-
백준 - Puyo Puyo [11559]공부/baekjoon 문제 2019. 6. 13. 15:19
#include #include using namespace std; char map[12][6]; bool visit[12][6]; bool check = false; int result = 0; void down(int i, int j) { int top = i; int bot = i; int n = 0; for (int l = i; l >= 0; l--) { if (map[l][j] != '.') { map[bot - n][j] = map[l][j]; map[l][j] = '.'; n++; } } } void boom(int i, int j) { char name = map[i][j]; map[i][j] = '.'; if (i > 0) if (map[i - 1][j] == name) boom(i -..
-
백준 - 단지번호붙이기 [2667]공부/baekjoon 문제 2019. 6. 13. 15:16
#include #include #include using namespace std; char map[25][25]; char map2[25][25]; vector result; int num; int mapping(int i, int j, int island_num); int main() { int size = 0; int island_num = 1; cin >> size; for (int i = 0; i > map[i]; } for (int i = 0; i < size; i++) for (int j = 0; j < size; j++) map2[i][j] = '0'; for (int i = 0; i < size; i++) for (int j = 0; j < size;..
-
백준 - 바이러스 [2606]공부/baekjoon 문제 2019. 6. 13. 15:09
#include #include #include #include using namespace std; int main() { int cnum; int nnum; vector t; queue s; int x, y; int index = 1, index2 = 1; int result = 0; bool v[200], v2[200]; for (int i = 0; i > cnum; cin >> nnum; for (int i = 0; i > x >> y; t.push_back(make_pair(x, y))..
-
백준 - 알파벳 [1987]공부/baekjoon 문제 2019. 6. 13. 14:47
#include #include #include #include using namespace std; vector check; vector fin; char arr[20][20]; int r, c; bool flag = false; bool visit[20][20]; void dfs(int i, int j, int cnt) { visit[i][j] = true; flag = false; if (i > 0 && !visit[i-1][j]) { for (int k = 0; k < (int)check.size(); k++) if (check[k] == arr[i - 1][j]) { flag = true; break; } if (!flag) { check.push_back(arr[i - 1][j]); dfs(i..