結果
問題 | No.874 正規表現間距離 |
ユーザー |
![]() |
提出日時 | 2020-03-03 03:03:19 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 5,539 bytes |
コンパイル時間 | 1,516 ms |
コンパイル使用メモリ | 173,480 KB |
実行使用メモリ | 34,560 KB |
最終ジャッジ日時 | 2024-10-13 21:39:48 |
合計ジャッジ時間 | 3,135 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 38 |
ソースコード
// >>> TEMPLATES#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using i32 = int32_t;using i64 = int64_t;#define int ll#define double ld#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)#define loop(i,a,B) for (int i = a; i B; i++)#define loopR(i,a,B) for (int i = a; i B; i--)#define all(x) (x).begin(), (x).end()#define allR(x) (x).rbegin(), (x).rend()#define pb push_back#define eb emplace_back#define mp make_pair#define fst first#define snd secondauto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;auto constexpr INF = numeric_limits<int>::max()/2-1;#ifdef LOCAL#include "debug.hpp"#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl#define debug if (1)#else#define dump(...) (void)(0)#define say(x) (void)(0)#define debug if (0)#endiftemplate <class T> using pque_max = priority_queue<T>;template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;template <class F> struct FixPoint : private F {constexpr FixPoint(F&& f) : F(forward<F>(f)) {}template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }};struct MakeFixPoint {template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }};#define MFP MakeFixPoint()|#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)template <class T, size_t d> struct vec_impl {using type = vector<typename vec_impl<T,d-1>::type>;template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }};template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }template <class T> void quit(T const& x) { cout << x << endl; exit(0); }template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }template <class T> int sz(T const& x) { return x.size(); }template <class C, class T> int lbd(C const& v, T const& x) {return lower_bound(v.begin(), v.end(), x)-v.begin();}template <class C, class T> int ubd(C const& v, T const& x) {return upper_bound(v.begin(), v.end(), x)-v.begin();}template <class C, class F> int ppt(C const& v, F f) {return partition_point(v.begin(), v.end(), f)-v.begin();}// <<<int32_t main() {string s,t; cin >> s >> t;int n = s.size(), m = t.size();auto dp = make_v<int,2>(n+1,m+1,INF);dp[0][0] = 0;rep (i,n+1) rep (j,m+1) {if (i == 0 && j == 0) continue;if (i == 0) {if (isalpha(t[j-1])) {chmin(dp[i][j], dp[i][j-1] + 1);} else {chmin(dp[i][j], dp[i][j-2]);}} else if (j == 0) {if (isalpha(s[i-1])) {chmin(dp[i][j], dp[i-1][j] + 1);} else {assert(i-2 >= 0);chmin(dp[i][j], dp[i-2][j]);}} else {if (!isalpha(s[i-1]) && !isalpha(t[j-1])) {chmin(dp[i][j], dp[i-2][j]);chmin(dp[i][j], dp[i][j-2]);} else if (s[i-1] == '?') {chmin(dp[i][j], dp[i-1][j]);chmin(dp[i][j], dp[i-2][j]);} else if (s[i-1] == '*') {chmin(dp[i][j], dp[i-2][j]);chmin(dp[i][j], dp[i][j-1] + (s[i-2] != t[j-1]));} else if (t[j-1] == '?') {chmin(dp[i][j], dp[i][j-1]);chmin(dp[i][j], dp[i][j-2]);} else if (t[j-1] == '*') {chmin(dp[i][j], dp[i][j-2]);chmin(dp[i][j], dp[i-1][j] + (s[i-1] != t[j-2]));} else {assert(isalpha(s[i-1]));assert(isalpha(t[j-1]));chmin(dp[i][j], dp[i][j-1] + 1);chmin(dp[i][j], dp[i-1][j] + 1);chmin(dp[i][j], dp[i-1][j-1] + (s[i-1] != t[j-1]));}}}cout << dp[n][m] << endl;}