lickelon.log

문제 링크 : http://boj.kr/31563난이도 : 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, q; cin >> n >> q; vector arr(2*n+1); for(int i = 1; i > arr[i]; arr[i+n] = arr[i]; } fo..

문제 링크 : boj.kr/17410난이도 : D5태그 : 제곱근 분할법, 누적합코드#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 s = sqrt(n); vector> bucket(n/s+1)..

문제 링크 : boj.kr/20052난이도 : P4태그 : 세그먼트 트리, 누적합코드#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;templateclass segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: segTree(ll n, T id, T(*merge)(T, T)) { this->n = n; this->id = id; t..

문제 링크 : boj.kr/18874난이도 : P4태그 : 세그먼트 트리, 누적합코드#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;templateclass segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: segTree(ll n, T id, T(*merge)(T, T)) { this->n = n; this->id = id; t..

문제 링크 : boj.kr/25634난이도 : 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+1); for(int i = 1; i > arr[i]; } ll sum = 0; bool check = true; for(int ..

문제 링크 : boj.kr/19951난이도 : 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); for(auto &u: arr) cin >> u; vector amount(n+1); for(int i = 0; i > a..

문제 링크 : boj.kr/32114난이도 : 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 cap(n), arr(n+1); for(int i = 1; i > cap[i]; for(int i = 0; i > a >> b >> c..

문제 링크 : boj.kr/19584난이도 : 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, m; cin >> n >> m; vector arr(n+1); for(int i = 1; i > a >> b; arr[i] = b; } map _m; for(..

문제 링크 : boj.kr/3126난이도 : 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;ll dx[8] = {0, -1, -1, -1, 0, 1, 1, 1};ll dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};struct d { ll dir[8];};int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precisio..

문제 링크 : boj.kr/27923난이도 : 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, k, l; cin >> n >> k >> l; vector h(n); for(auto &u : h) cin >> u; vector c(n); for(int i = 0..