wooing

문제https://www.codetree.ai/trails/complete/curated-cards/challenge-glacier/description?page=1&page_size=20 Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai 해결방법해당 문제를 해결하려면 빙하에 둘러쌓여 있지 않은 물의 영역을 구하는 로직이 중요하다. 문제..

문제https://www.codetree.ai/trails/complete/curated-cards/test-we-are-the-one/description?page=1&page_size=20 Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai 해결방법처음 문제를 읽었을땐 인접한 도시간의 이동, U 이상 D이하인 경우 이 부분에 대해 이해..

문제https://www.codetree.ai/trails/complete/curated-cards/challenge-clear-stones-well/description?page=1&page_size=20 Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai 해결방법해당 문제를 해결하기 위해서는 돌 치우는 경우의 수 구현, BFS로 각 시..

문제https://www.codetree.ai/trails/complete/curated-cards/test-puyo-puyo/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai 해결방법해당 문제를 해결하려면 칸을 전체 순회하며 블럭의 수, 블럭의 크기를 구해야한다. 이때 전체 순회를 하며 블럭(상하좌우 인접한 칸들이..

문제https://www.codetree.ai/trails/complete/curated-cards/challenge-gold-mining/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai해결방법문제 지문을 요약하면 다음과 같다.손해를 보지 않을때 K길이의 마름모 모양 안에 존재할 수 있는 금의 최대 개수채굴 비용 ..