From 96022df10c3ed18dea411a92ff88f1f84c3566b6 Mon Sep 17 00:00:00 2001 From: Segcolt <9hmbzr275@mozmail.com> Date: Fri, 27 Sep 2024 20:50:37 -0300 Subject: [PATCH] Add a cses dp problem Trying to learn more about range dp. --- CSES Problem Set/Rectangle Cutting.cpp | 105 +++++++++++++++++++++++++ 1 file changed, 105 insertions(+) create mode 100644 CSES Problem Set/Rectangle Cutting.cpp diff --git a/CSES Problem Set/Rectangle Cutting.cpp b/CSES Problem Set/Rectangle Cutting.cpp new file mode 100644 index 0000000..aa6cb14 --- /dev/null +++ b/CSES Problem Set/Rectangle Cutting.cpp @@ -0,0 +1,105 @@ +/* Problem URL: https://cses.fi/problemset/task/1744 */ + +#include + +using namespace std; + +#define V vector + +#define rmin(a, b) a = min(a, b) +#define rmax(a, b) a = max(a, b) + +#define rep(i, lim) for (size_t i = 0; i < (lim); i++) +#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++) + +#define repv(i, v) for (auto &i : (v)) +#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; } +#define sortv(v) sort(v.begin(), v.end()) +#define all(v) (v).begin(), (v).end() + +using vi = vector; +using vvi = vector; +using vvvi = vector; +using vvvvi = vector; + +using ll = long long; + +using vl = vector; +using vvl = vector; +using vvvl = vector; +using vvvvl = vector; + +template +auto operator<<(ostream &os, const vector &vec)->ostream& { + os << vec[0]; + for (size_t i = 1; i < vec.size(); i++) { + os << ' ' << vec[i]; + } + os << '\n'; + return os; +} + +template +auto operator>>(istream &is, vector &vec)->istream& { + for (auto &i : vec) { + is >> i; + } + return is; +} + +template +auto operator<<(ostream &os, const vector> &vec)->ostream& { + for (auto &i : vec) { + os << i[0]; + for (size_t j = 1; j < i.size(); j++) { + os << ' ' << i[j]; + } + os << '\n'; + } + return os; +} + +template +auto operator>>(istream &is, vector> &vec)->istream& { + for (auto &i : vec) { + for (auto &j : i) { + is >> j; + } + } + return is; +} + +const ll inf = numeric_limits::max() >> 1; + +int main() +{ + ios::sync_with_stdio(false); + cin.tie(nullptr); + + int a, b; + cin >> a >> b; + if (a > b) { + swap(a, b); + } + + vvl dp(a + 1, vl(b + 1, inf)); + + for (size_t i = 0; i <= a; i++) { + dp[i][i] = 0; + } + + for (size_t i = 1; i <= a; i++) { + for (size_t j = 1; j <= b; j++) { + for (size_t k = 1; k <= (b / 2); k++) { + if (k < i) { + dp[i][j] = min(dp[i][j], dp[k][j] + dp[i - k][j] + 1); + } + if (k < j) { + dp[i][j] = min(dp[i][j], dp[i][k] + dp[i][j - k] + 1); + } + } + } + } + + cout << dp[a][b] << '\n'; +}