lickelon.log

문제 링크 : boj.kr/2096난이도 : G5태그 : DP코드#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; array arr, M, m, temp; for(int i = 0; i > arr[0] >> arr[1] >> arr[2]; temp[0] = max({M[0], M..

문제 링크 : http://boj.kr/12757난이도 : 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;map::iterator find(map &_m, int idx, int dist) { auto l = _m.lower_bound(idx); auto d = _m.find(idx); auto r = _m.upper_bound(idx); if(d != _m.end()) return d; if(l..

문제 링크 : boj.kr/5972난이도 : 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;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 ..

문제 링크 : boj.kr/15711난이도 : 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 sieve(int n) { vector primes; vector check(n+1, true); for(int i = 2; i > T; vector primes = sieve(2e6); while(T--) { ll a, b; cin >> a >> b; a ..

문제 링크 : boj.kr/17841난이도 : G3태그 : DP코드#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; vector arr(n); string target = "UNIST"; for(int i = 0; i > s; pii curr = {0, 0}; ..

문제 링크 : boj.kr/5831난이도 : 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, b; cin >> n >> b; vector visit(1 > input; curr += input; } visit[curr] = 1; whi..

문제 링크 : boj.kr/25634난이도 : 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; vector arr(n+1); for(int i = 1; i > arr[i]; } ll sum = 0; bool check = true; for(int ..

문제 링크 : boj.kr/19951난이도 : 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; cin >> n >> m; vector arr(n); for(auto &u: arr) cin >> u; vector amount(n+1); for(int i = 0; i > a..

문제 링크 : boj.kr/30049난이도 : 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 main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; vector cnt(n+1); vector top(m+1); map info; int ans = 0; auto updat..

문제 링크 : boj.kr/28437난이도 : G3태그 : DP, 정수론코드#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; vector arr(100001); for(int i = 0; i > input; arr[input] += 1; } for(int i = 1; ..