{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":439536509,"defaultBranch":"main","name":"boj-algorithm","ownerLogin":"SH4MDEL","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-12-18T05:32:36.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/45813451?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1639805557.427941","currentOid":""},"activityList":{"items":[{"before":"8fcb451aa9f419b647c85448548a9ee968dc1339","after":"2e20bfe50789630e3bad2a0a78f3390860c03883","ref":"refs/heads/main","pushedAt":"2024-07-02T13:59:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 15645 - 내려가기 2\n\nsilver 1\n바텀업 dp","shortMessageHtmlLink":"solve 15645 - 내려가기 2"}},{"before":"9f350f0fec2c83c62da1fa0d8a6e6a20fdf01218","after":"8fcb451aa9f419b647c85448548a9ee968dc1339","ref":"refs/heads/main","pushedAt":"2024-06-23T15:55:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1657 - 두부장수 장홍준\n\nplatinum 3\n이전 m개의 비트를 메모이제이션하는 비트필드 dp","shortMessageHtmlLink":"solve 1657 - 두부장수 장홍준"}},{"before":"11c23a15e4d4aca4d2cdab7cc08e43edac441722","after":"9f350f0fec2c83c62da1fa0d8a6e6a20fdf01218","ref":"refs/heads/main","pushedAt":"2024-06-09T16:09:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2116 - 주사위 쌓기\n\ngold 5\n브루트포스.\n맨 아래 주사위의 밑면이 정해지면 남은 모든 주사위의 밑면과 윗면이 정해짐을 이용한다.","shortMessageHtmlLink":"solve 2116 - 주사위 쌓기"}},{"before":"5099e9d17eb085eb556b4396e283392c50a4abdb","after":"11c23a15e4d4aca4d2cdab7cc08e43edac441722","ref":"refs/heads/main","pushedAt":"2024-06-09T16:08:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 28709 - 와일드카드 괄호 문자열\n\ngold 1\n그리디 & 문자열\n* 문자가 존재함에도 올바른 문자열을 만들 수 없는 경우를 처리해 줘야 하고,\n*가 아예 존재하지 않는 경우를 처리해 줘야 한다.","shortMessageHtmlLink":"solve 28709 - 와일드카드 괄호 문자열"}},{"before":"c49fc8ca4a76b7e0054f3a437e6a8d37a75baff7","after":"5099e9d17eb085eb556b4396e283392c50a4abdb","ref":"refs/heads/main","pushedAt":"2024-06-06T09:39:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2022 - 사다리\n\ngold 4\n기하학 + 이분 탐색.\n증명이 약간 까다로운 문제.","shortMessageHtmlLink":"solve 2022 - 사다리"}},{"before":"a5f4011b9150d0ea6ab46f884a36f88c644eafd0","after":"c49fc8ca4a76b7e0054f3a437e6a8d37a75baff7","ref":"refs/heads/main","pushedAt":"2024-06-06T07:52:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1064 - 평행사변형\n\nsilver 4\n. 세 점이 일직선에 놓여 있으면 평행사변형을 만들 수 없다.\n. 그렇지 않다면 세 점의 세 변 중 두 변을 골라 평행 사변형을 만들 수 있다.","shortMessageHtmlLink":"solve 1064 - 평행사변형"}},{"before":"d532730be1df47fbd28febd7a85e66643040a131","after":"a5f4011b9150d0ea6ab46f884a36f88c644eafd0","ref":"refs/heads/main","pushedAt":"2024-06-05T06:01:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2313 - 보석 구매하기\n\ngold 5\n누적합 계산 반복.\n근데 1000 * 1000 * 1000인 것 같은데 풀린다.","shortMessageHtmlLink":"solve 2313 - 보석 구매하기"}},{"before":"a168061f351e931c88f453dab3da1053a1372503","after":"d532730be1df47fbd28febd7a85e66643040a131","ref":"refs/heads/main","pushedAt":"2024-06-05T06:00:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 16500 - 문자열 판별\n\ngold 5\n'가능' 여부를 메모이제이션 해야 함.","shortMessageHtmlLink":"solve 16500 - 문자열 판별"}},{"before":"8f6f5bfd572e749d28680d9fbc68321e0148c397","after":"a168061f351e931c88f453dab3da1053a1372503","ref":"refs/heads/main","pushedAt":"2024-06-04T08:42:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1245 - 농장 관리\n\ngold 5\nbfs, 최대 높이부터 내려오며 탐색","shortMessageHtmlLink":"solve 1245 - 농장 관리"}},{"before":"092855809810b6a0287587d77926275d7ec63841","after":"8f6f5bfd572e749d28680d9fbc68321e0148c397","ref":"refs/heads/main","pushedAt":"2024-06-04T06:30:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 3107 - IPv6\n\ngold 5\n0 4개가 하나인 그룹이라도 ::로 바꿀 수 있다.","shortMessageHtmlLink":"solve 3107 - IPv6"}},{"before":"c9e01ce7d0568bf13affc80cdc1e8b5b491e5389","after":"092855809810b6a0287587d77926275d7ec63841","ref":"refs/heads/main","pushedAt":"2024-05-22T14:36:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 9657 - 돌 게임 3\n\nsilver 3\n게임 이론, 또는 dp 문제.\ndp로 해결","shortMessageHtmlLink":"solve 9657 - 돌 게임 3"}},{"before":"f5da2a830e1e68a0386963c7ecc18037fb7b7f3a","after":"c9e01ce7d0568bf13affc80cdc1e8b5b491e5389","ref":"refs/heads/main","pushedAt":"2024-05-22T14:14:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 4883 - 삼각 그래프\n\nsilver 1\ndp\n첫 정점과 마지막 정점을 절대 방문할 수 없다.","shortMessageHtmlLink":"solve 4883 - 삼각 그래프"}},{"before":"8d0443e9634d80968107f50e2cbcef4010fb332a","after":"f5da2a830e1e68a0386963c7ecc18037fb7b7f3a","ref":"refs/heads/main","pushedAt":"2024-05-22T14:13:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1788 - 피보나치 수의 확장\n\nsilver 3\n주어진 조건대로 점화식을 계산하는 문제.","shortMessageHtmlLink":"solve 1788 - 피보나치 수의 확장"}},{"before":"1d6aefc550174b8f4eefa715fa98c5a807e315f4","after":"8d0443e9634d80968107f50e2cbcef4010fb332a","ref":"refs/heads/main","pushedAt":"2024-05-22T13:35:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2302 - 극장 좌석\n\nsilver 1\n기초 dp","shortMessageHtmlLink":"solve 2302 - 극장 좌석"}},{"before":"18fee29985b7ce6e9667f4318d372df97f5131f9","after":"1d6aefc550174b8f4eefa715fa98c5a807e315f4","ref":"refs/heads/main","pushedAt":"2024-05-22T13:23:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 6198 - 옥상 정원 꾸미기\n\ngold 5\n스택 활용 문제.","shortMessageHtmlLink":"solve 6198 - 옥상 정원 꾸미기"}},{"before":"baeab97f1c50382f38c123b835dd79aa33aee330","after":"18fee29985b7ce6e9667f4318d372df97f5131f9","ref":"refs/heads/main","pushedAt":"2024-05-22T09:34:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1865 - 웜홀\n\ngold 3\n모든 정점에서 음의 사이클이 단 하나라도 존재하는지 묻는 문제.\n초기 dist 값을 -1로 설정하고 갱신을 시도했을 때 갱신 된다면 음의 사이클이 존재한다고 생각할 수 있다.","shortMessageHtmlLink":"solve 1865 - 웜홀"}},{"before":"0ae21a5f02e5c957dbdd709bb0db603c3cbfa194","after":"baeab97f1c50382f38c123b835dd79aa33aee330","ref":"refs/heads/main","pushedAt":"2024-05-22T09:08:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 11657 - 타임머신\n\ngold 4\n벨만 포드 연습문제.","shortMessageHtmlLink":"solve 11657 - 타임머신"}},{"before":"ef0b313c159acb85ac410ea19634fa9630b2b15a","after":"0ae21a5f02e5c957dbdd709bb0db603c3cbfa194","ref":"refs/heads/main","pushedAt":"2024-05-22T08:03:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 11444 - 피보나치 수 6\n\ngold 2\n분할 정복(행렬)을 이용해 큰 피보나치 수를 빠르게 구하는 문제.","shortMessageHtmlLink":"solve 11444 - 피보나치 수 6"}},{"before":"66193b84d72b09974517c21344672c82cbb6359f","after":"ef0b313c159acb85ac410ea19634fa9630b2b15a","ref":"refs/heads/main","pushedAt":"2024-05-22T07:27:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1967 - 트리의 지름\n\ngold 4\ndfs.\nRe 1167과 같은 방법으로 해결","shortMessageHtmlLink":"solve 1967 - 트리의 지름"}},{"before":"e79381e709fb0ed88fa93c3d1de49b8e7092f5f1","after":"66193b84d72b09974517c21344672c82cbb6359f","ref":"refs/heads/main","pushedAt":"2024-05-22T07:23:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"re solve 1167 - 트리의 지름\n\ngold 2\n특정 정점에서 가장 먼 정점 a을 구하고, a로부터 가장 먼 정점 b를 구하면 a와 b의 길이가 트리의 지름이 된다.","shortMessageHtmlLink":"re solve 1167 - 트리의 지름"}},{"before":"8835f30017a7b67921bb690e5b04356bf3d66f94","after":"e79381e709fb0ed88fa93c3d1de49b8e7092f5f1","ref":"refs/heads/main","pushedAt":"2024-05-22T07:07:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1167 - 트리의 지름\n\ngold 2\n문제를 단순화시켜 어떤 노드의 자식 노드로 향하는 가장 긴 경로 l을 구한다고 생각해 보자. 이는 간단한 dfs다.\n어떤 노드를 루트 노드로 잡았을 때, 다음 두 가지 경우를 고려해보자.\n1. 나를 종점으로 하는 가장 긴 경로\n2. 트리의 지름\n1번의 경우 l이 답이다.\n2번의 경우 두 가지를 고려해야 한다.\n1. 트리의 지름이 나를 포함함.\n2. 트리의 지름이 내 자식 단에서 결정됨.\n1번은 가장 긴 l과 두 번째로 긴 l의 합이다.\n2번은 자식으로부터 재귀적으로 구한 2의 최댓값이다.\n1번과 2번의 최댓값이 트리의 지름이 된다.","shortMessageHtmlLink":"solve 1167 - 트리의 지름"}},{"before":"8c7185a630f145a59773d7c51dc2385e399f760e","after":"8835f30017a7b67921bb690e5b04356bf3d66f94","ref":"refs/heads/main","pushedAt":"2024-05-22T06:23:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1309 - 동물원\n\nsilver 1\ndp.","shortMessageHtmlLink":"solve 1309 - 동물원"}},{"before":"ff7ed0beda3ed64050b58671c797567bf31e3d1f","after":"8c7185a630f145a59773d7c51dc2385e399f760e","ref":"refs/heads/main","pushedAt":"2024-05-22T03:49:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2174 - 로봇 시뮬레이션\n\ngold 5\n시뮬레이션 문제.","shortMessageHtmlLink":"solve 2174 - 로봇 시뮬레이션"}},{"before":"c0f584547fc290b7f2213da30e2d89a2ddb09053","after":"ff7ed0beda3ed64050b58671c797567bf31e3d1f","ref":"refs/heads/main","pushedAt":"2024-05-22T02:53:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 19598 - 최소 회의실 개수\n\ngold 5\n그리디.","shortMessageHtmlLink":"solve 19598 - 최소 회의실 개수"}},{"before":"fe379929e0c26cc3c11c0d98a927fb6e8eb52daa","after":"c0f584547fc290b7f2213da30e2d89a2ddb09053","ref":"refs/heads/main","pushedAt":"2024-05-22T02:17:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 14567- 선수과목 (Prerequisite)\n\ngold 5\n위상 정렬","shortMessageHtmlLink":"solve 14567- 선수과목 (Prerequisite)"}},{"before":"82fdbf444503d920c7aa8864f74c078d8b5b98ae","after":"fe379929e0c26cc3c11c0d98a927fb6e8eb52daa","ref":"refs/heads/main","pushedAt":"2024-05-21T15:44:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 18112 - 이진수 게임\n\ngold 5\n비트마스킹 + bfs","shortMessageHtmlLink":"solve 18112 - 이진수 게임"}},{"before":"039aebe3ed40560c3a5a3ab203ac3ea4b9279a9e","after":"82fdbf444503d920c7aa8864f74c078d8b5b98ae","ref":"refs/heads/main","pushedAt":"2024-05-21T15:10:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1374 - 강의실\n\ngold 5\npq 활용 그리디","shortMessageHtmlLink":"solve 1374 - 강의실"}},{"before":"6199a3c4300bde768ef20138a4a33351e4c06680","after":"039aebe3ed40560c3a5a3ab203ac3ea4b9279a9e","ref":"refs/heads/main","pushedAt":"2024-05-17T09:26:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 2261 - 가장 가까운 두 점\n\nplatinum 2\n분할 정복.\n후보수를 추려 다시 정렬해야 하는 아이디어가 어렵다.","shortMessageHtmlLink":"solve 2261 - 가장 가까운 두 점"}},{"before":"1b419a7391aab6207a3899cfa6421b988bacaba9","after":"6199a3c4300bde768ef20138a4a33351e4c06680","ref":"refs/heads/main","pushedAt":"2024-05-17T09:26:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 1052 - 물병\n\ngold 5\n물병은 반드시 2^n 꼴로 담긴다.\n물병 하나는 기본적으로 1의 물을 채우고 있으므로, 물병의 개수를 이진수로 나타냈을 때 켜져있는 비트의 수가 곧 K가 0일 때 최소로 만들 수 있는 물병의 수이다.\n상위 비트부터 하나씩 지워 간다고 가정하고 K - 1개의 비트를 지웠을 때,\n남은 수에서 최소 얼마를 더해야 2의 멱수로 만들 수 있는가를 묻는 질문으로 바뀌며 그것이 곧 답이다.\n답이 나오지 않는 경우는 없으며(-1) 초기에 켜져있는 비트의 수가 K보다 작으면 답은 당연히 0이다.","shortMessageHtmlLink":"solve 1052 - 물병"}},{"before":"23b3992c78e18cd16ab985ecdbd861adfea5a47d","after":"1b419a7391aab6207a3899cfa6421b988bacaba9","ref":"refs/heads/main","pushedAt":"2024-05-17T05:15:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SH4MDEL","name":"Seungjun Lee","path":"/SH4MDEL","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45813451?s=80&v=4"},"commit":{"message":"solve 15989 - 1, 2, 3 더하기 4\n\ngold 5\n배낭 DP","shortMessageHtmlLink":"solve 15989 - 1, 2, 3 더하기 4"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEdOL7eQA","startCursor":null,"endCursor":null}},"title":"Activity · SH4MDEL/boj-algorithm"}