상후니의 개발 블로그

https://www.hackerrank.com/challenges/torque-and-development/problem?isFullScreen=true Roads and Libraries | HackerRank Help the ruler of HackerLand determine the cheapest way to give his citizens access to libraries. www.hackerrank.com #include using namespace std; #define PII pair int q, n, m, c_lib, c_road, parent[100001], rrank[100001], cnt[100001]; int Find(int x) { if (parent[x] == x) retu..

https://www.hackerrank.com/challenges/the-story-of-a-tree/problem?isFullScreen=true The Story of a Tree | HackerRank Help Alice find the probability of winning a game played on a Tree with Bob. www.hackerrank.com #include using namespace std; #define PII pair int q, n, g, k, Count[100001]; bool visit[100001]; set gmap; int DFS(vector& grid, int x) { if (visit[x]) return 0; visit[x] = true; int r..

https://www.hackerrank.com/challenges/lilys-homework/problem?isFullScreen=true Lily's Homework | HackerRank Help George figure out Lily's homework www.hackerrank.com #include using namespace std; #define PII pair int n = 0, lessResult = 0, reaterResult = 0; int lilysHomework(vector vec) { vector lessVec, greaterVec; for (int i = 0; i < n; ++i) { lessVec.push_back({ vec[i], i }); greaterVec.push_..

https://www.hackerrank.com/challenges/bear-and-steady-gene/problem Bear and Steady Gene | HackerRank What is the minimum size of an interval to change, to obtain a steady string - a string with the same number of every possible letter. www.hackerrank.com #include using namespace std; int origin[4], mmm[4], n = 0, sz = 0, answer = INT_MAX; char sss[4] = { 'A', 'C', 'G', 'T' }; void SetCount(int v..

https://www.hackerrank.com/challenges/icecream-parlor/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign Ice Cream Parlor | HackerRank Help Sunny and Johnny spend all their money during each trip to the Ice Cream Parlor. www.hackerrank.com #include using namespace std; #define PII pair bool Compare(const PII& v1, const PII& v2) { if (v1.second == v2.second..

https://www.hackerrank.com/challenges/gridland-metro/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign Gridland Metro | HackerRank Help the mayor determine the potential locations for lampposts! www.hackerrank.com #define PII pair #define LL long long long long gridlandMetro(int n, int m, int k, vector track) { LL N = n, M = m; LL total = N * M; vector id..

https://www.hackerrank.com/challenges/hackerland-radio-transmitters/problem Hackerland Radio Transmitters | HackerRank Find the minimum number of radio transmitters needed to cover all the houses in Hackerland! www.hackerrank.com #include using namespace std; int answer = 0, mmax = 0, kk = 0; bool home[100001]; int hackerlandRadioTransmitters(vector vec, int k) { kk = k; memset(home, false, size..

https://www.hackerrank.com/challenges/two-pluses/problem Ema's Supercomputer | HackerRank Determine the product of the areas of two pluses on a grid. www.hackerrank.com #include #include #include #include #include using namespace std; #define PII pair PII dir[4] = { {-1, 0}, {0, -1}, {1, 0}, {0, 1} }; bool visit[16][16] = { false, }; bool Check(vector& grid, int y, int x, int n, int m, int range..

https://www.hackerrank.com/challenges/fraudulent-activity-notifications/problem?isFullScreen=true Fraudulent Activity Notifications | HackerRank Print the number of times a customer receives a notification www.hackerrank.com #include using namespace std; vector vec; int n, answer; int FindLoca(int s, int e, int val) { int mid = (s + e) / 2; if (e = val) return FindLoca(s, mid, val); else if (vec..

* 정렬 알고리즘 ( Sort Algorithm ) 정렬 알고리즘은 굉장히 다양하고 상황 마다 효율적인 알고리즘이 다를 수 있다. 우선 간단한 것부터 개념 정리를 할 것이고 정렬에 관한 내용을 갱신해가며 업데이트 할 예정이다. ( 아래에 구현된 코드는 검증되지 않은 코드이다. ) 알고리즘을 만족하지 못하는 케이스가 있을 수 있다. *선택 정렬 ( Selection Sort ) / O( N2 ) => 처음부터 끝까지 탐색 후 데이터를 첫 순서 놓기 -> 2번째 idx 부터 끝까지 찾고 옮기기... { 1, 5, 10, 7, 2 } { 1, 5, 10, 7, 2 } { 1, 2, 10, 7, 5 } { 1, 2, 5, 7, 10 } { 1, 2, 5, 7, 10 } void SelectSort(std::ve..