jcoding09 · June 28, 2026 17:40
diff --git a/CP.md b/CP.md
diff --git a/DpTypes.md b/DpTypes.md
diff --git a/Roadmap.md b/Roadmap.md
diff --git a/template.cpp b/template.cpp
 #include <bits/stdc++.h>
 using namespace std;

 // ───── Type Aliases ─────
 // Rule of thumb: only alias a type if ALL 3 are true:
 //   1. You use it in >30% of problems
 //   2. You use it without modification (no custom comparator/hash/size)
 //   3. The original name is long enough to be annoying
 // e.g. vector<vector<int>>        → all three ✓ → aliased as vvi
 //      vector<vector<vector<int>>> → fails rule 1 & 2 → skipped
 using ll  = long long;
 using ull = unsigned long long;
 using ld  = long double;
 using pii = pair<int, int>;
 using pll = pair<ll, ll>;
 using vi  = vector<int>;
 using vll = vector<ll>;
 using vvi = vector<vector<int>>;
 using vvl = vector<vector<ll>>;
 using vpii = vector<pii>;
 using vpll = vector<pll>;
 using si  = set<int>;
 using mii = map<int, int>;
 using mll = map<ll, ll>;
 using msi = map<string, int>;
 using str = string;

 // ───── Macros ─────
 #define all(x)       (x).begin(), (x).end()
 #define rall(x)      (x).rbegin(), (x).rend()
 #define pb           push_back
 #define eb           emplace_back
 #define fi           first
 #define se           second
 #define sz(x)        (int)(x).size()
 #define rep(i, a, b) for (int i = (a); i < (b); ++i)
 #define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)

 // ───── Constants ─────
 const int   INF  = 0x3f3f3f3f;
 const ll    LINF = 0x3f3f3f3f3f3f3f3fLL;
 const int   MOD  = 1e9 + 7;
 const double PI  = acos(-1.0);

 // ───── Debug (disabled on judge) ─────
 #ifdef LOCAL
  #define dbg(x) cerr << #x << " = " << (x) << "\n"
 #else
  #define dbg(x)
 #endif

 // ───── Fast I/O ─────
 void setIO(const string& name = "") {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    if (!name.empty()) {
        freopen((name + ".in").c_str(),  "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
 }

 // ───── Utility ─────
 template<typename T> void chmin(T& a, const T& b) { if (b < a) a = b; }
 template<typename T> void chmax(T& a, const T& b) { if (b > a) a = b; }

 ll power(ll base, ll exp, ll mod = MOD) {
    ll result = 1;
    base %= mod;
    while (exp > 0) {
        if (exp & 1) result = result * base % mod;
        base = base * base % mod;
        exp >>= 1;
    }
    return result;
 }

 // ═══════════════════════════════════════
 void solve() {
    // ── your solution here ──

 }
 // ═══════════════════════════════════════

 int main() {
    setIO(); // pass a filename string for file I/O, e.g. setIO("problem")

    int t = 1;
    cin >> t;          // remove this line if there's only one test case
    while (t--) solve();

    return 0;
 }
Level	Categories
Beginner	1-D DP, 2-D DP, Knapsack, String DP
Intermediate	Partition DP, LIS, Interval DP, Tree DP, Bitmask DP
Advanced	Digit DP, SOS DP, Profile DP, Convex Hull Trick, Automata DP
Expert	3-D/4-D DP, Stack Optimization, DP + Segment Tree, Probability DP
Constraint	Expected Complexity
N ≤ 10	O(N!) or O(2^N · N²)
N ≤ 20	O(2^N)
N ≤ 500	O(N³)
N ≤ 5000	O(N²)
N ≤ 2×10⁵	O(N log N)
N ≤ 10⁷	O(N)
Large N	O(log N) or O(1)
Operation	Code
Check bit i	`mask & (1 << i)`
Set bit i	`mask \| (1 << i)`
Clear bit i	`mask & ~(1 << i)`
Toggle bit i	`mask ^ (1 << i)`
Lowest set bit	`mask & (-mask)`
Algorithm	Weights	Complexity	Use Case
BFS	Unweighted	O(V+E)	Equal edge weights
Dijkstra	Non-negative	O((V+E) log V)	Standard SSSP
Bellman-Ford	Any (neg OK)	O(V×E)	Negative edges
Floyd-Warshall	Any	O(V³)	All pairs SP
0-1 BFS	{0,1} only	O(V+E)	Binary weights
Difficulty	Categories
🟢 Easy	1-D DP, 2-D DP, Kadane, Basic Knapsack, Basic String DP
🟡 Medium	LIS, Full Knapsack, Full String DP, Partition DP, Tree DP basics
🔴 Hard	Interval DP, Digit DP, Bitmask DP, 3D/4D DP, Rerooting
⚫ Very Hard	CHT, Li Chao, D&C DP, Knuth's Opt, Profile DP, Automata DP
Tier	Target Problems	Goal
Tier 1–2	30–50	Build speed & fluency
Tier 3–4	50–80	Pattern recognition
Tier 5–6	60–100	Graph confidence
Tier 7 DP	100–150	Master all DP types
Total	~300	Div.2 D/E ready
	#include <bits/stdc++.h>
	using namespace std;

	// ───── Type Aliases ─────
	// Rule of thumb: only alias a type if ALL 3 are true:
	// 1. You use it in >30% of problems
	// 2. You use it without modification (no custom comparator/hash/size)
	// 3. The original name is long enough to be annoying
	// e.g. vector<vector<int>> → all three ✓ → aliased as vvi
	// vector<vector<vector<int>>> → fails rule 1 & 2 → skipped
	using ll = long long;
	using ull = unsigned long long;
	using ld = long double;
	using pii = pair<int, int>;
	using pll = pair<ll, ll>;
	using vi = vector<int>;
	using vll = vector<ll>;
	using vvi = vector<vector<int>>;
	using vvl = vector<vector<ll>>;
	using vpii = vector<pii>;
	using vpll = vector<pll>;
	using si = set<int>;
	using mii = map<int, int>;
	using mll = map<ll, ll>;
	using msi = map<string, int>;
	using str = string;

	// ───── Macros ─────
	#define all(x) (x).begin(), (x).end()
	#define rall(x) (x).rbegin(), (x).rend()
	#define pb push_back
	#define eb emplace_back
	#define fi first
	#define se second
	#define sz(x) (int)(x).size()
	#define rep(i, a, b) for (int i = (a); i < (b); ++i)
	#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)

	// ───── Constants ─────
	const int INF = 0x3f3f3f3f;
	const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
	const int MOD = 1e9 + 7;
	const double PI = acos(-1.0);

	// ───── Debug (disabled on judge) ─────
	#ifdef LOCAL
	#define dbg(x) cerr << #x << " = " << (x) << "\n"
	#else
	#define dbg(x)
	#endif

	// ───── Fast I/O ─────
	void setIO(const string& name = "") {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	if (!name.empty()) {
	freopen((name + ".in").c_str(), "r", stdin);
	freopen((name + ".out").c_str(), "w", stdout);
	}
	}

	// ───── Utility ─────
	template<typename T> void chmin(T& a, const T& b) { if (b < a) a = b; }
	template<typename T> void chmax(T& a, const T& b) { if (b > a) a = b; }

	ll power(ll base, ll exp, ll mod = MOD) {
	ll result = 1;
	base %= mod;
	while (exp > 0) {
	if (exp & 1) result = result * base % mod;
	base = base * base % mod;
	exp >>= 1;
	}
	return result;
	}

	// ═══════════════════════════════════════
	void solve() {
	// ── your solution here ──

	}
	// ═══════════════════════════════════════

	int main() {
	setIO(); // pass a filename string for file I/O, e.g. setIO("problem")

	int t = 1;
	cin >> t; // remove this line if there's only one test case
	while (t--) solve();

	return 0;
	}