본문 바로가기

알고리즘268

(시간초과) 2146 다리만들기 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091#include #include #include #include using namespace std; int arr[104][104] = { 0 };int chk[104][104] = { 0 };int chkMat[104][104] = { 0 };int n, sum = 0; void isLink(int a, int b) { queue q; q.push(make_pair(a, b)); int dx[4].. 2020. 1. 18.
14502 연구실 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394#include #include #include #include using namespace std; int m[10][10] = { 0 };int chk[10][10] = { 0 };int row, col;int maxRst = -1; void bfsScore() { queue q; int matChk[10][10] = { 0 }; for (int i = 1; i 2020. 1. 17.
1592 영식이와 친구들 123456789101112131415161718192021222324252627282930313233#include int main() { int n, m, l; scanf("%d %d %d", &n, &m, &l); int cnt = 0, maxN = -1, cur = 1; int chk[1005] = { 0 }; chk[1] = 1; while (1) { if (maxN == m) break; if (chk[cur] % 2 == 1) { cur += l; if (cur > n) cur -= n; } else { cur -= l; if (cur maxN) maxN = chk[cur]; cnt++; } printf("%d", cnt);}Colored by Color Scriptercs 2020. 1. 15.
2979 트럭 주차 1234567891011121314151617181920212223#include int main() { int price[4] = { 0 }; for (int i = 1; i 2020. 1. 15.
2164 카드2 123456789101112131415161718192021222324#include #include using namespace std; int main() { int n; scanf("%d", &n); queue q; for (int i = 1; i 0) { if(q.size()==1) printf("%d ", q.front()); q.pop(); if (q.size() > 0) { q.push(q.front()); q.pop(); } }}cs 2020. 1. 15.
1547 공 123456789101112131415161718192021#include int main() { int m; scanf("%d", &m); int a, b; int arr[4] = { 0,1,0,0 }; for (int i = 0; i 2020. 1. 15.
2161 카드1 1234567891011121314151617181920212223#include #include using namespace std; int main() { int n; scanf("%d", &n); queue q; for (int i = 1; i 0) { printf("%d ", q.front()); q.pop(); if (q.size() > 0) { q.push(q.front()); q.pop(); } }}cs 2020. 1. 15.
2455 지능형 기차 123456789101112131415#include int main() { int cur = 0, maxN = -1; for (int i = 0; i 2020. 1. 14.
4677 Oil Deposit 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include #include char arr[105][105] = { 0 };char chk[105][105] = { 0 }; int dx[8] = { 0,1,1,1,0,-1,-1, -1 };int dy[8] = { 1,1,0,-1,-1,-1,0, 1 };void dfs(int y, int x, int row, int col) { chk[y][x] = 1; for (int i = 0; i 2020. 1. 14.
2468 안전영역 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071#include #include int arr[105][105] = { 0 };int chk[105][105] = { 0 }; int dx[4] = { 1,-1,0,0 };int dy[4] = { 0,0,1,-1 }; void dfs(int y, int x, int w) { chk[y][x] = -1; for (int i = 0; i 2020. 1. 14.
7569 토마토 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869#include #include #include using namespace std; queue q;// (date, h), (y,x) int dx[6] = {1,-1,0,0,0,0};int dy[6] = {0,0,1,-1,0,0};int dh[6] = {0,0,0,0,1,-1};int arr[105][105][105] = { 0 };int chk[105][105][105] = { 0 };void bfs(int col, int row, int height, int sum) { .. 2020. 1. 14.
1697 숨바꼭질 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include #include #include using namespace std; int dx[3] = { -1,1 }; int bfs(int n, int k) { queue q; q.push(make_pair(0, n)); int chk[200001] = { 0 }; while (!q.empty()) { int len = q.front().first; int x = q.front().second; q.pop(); if (x == k) { return len; } for (int i = 0; i 2020. 1. 14.

티스토리툴바