lickelon.log

문제 링크 : boj.kr/17505난이도 : G5태그 : 해 구성하기코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m; cin >> n >> m; vector arr(n+1, 0); for(int i = n; i > 0; i--) { if(m >= i-1) { m -= ..

문제 링크 : boj.kr/18869난이도 : G5태그 : 좌표압축코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;void process(vector& arr) { vector temp(arr.begin(), arr.end()); sort(all(temp)); temp.erase(unique(all(temp)), temp.end()); for(int i = 0; i > m >> n; vector> arr(m, vector(n));..

문제 링크 : boj.kr/1414난이도 : G3태그 : 최소스패닝트리코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;vector parent;int find(int x) { if(parent[x] == x) return x; return (parent[x] = find(parent[x]));}void merge(int x, int y) { x = find(x); y = find(y); if(x == y) return; pa..

문제 링크 : boj.kr/28018난이도 : G5태그 : 누적합코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int arr[1000002] = {}; for(int i = 0; i > s >> e; arr[s] += 1; arr[e+1] -= 1; } ..

문제 링크 : boj.kr/2487난이도 : G4태그 : 정수론, 순열사이클분할코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;ll gcd(ll a, ll b){ if (!b) return a; return gcd(b, a % b);}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n+1); vector..

문제 링크 : boj.kr/24023난이도 : G5태그 : 그리디코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector arr(n); for(auto &u : arr) cin >> u; int s, curr; s = curr = 0; for(int i..

문제 링크 : boj.kr/20666난이도 : G3태그 : 그리디, 우선순위 큐코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m; cin >> n >> m; vector arr(n+1); vector visit(n+1, false); for(ll i = 1; i > arr[i]; int p; ..

문제 링크 : boj.kr/16562난이도 : G4태그 : 유니온파인드코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int parent[10001];int cost[10001];int find(int x) { if(parent[x] == x) return x; return (parent[x] = find(parent[x]));}void merge(int x, int y) { x = find(x); y = find(y); if(c..

문제 링크 : boj.kr/16926난이도 : G5태그 : 구현코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, r; cin >> n >> m >> r; vector> arr(n, vector(m)); for(int i = 0; i > arr[i][j]; } } auto rot..

문제 링크 : boj.kr/22865난이도 : G4태그 : 다익스트라코드#include #define all(x) (x).begin(), (x).end()#define INF 1e18using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;vector dijkstra(ll start, vector> &edge) { vector d(edge.size(), INF); priority_queue> _pq; _pq.push({0, start}); while(!_pq.empty()) { ll dist = -_pq.top().first; ll curr ..