lickelon.log

문제 링크 : boj.kr/17306난이도 : P3태그 : 트라이코드#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;class Trie {public: Trie* children[2]; bool end; int cnt; Trie() : end(false), cnt(0) { children[0] = children[1] = 0; } void insert(vector& key) { this->_insert(..

문제 링크 : boj.kr/6073난이도 : 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;class Trie {public: unordered_map children; int end; int cnt; Trie() : end(0), cnt(0) {} void insert(vector& key) { this->_insert(key, 0); }; int find(vector& key) { ..

문제 링크 : boj.kr/13504난이도 : P3태그 : 트라이코드#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;class Trie {public: Trie* children[2]; bool end; Trie() : end(false) {children[0] = children[1] = NULL;} void insert(vector& key) { this->_insert(key, 0); }; int find(ve..

문제 링크 : boj.kr/19585난이도 : P3태그 : 트라이코드#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;class Trie {public: unordered_map children; bool end; Trie() : end(false) {} void insert(vector& key) { this->_insert(key, 0); }; bool find(vector& key) { return ..

문제 링크 : boj.kr/5670난이도 : 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;class Trie {public: unordered_map children; bool end; Trie() : end(false) {} void insert(vector& key) { this->_insert(key, 0); }; bool find(vector& key) { return t..

문제 링크 : boj.kr/12741난이도 : 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; this->..

문제 링크 : boj.kr/10977난이도 : P4태그 : KMP코드#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;vector getPi(vector P) { int L = (int)P.size(); vector Pi(L,0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j..

문제 링크 : boj.kr/3356난이도 : P4태그 : KMP코드#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;vector getPi(string P) { int L = (int)P.size(); vector Pi(L,0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j;..

문제 링크 : boj.kr/1893난이도 : P4태그 : KMP코드#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;vector getPi(vector &P) { vector Pi(P.size(),0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j; } return Pi..

문제 링크 : boj.kr/1498난이도 : P4태그 : KMP코드#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;vector getPi(string P) { int L = (int)P.size(); vector Pi(L,0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j;..