lickelon.log

문제 링크 : 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 ..

문제 링크 : boj.kr/31648난이도 : 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 T; cin >> T; while(T--) { string s; cin >> s; if(s.back() == '0') { cout 풀..

문제 링크 : boj.kr/1959난이도 : 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 m, n; cin >> m >> n; if(m == n) { cout n) { cout 풀이상황별로 나누어 값을 출력해주면 된다.모양:(정사각형, 세로가 긴 직사각형, 가..

문제 링크 : boj.kr/1766난이도 : G2태그 : 위상정렬, 우선순위 큐코드#include using namespace std;vector topology_sort(vector>& e) { int n = e.size() - 1; vector deg(n+1); for(int i = 1; i , greater> pq; for(int i = 1; i ans; while(!pq.empty()) { int curr = pq.top(); pq.pop(); ans.emplace_back(curr); for(auto u : e[curr]) { deg[u]--; if(deg[u] == 0) pq.push(u)..

문제 링크 : boj.kr/1041난이도 : G5태그 : 그리디코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321#define int long longusing namespace std;using ld = long double;using pii = pair;template istream& operator>>(istream & ist, pair &p) { ist >> p.first >> p.second; return ist;}template istream& operator>>(istream & ist, vector &arr) { for(auto &u : arr) ist >> u; return ist;}int32_..

문제 링크 : boj.kr/17943난이도 : G4태그 : 누적합코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321#define int long longusing namespace std;using ld = long double;using pii = pair;int32_t main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; vector arr(n); for(int i = 1; i > arr[i]; arr[i] ^= arr[i-1]; } for(int i = 0; i > s; ..

문제 링크 : boj.kr/31887난이도 : P5태그 : 그리디, 두 포인터코드#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 m; cin >> m; vector arr(n); unordered_set gss; for(int i = 0; i > input; ..

문제 링크 boj.kr/31928난이도 : G4태그 : 해 구성하기코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321#define int long longusing namespace std;using ld = long double;using pii = pair;template istream& operator>>(istream & ist, pair &p) { ist >> p.first >> p.second; return ist;}template istream& operator>>(istream & ist, vector &arr) { for(auto &u : arr) ist >> u; return ist;}int ..