結果
問題 | No.874 正規表現間距離 |
ユーザー |
![]() |
提出日時 | 2023-05-03 17:08:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 48 ms / 2,000 ms |
コード長 | 2,460 bytes |
コンパイル時間 | 2,095 ms |
コンパイル使用メモリ | 200,180 KB |
最終ジャッジ日時 | 2025-02-12 16:40:19 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 38 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;//using mint = modint1000000007;//const int mod = 1000000007;//using mint = modint998244353;//const int mod = 998244353;const int INF = 1e9;//const long long LINF = 1e18;#define rep(i, n) for (int i = 0; i < (n); ++i)#define rep2(i,l,r)for(int i=(l);i<(r);++i)#define rrep(i, n) for (int i = (n-1); i >= 0; --i)#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)#define all(x) (x).begin(),(x).end()#define allR(x) (x).rbegin(),(x).rend()#define endl "\n"#define P pair<int,int>template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }bool isMark(char c) {return c == '?' || c == '*';}void pre(string &s) {int n = s.size();for (int i = 0; i < n - 1; i++) {if (!isMark(s[i]) && isMark(s[i + 1])) {swap(s[i], s[i + 1]);}}s += "$"; // 番兵.}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);string a, b; cin >> a >> b;int n = a.size();int m = b.size();pre(a); pre(b);vector<vector<int>> dp(n + 1, vector<int>(m + 1, INF));dp[0][0] = 0;rep(i, n + 1)rep(j, m + 1) {if (!isMark(a[i]) && !isMark(b[j])) {if (i <= n - 1)chmin(dp[i + 1][j + 0], dp[i][j] + 1);if (j <= m - 1)chmin(dp[i + 0][j + 1], dp[i][j] + 1);if ((i <= n - 1) && (j <= m - 1)) chmin(dp[i + 1][j + 1], dp[i][j] + (a[i] != b[j]));}else if (('?' == a[i]) && !isMark(b[j])) {chmin(dp[i + 2][j], dp[i][j]);//0if (j <= m - 1)chmin(dp[i][j + 1], dp[i][j] + 1);//次で使うif (j <= m - 1)chmin(dp[i + 2][j + 1], dp[i][j] + (a[i + 1] != b[j]));//1}else if (!isMark(a[i]) && ('?' == b[j])) {chmin(dp[i][j + 2], dp[i][j]);//0if (i <= n - 1)chmin(dp[i + 1][j], dp[i][j] + 1);//次で使うif (i <= n - 1)chmin(dp[i + 1][j + 2], dp[i][j] + (a[i] != b[j + 1]));//1}else if (('*' == a[i]) && !isMark(b[j])) {chmin(dp[i + 2][j], dp[i][j]);//0if (j <= m - 1)chmin(dp[i][j + 1], dp[i][j] + (a[i + 1] != b[j]));//1}else if (!isMark(a[i]) && ('*' == b[j])) {chmin(dp[i][j + 2], dp[i][j]);//0if (i <= n - 1)chmin(dp[i + 1][j], dp[i][j] + (a[i] != b[j + 1]));//1}else {chmin(dp[i + 2][j], dp[i][j]);chmin(dp[i][j + 2], dp[i][j]);}}cout << dp[n][m] << endl;return 0;}