1. problem : https://www.acmicpc.net/problem/2750 2. solution 1 :#include using namespace std;int n;int arr[1005];void quick_sort(int st, int en) { if (en = arr[lidx]) lidx++; while (lidx ridx) break; swap(arr[lidx], arr[ridx]); } swap(arr[ridx], arr[st]); quick_sort(st, ridx); quick_sort(ridx + 1, en); }int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i > ar..

1. code 1 :#include using namespace std;int n = 10;int arr[1000001] = {15, 25, 22, 357, 16, 23, -53, 12, 46, 3};void quick_sort(int st, int en) { // arr[st to en-1]을 정렬할 예정 if(en = pivot) r--; if(l > r) break; // l과 r이 역전되는 그 즉시 탈출 swap(arr[l], arr[r]); } swap(arr[st], arr[r]); quick_sort(st, r); quick_sort(r+1, en);}int main() { ios_base::sync_with_stdio(0); cin.tie(0); quick_sort..

#include using namespace std;int n;int arr[1000005];int tmp[2000005];void merge(int st, int ed) { int mid = (st + ed) / 2; int lidx = st; int ridx = mid; for (int i = st; i > n; for (int i = 0; i > arr[i]; merge_sort(0, n); for (int i = 0; i

1. problem : https://www.acmicpc.net/problem/2751 2. solution 1 :#include using namespace std;int n;int arr[1000005];int tmp[2000005];void merge(int st, int ed) { int mid = (st + ed) / 2; int lidx = st; int ridx = mid; for (int i = st; i > n; for (int i = 0; i > arr[i]; merge_sort(0, n); for (int i = 0; i

1. problem : https://www.acmicpc.net/problem/11728  2. solution 1 :#include using namespace std;int n, m;int num1[1000002]; int num2[1000002]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i > num1[i]; for (int i = 0; i > num2[i]; int idx1 = 0; int idx2 = 0; vector arr; while (idx1

1. problem : https://www.acmicpc.net/problem/15685 2. solution 1 :#include using namespace std;#define X first#define Y secondint board[102][102];int n;int dx[4] = { 1,0,-1,0 }; // 동 -> 북 -> 서 -> 남 // 열 int dy[4] = { 0,-1,0,1 }; // 행int ans;int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; while (n--) { int x, y, d, g; cin >> x >> y >> d >> g; //x,y좌표, 방향, 세대 pair cur = { y,x ..