lickelon.log

문제 링크 : 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/32932난이도 : 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, k; cin >> n >> k; set _s; for(int i = 0; i > a >> b; _s.emplace(a, b); } int x = 0, y = 0; s..

문제 링크 : boj.kr/32748난이도 : 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); map f, r; for(int i = 0; i > input; f[i] = input; r[input] = i; } string a, b; cin >> a >> b;..

문제 링크 : boj.kr/20006난이도 : 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;struct player{ int level; string id;};struct room{ int level; int limit; vector players; room(int level, int limit) { this->level = level; this->limit = limit; ..

문제 링크 : 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/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/32031난이도 : G2태그 : 구현, 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 dx[] = {0,0, -1, 1, 0, 0};int dy[] = {0, 0, 0, 0, -1, 1};int dz[] = {-1, 1, 0, 0, 0, 0};struct node { bool is_cut[6]; //UDLRBF};node frame[400][400][2];bool visited[400][400][2];//xy(..

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

문제 링크 : 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/28067난이도 : 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; cin >> n >> m; vector arr; for(int i = 0; i > _s; int s = arr.size(); for(int i = 0; i ..