W's Blog W's Blog

전체 글

• 낚시왕

  백준알고리즘 2019. 8. 1. 05:43

  #include #include using namespace std; struct shark { int r; int c; int s;//속도 int d;//방향 1 위 2 아래 3 오른쪽, 4 왼쪽임 int z;//크기 bool life = true; shark(int q, int w, int speed, int t, int y) { r = q; c = w; s = speed; d = t; z = y; } }; int ans; vector v[101]; int r, c,m; void check(int al) { for (int i = 0; i < v[al].size(); i++) { if (v[al][i].z == 0) continue; int max = v[al][i].z; vector index; i..

  Read More
• 2048 (Easy)

  백준알고리즘 2019. 7. 31. 05:18

  #include #include #include #include #include #include using namespace std; int n; int map[21][21]; int temp[21][21]; bool f[21]; int ans = 0; int sum; void move(int dir) { if (dir == 1) {//down for (int i = 0; i = 0; k--) { if (map[k][i] != 0) { if (map[k][i] == map[j]..

  Read More
• 알파벳

  백준알고리즘 2019. 7. 31. 01:27

  #include using namespace std; int r, c; int map[20][20]; bool d[20][20]; bool a[27]; int dx[] = { 0,0,1,-1 }; int dy[] = { 1,-1,0,0 }; int ans; void go(int x, int y, int cnt) { if (cnt > 26) return; if (x == r && y == c) { ans = cnt > ans ? cnt : ans; return; } else { if (a[map[x][y]] == true) { ans = cnt > ans ? cnt : ans; return; } a[map[x][y]] = true; d[x][y] = true; for (int i = 0; i < 4; i+..

  Read More
• N-Queen

  백준알고리즘 2019. 7. 30. 04:34

  #include #include using namespace std; int n; int map[16][16]; bool check[16]; int ans; int dx[] = { -1,1,0 }; int dy[] = { -1,-1,-1 }; bool checking(int x, int y) { if (y n; ans = 0; for (int i = 1; i

  Read More
• 부등호

  백준알고리즘 2019. 7. 30. 01:31

  #include #include #include #include using namespace std; vector ans; int n; char a[20]; bool check[10]; bool budu(char x, char y, char op) { if (op == '') if (x n; for (int i = 0; i > a[i]; } go(0, ""); auto p = minmax_element(ans.begin(), an..

  Read More
• 미세먼지 안녕!

  백준알고리즘 2019. 7. 28. 23:40

  #include #include #include #include using namespace std; int r, c, t; int map[2][50][50];// 먼지 오리지날 0, 퍼진상태 1, 나머지 2차원맵 int dx[] = { 0,0,1,-1 }; int dy[] = { 1,-1,0,0 }; vector v; void bfs(int x, int y) {//bfs인줄 알았으나.. 그냥 한칸씩만 옮기면되서 먼지움직임제어 int re = map[0][x][y] / 5; int cnt = 0; for (int i = 0; i = 0 && nx = 0 && ny < c) { i..

  Read More
• 2117. [모의 SW 역량테스트] 홈 방범 서비스

  SWexpertAcademy 2019. 7. 28. 05:21

  #include #include #include #include #include #include using namespace std; int tc; int n, m; int map[20][20]; int v[22][22]; int dd[22]; int cost[22]; int ans = 0; int dx[] = { 0,0,1,-1 }; int dy[] = { 1,-1,0,0 }; void initial(); void making_secu(int x, int y) { queue q; q.push(make_pair(x, y)); int cnt = map[x][y]; v[x][y] = 1; while (!q.empty()) { x = q.front().first; y = q.front().second; q.p..

  Read More
• 5656. [모의 SW 역량테스트] 벽돌 깨기

  SWexpertAcademy 2019. 7. 27. 01:44

  #include #include #include #include using namespace std; int n,h, w; int map[15][12]; int mapc[15][12]; int tc; int result = 1000000; struct brick { int x; int y; int value; brick(int a, int b, int c) { x = a; y = b; value = c; } }; void sorting() { for (int i = 0; i = 0; j--) { if (map[j][i] == 0) { for (int k = j - 1; k >= 0; k--) { if (map[k][i] != 0) { map[..

  Read More