110 lines
2.4 KiB
C++
110 lines
2.4 KiB
C++
/* Problem URL: https://cses.fi/problemset/task/1639 */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
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<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &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<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
const ll inf = INT64_MAX >> 1;
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
string a, b;
|
|
cin >> a >> b;
|
|
|
|
vvl dp(a.size() + 1, vl(b.size() + 1, inf));
|
|
dp[0][0] = 0;
|
|
for (size_t i = 0; i <= a.size(); i++) {
|
|
for (size_t j = 0; j <= b.size(); j++) {
|
|
if (i == 0 && j == 0) {
|
|
continue;
|
|
}
|
|
|
|
if (i == 0) {
|
|
rmin(dp[i][j], dp[i][j - 1] + 1);
|
|
continue;
|
|
}
|
|
if (j == 0) {
|
|
rmin(dp[i][j], dp[i - 1][j] + 1);
|
|
continue;
|
|
}
|
|
|
|
if (a[i - 1] == b[j - 1]) {
|
|
rmin(dp[i][j], dp[i - 1][j - 1]);
|
|
continue;
|
|
}
|
|
|
|
rmin(dp[i][j], min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1);
|
|
}
|
|
}
|
|
|
|
cout << dp[a.size()][b.size()] << '\n';
|
|
}
|