lickelon.log

문제 링크 : boj.kr/27972난이도 : S1태그 : 그리디코드#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 &e : arr) cin >> e; int ans = 1; int cnt = 1; int flag = 0; f..

문제 링크 : boj.kr/15975난이도 : S3태그 : 정렬코드#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 &e : arr) cin >> e.first >> e.second; arr.push_back({0, -1}); arr.pu..

문제 링크 : boj.kr/28278난이도 : S4태그 : 스택코드#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; stack _st; while(n--) { int q; cin >> q; if(q == 1) { int input; ..

문제 링크 : boj.kr/9996난이도 : S3태그 : 문자열, 정규표현식코드#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 pat; cin >> pat; string new_pat = pat.substr(0, pat.find("*")) + ".*" + pat.subst..

문제 링크 : boj.kr/33257난이도 : S4태그 : 정렬, 그리디코드#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, e; cin >> n >> e; vector arr(n); for(auto &e : arr) cin >> e; sort(all(arr)); int ans = 1; for..

문제 링크 : boj.kr/2823난이도 : S2태그 : 그래프 이론코드#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 r, c; cin >> r >> c; vector> board(r+2, vector(c+2, 0)); for(int i = 1; i > s; for(int j = 1; j 풀이어떤 ..

문제 링크 : boj.kr/10025난이도 : S3태그 : 두 포인터코드#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 &e : arr) cin >> e.second >> e.first; sort(all(arr)); int..

문제 링크 : boj.kr/11060난이도 : S2태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321using 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 &e : arr) cin >> e; vector dp(n, INF); dp[0] = 0; for(int i = ..

문제 링크 : boj.kr/10866난이도 : S4태그 : 덱코드#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); deque _dq; int n; cin >> n; while(n--) { string inst; cin >> inst; if(inst == "push_front") { ..

문제 링크 : boj.kr/29160난이도 : S2태그 : 우선순위 큐코드#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; priority_queue player[11]; for(int i = 0; i > p >> w; player[p-1].push(w); }..