lickelon.log

문제 링크 : boj.kr/16903난이도 : P3태그 : 트라이코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MAX_LEN 31using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Trie {public: Trie* children[2]; int cnt; Trie() { children[0] = children[1] = NULL; cnt = 0; } void insert(int key, int q, int depth = MAX_L..

문제 링크 : boj.kr/27524난이도 : 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; ll end; ll M; Trie() { end = 0; M = 0; } void insert(vector& key, ll score) { this->_insert(key, 0, score); ..

문제 링크 : boj.kr/13445난이도 : P2태그 : 트라이코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MAX_LEN 20using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int k;class Trie {public: Trie* children[2]; int cnt; Trie() { children[0] = children[1] = NULL; cnt = 0; } void insert(int key, int depth = MAX_LE..

문제 링크 : boj.kr/11840난이도 : P2태그 : 트라이, 이분탐색코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MAX_LEN 31using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Trie {public: Trie* children[2]; int m_idx; Trie() { children[0] = children[1] = NULL; m_idx = INF; } void insert(int num, int idx) { ..

문제 링크 : boj.kr/30210난이도 : 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); }; ll find(vector& key) { return th..

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

문제 링크 : http://boj.kr/30865난이도 : 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]; int end; int cnt; Trie() : end(0), cnt(0) { children[0] = children[1] = 0; } void insert(vector& key, int add) { thi..

문제 링크 : boj.kr/4273난이도 : 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/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) { ..