목록분류 전체보기 (346)

혜랑's STORY

[BOJ_C++] 7562번: 나이트의 이동

CODE #include using namespace std; #define X first #define Y second int tc, l, result; int dist[305][305]; int dx[8] = {1, 2, -1, -2, 1, 2, -1, -2}; int dy[8] = {2, 1, 2, 1, -2, -1, -2, -1}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> tc; while(tc--){ bool flag = false; pair start, done; queue q; memset(dist, -1, sizeof(dist)); cin >> l; cin >> start.X >> start.Y; cin >> done.X..
무지성 공부방/알고리즘 해결 2022. 10. 10. 13:03
[BOJ_C++] 5427번: 불

CODE #include using namespace std; #define X first #define Y second int tc, w, h; string board[1002]; int dist[1002][1002]; int fire_dist[1002][1002]; int dx[4] = {1, 0, 0, -1}; int dy[4] = {0, 1, -1, 0}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> tc; while(tc--){ queue fire; queue q; bool flag = false; memset(dist, -1, sizeof(dist)); memset(fire_dist, -1, sizeof(fire_dist)); ..
무지성 공부방/알고리즘 해결 2022. 10. 10. 12:37
[BOJ_C++] 7569번: 토마토

CODE #include using namespace std; int board[102][102][102]; int dist[102][102][102]; int n, m, h, day; int dx[6] = {1, 0, 0, -1, 0, 0}; int dy[6] = {0, 1, 0, 0, -1, 0}; int dz[6] = {0, 0, 1, 0, 0, -1}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> m >> n >> h; queue q; for(int k=0; k= n || ny = m || nz = h) continue; if(dist[nx][ny][nz] >= 0) continue; dist..
무지성 공부방/알고리즘 해결 2022. 10. 6. 18:00
[BOJ_C++] 7576번: 토마토

CODE #include using namespace std; #define X first #define Y second int board[1002][1002]; int dist[1002][1002]; int n, m, day; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> m >> n; queue q; for(int i=0; i board[i][j]; if (board[i][j] == 1) q.push({i, j}); if (board[i][j] == 0) dist[i][j] = -1; } } while(!q.empty()){ pair cur ..
무지성 공부방/알고리즘 해결 2022. 10. 6. 17:39
[BOJ_C++] 10026번: 적록색약

CODE #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, rgb, rg; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; string board[102]; int visit1[102][102] = {0, }; int visit2[102][102] = {0, }; cin >> n; for(int i=0; i> board[i]; rgb = 0; for(int i=0; i
무지성 공부방/알고리즘 해결 2022. 10. 5. 20:06
[BOJ_C++] 3986번: 좋은 단어

CODE #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, sum = 0; string str; bool check; cin >> n; for(int i=0; i> str; for(int j=0; j
무지성 공부방/알고리즘 해결 2022. 9. 30. 23:39
[BOJ_C++] 10799번: 쇠막대기

CODE #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int sum = 0; string str; stack pipe; cin >> str; for(int i=0; i
무지성 공부방/알고리즘 해결 2022. 9. 30. 23:11
[BOJ_C++] 2493번: 탑

CODE #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, height; stack s; cin >> n; for(int i=1; i> height; while(!s.empty()){ if(s.top().first > height){ cout
무지성 공부방/알고리즘 해결 2022. 9. 29. 17:24
이전 Prev 1 2 3 4 ··· 44 Next 다음