lickelon.log

문제 링크 : boj.kr/14940난이도 : S1태그 : BFS코드#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> board(n+2, vector(m+2)); pii start; for(int i = 1; i > board[i][j]; ..

문제 링크 : boj.kr/15887난이도 : S5태그 : 구현코드#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; vector ans; for(int i = 0; i 풀이모든 i번째 카드에 정수 i가 ..

문제 링크 : boj.kr/1059난이도 : 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 l; cin >> l; vector arr(l); for(auto &e : arr) cin >> e; arr.push_back(0); arr.push_back(1001); ..

문제 링크 : http://boj.kr/11665난이도 : S5태그 : 기하학코드#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; pii x, y, z; x = y = z = {0, INF}; for(int i = 0; i > x1 >> y1 >> z1 >> x2 >> y2 >> z2;..

문제 링크 : boj.kr/2346난이도 : 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; deque arr(n); for(int i = 0; i > arr[i].second; arr[i].first = i+1; } while(!arr..

문제 링크 : boj.kr/21030난이도 : S5태그 : 문자열코드#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 a, b; cin >> a >> b; vector cnt(26); for(int i = 0; i 풀이가능한 모든 문자열 중 중복되는 문자가 제일 많은 ..

문제 링크 : boj.kr/7795난이도 : 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 T; cin >> T; while(T--) { int n, m; cin >> n >> m; vector arr(n); for(auto &e : a..

문제 링크 : boj.kr/10825난이도 : 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;using info = tuple;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &[s, a, b, c] : arr) { cin >> s >> a >> b >> c; ..

문제 링크 : boj.kr/17127난이도 : S5태그 : 그리디코드#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 = 0; for(int s = 0; s 풀이그리디하게 생각해보면 길이가..

문제 링크 : boj.kr/27111난이도 : S5태그 : 셋코드#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); unordered_set _s; int n; cin >> n; int ans = 0; for(int i = 0; i > a >> b; if(b) { if(_s.find(a..