[백준] 7569번 토마토
·
백준 문제/BFS
문제: 7569번: 토마토 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setpr..
[백준] 10026번 적록색약
·
백준 문제/BFS
문제: 10026번: 적록색약 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // set..
[백준] 1012번 유기농 배추
·
백준 문제/BFS
문제: 1012번: 유기농 배추 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // se..
[백준] 1697번 숨바꼭질
·
백준 문제/BFS
문제: 1697번: 숨바꼭질 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setp..
[백준] 4179번 불!
·
백준 문제/BFS
문제: 4179번: 불! basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setpre..
[백준] 7576번 토마토
·
백준 문제/BFS
문제: 7576번: 토마토 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setpr..
[백준] 2178번 미로 탐색
·
백준 문제/BFS
문제: 2178번: 미로 탐색 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // set..
[백준] 1926번 그림
·
백준 문제/BFS
문제: 1926번: 그림 basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x09.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setpre..
[백준] 10866번 덱
·
백준 문제/자료구조
문제: 10866번: 덱 basic-algo-lecture/workbook/0x07.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x07.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include #include #include #include #include #include #include #include #include #include // setpre..
[백준] 11279번 최대 힙
·
백준 문제/자료구조
문제: 11279번: 최대 힙  #include #include #include #include #include #include #include #include #include #include // setprecision을 사용하기 위한 헤더#include #include using namespace std;int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; // 연산의 개수 cin >> n; // 최대힙으로 동작하도록 priority_queue pq; for (int i = 0; i > x; if (x == 0) { if (pq.empty..