최근 글
검색 결과
[정올] 3520 / Tutorial: STL Sort 4(심화)

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; struct Student{ string name; int like_percent; int idx; bool operator rhs.like_percent; } }; int n ..

[정올] 3519 / Tutorial : 합병(병합)정렬(Merge Sort)

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int n; int arr[500005] , finalCopyArr[500005]; void mergeSort(int* arr , int st , int ed){ if(st >= ed) return; int mid = (st + ed) / 2; mergeSort(arr , st , mid); mergeSort(arr, mid + 1 , ed); int i = st, j = mid + 1, k = st; while (i

[정올] 3518 / Tutorial : 퀵소트(Quick Sort 빠른정렬)

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; typedef pair ppi_i__pi_i; typedef pair pll_ll; typedef vector vi; typedef vector vs; typedef vector vll; typedef map mii; typedef map ms_i; typedef map ms_s; typedef set si; typedef set ss; typedef set sll; int a[1005]; int n; void quick_sort(int low , int high){ ..

[정올] 3517 / Tutorial : 이진탐색(Binary Search-이진검색)

#include using namespace std; typedef long long ll; typedef pair pii; int n , q; const int MAXN = 500000; int a[MAXN +5]; int main(){ cin.tie(0); cout.tie(0); cin >> n; for(int i = 0;i > a[i]; } cin >> q; for(int i = 0;i > fv; int low = 0 , high = n - 1; bool printed = false; while(low = n){ cout

[정올] 4524 / Tutorial: STL Sort 2

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int n; int a[100005]; int main(){ cin.tie(0); cout.tie(0); cin >> n; for(int i = 0;i > a[i]; // 이게 함수 버전 sort(a , a + n , greater()); // reverse 버전 // sort(a,a+n); // reverse(a,a+n); for(int i = 0;i < n;i++)cout

[정올] 4523 / Tutorial: STL Sort 1

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int n; int a[100005]; int main(){ cin.tie(0); cout.tie(0); cin >> n; for(int i = 0;i > a[i]; int s , e; cin >> s >> e; sort(a + s , a + e + 1); for(int i = 0;i < n;i++)cout

[정올] 4189 / 장기 2

#include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair pi_i; int n , m; int stY , stX , edY , edX; int dx[] = {1,2,2,1,-1,-2,-2,-1}; int dy[] = {2,1,-1,-2,-2,-1,1,2}; bool visited[1005][1005]; int main(){ cin.tie(0); cout.tie(0); cin >> n >> m >> stY >> stX >> edY >> edX; queue q; q.push({{stY , stX} , 0}); visited[stY][stX..

[정올] 3431 / [백준] 17619 / 개구리 점프(frogjump)

#include #include #include using namespace std; struct Line { int sx; int ex; int idx; }; int group[100010]; bool cmp(Line a, Line b) { return a.sx > n >> q; vector lines; for (int i = 0; i > a >> b >> c; lines.push_back({ a , b , i + 1 }); } sort(lines.begin(), lines.en..

[정올] 3428 / [백준] 17616 / 등수 찾기(ranking)

#include using namespace std; vector adj[2][100001]; bool visited[100001]; int n, M, X, k; int dfs(int n) { visited[n] = 1; int ret = 1; for (auto v : adj[k][n]) { if (!visited[v]) ret += dfs(v); } return ret; } int main() { cin >> n >> M >> X; for (int i = 0; i > u >> v; adj[0][u].push_back(v); adj[1][v].push_back(u); } int U, V; U = n - dfs(X) + 1; k = 1; V = dfs(X);..

티스토리툴바