lickelon.log

문제 링크 : boj.kr/31233난이도 : 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 ans = min(arr[0], arr[1]); for(int i = 2; i..

문제 링크 : boj.kr/17073난이도 : 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); cout.precision(6); cout > n >> w; vector arr(n+1); for(int i = 0; i > a >> b; arr[a]++; arr[b]++; ..

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

문제 링크 : boj.kr/2467난이도 : 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); for(auto &u : arr) cin >> u; int s = 0, e = n-1; int m = INF; pii ans; ..

문제 링크 : boj.kr/2470난이도 : 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); for(auto &u : arr) cin >> u; sort(all(arr)); int s = 0, e = n-1; int..

문제 링크 : boj.kr/14938난이도 : G4태그 : 플로이드 워셜코드#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, m, r; cin >> n >> m >> r; vector items(n); for(auto &u : items) cin >> u; vector> arr(n, vector(n, IN..

문제 링크 : boj.kr/11265난이도 : 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, vector(n)); for(int i = 0; i > arr[i][j]; } } for(int k =..

문제 링크 : boj.kr/5625난이도 : 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); int n; cin >> n; int arrX[1000001] = {}; int arrY[1000001] = {}; for(int i = 0; i > x1 >> y1 >> x2 >> y2 >>..

문제 링크 : boj.kr/13424난이도 : G4태그 : 다익스트라코드#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 T; cin >> T; while(T--) { int n, m; cin >> n >> m; vector> edge(n+1); for(int i = 0;..

문제 링크 : boj.kr/17436난이도 : 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, m; cin >> n >> m; ll ans = 0; vector arr(n); for(auto &u : arr) cin >> u; for(int i = 1; i 풀이m을 어떤 수로 ..