lickelon.log

문제 링크 : boj.kr/2668난이도 : G5태그 : DFS코드#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]; } int cnt = 0; vector visit(n+1, -1); vect..

문제 링크 : boj.kr/1689난이도 : 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; cin >> n; vector sv(n), ev(n); for(int i = 0; i > sv[i] >> ev[i]; } sort(all(sv)); sort(all(ev)); ..

문제 링크 : boj.kr/27447난이도 : 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 cs(n); for(int i = 0; i > cs[i]; } sort(all(cs), greater()); int l = cs[0..

문제 링크 : boj.kr/25391난이도 : 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;bool comp(pll &a, pll &b) { if(a.second == b.second) { return a.first b.second;}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m, k; cin >> n >> m..

문제 링크 : boj.kr/5485난이도 : G2태그 : 애드 혹코드#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); for(auto &u : arr) cin >> u; int m, M; M = arr[0]; m = arr[0] - (arr[1]-a..

문제 링크 : boj.kr/17205난이도 : 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; string s; cin >> s; vector arr(n); for(int i = 0; i 풀이앞에서부터 보았을 떄, 현재 자리의 앞부분은 고정하고 현재 자리는 ..

문제 링크 : boj.kr/1593난이도 : 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 getNum(char c) { if(c & a, vector& b) { for(int i = 0; i > n >> m; string w, s; cin >> w >> s; vector target(52); for(auto u : w) target[getNum(u)]++; vector cnt(52)..

문제 링크 : boj.kr/2138난이도 : 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 check(string temp, string target) { int n = temp.size(); int cnt = 0; for(int i = 1; i > n; string curr, target; cin >> curr >> target; int ans = check(curr, target); cur..

문제 링크 : boj.kr/13312난이도 : 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;float _abs(float x){ return x dist(-100, 100); while(true) { arr[0] = dist(mt); arr[1] = dist(mt); if(arr[0] + arr[1] > 0) arr[2] = 100 - (arr[0] + arr[1]); el..

문제 링크 : boj.kr/31862난이도 : 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 arr(n+1); vector yet; for(int i = 0; i > a >> b >> c; if(c..