結果

問題 No.2231 Surprising Flash!
ユーザー AngrySadEightAngrySadEight
提出日時 2023-02-14 21:49:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,473 bytes
コンパイル時間 3,425 ms
コンパイル使用メモリ 144,436 KB
実行使用メモリ 100,380 KB
最終ジャッジ日時 2023-10-11 08:19:42
合計ジャッジ時間 25,070 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,368 KB
testcase_01 AC 4 ms
4,372 KB
testcase_02 AC 26 ms
4,368 KB
testcase_03 AC 359 ms
4,368 KB
testcase_04 AC 16 ms
4,368 KB
testcase_05 AC 36 ms
4,372 KB
testcase_06 AC 49 ms
4,368 KB
testcase_07 AC 3 ms
4,372 KB
testcase_08 AC 9 ms
4,368 KB
testcase_09 AC 1 ms
4,372 KB
testcase_10 AC 10 ms
4,596 KB
testcase_11 AC 667 ms
76,840 KB
testcase_12 AC 670 ms
100,316 KB
testcase_13 AC 674 ms
100,380 KB
testcase_14 AC 617 ms
66,376 KB
testcase_15 AC 660 ms
76,928 KB
testcase_16 AC 636 ms
6,632 KB
testcase_17 AC 664 ms
10,332 KB
testcase_18 AC 664 ms
66,336 KB
testcase_19 AC 674 ms
66,392 KB
testcase_20 AC 666 ms
66,288 KB
testcase_21 AC 650 ms
66,424 KB
testcase_22 AC 651 ms
66,460 KB
testcase_23 AC 663 ms
66,420 KB
testcase_24 AC 671 ms
66,396 KB
testcase_25 AC 657 ms
66,468 KB
testcase_26 AC 671 ms
66,532 KB
testcase_27 AC 657 ms
66,440 KB
testcase_28 AC 663 ms
66,532 KB
testcase_29 AC 719 ms
76,844 KB
testcase_30 AC 708 ms
77,100 KB
testcase_31 AC 678 ms
76,912 KB
testcase_32 AC 698 ms
76,876 KB
testcase_33 AC 693 ms
76,904 KB
testcase_34 AC 617 ms
76,936 KB
testcase_35 AC 608 ms
76,892 KB
testcase_36 AC 626 ms
76,884 KB
testcase_37 AC 635 ms
76,936 KB
testcase_38 AC 621 ms
76,940 KB
testcase_39 AC 255 ms
9,836 KB
testcase_40 AC 183 ms
9,880 KB
testcase_41 AC 2 ms
4,372 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <string>
#include <vector>
#include <atcoder/string>
#include <atcoder/convolution>
#include <atcoder/segtree>
using namespace std;
using namespace atcoder;
typedef long long ll;

template<typename T> void debug(vector<T> &v){
    for (ll i = 0; i < v.size(); i++){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

ll ctol(char c){
    ll ret;
    if (c == '?') ret = 0;
    else{
        ret = (ll)(c - 'a' + 1);
    }
    return ret;
}

vector<ll> wild_card_matching(string &S, string &T){
    ll len_S = S.size();
    ll len_T = T.size();
    vector<vector<ll>> pow_S(4, vector<ll>(len_S));
    vector<vector<ll>> pow_T(4, vector<ll>(len_T));
    for (ll i = 0; i < len_S; i++){
        pow_S[1][i] = ctol(S[i]);
        for (ll j = 1; j < 3; j++){
            pow_S[j + 1][i] = pow_S[j][i] * pow_S[1][i];
        }
    }
    for (ll i = 0; i < len_T; i++){
        pow_T[1][i] = ctol(T[i]);
        for (ll j = 1; j < 3; j++){
            pow_T[j + 1][i] = pow_T[j][i] * pow_T[1][i];
        }
    }
    for (ll i = 0; i < 4; i++){
        reverse(pow_T[i].begin(), pow_T[i].end());
    }
    vector<ll> vec_conv1 = convolution<998244353>(pow_S[3], pow_T[1]);
    vector<ll> vec_conv2 = convolution<998244353>(pow_S[2], pow_T[2]);
    vector<ll> vec_conv3 = convolution<998244353>(pow_S[1], pow_T[3]);
    vector<ll> vec_conv4 = convolution<469762049>(pow_S[3], pow_T[1]);
    vector<ll> vec_conv5 = convolution<469762049>(pow_S[2], pow_T[2]);
    vector<ll> vec_conv6 = convolution<469762049>(pow_S[1], pow_T[3]);

    vector<ll> ret(0);
    for (ll i = 0; i < len_S - len_T + 1; i++){
        if ((vec_conv1[len_T - 1 + i] - 2 *  vec_conv2[len_T - 1 + i] + vec_conv3[len_T - 1 + i] + 998244353 * 2) % 998244353 == 0){
            if ((vec_conv4[len_T - 1 + i] - 2 * vec_conv5[len_T - 1 + i] + vec_conv6[len_T - 1 + i] + 469762049 * 2) % 469762049 == 0) ret.push_back(i);
        }
    }
    return ret;
}

ll op(ll a, ll b){
    return min(a, b);
}

ll e(){
    return 1e9;
}

int main(){
    ll T;
    cin >> T;
    while(T--){
        ll N, M;
        cin >> N >> M;
        string S1;
        cin >> S1;
        string S2;
        cin >> S2;

        vector<ll> wcm = wild_card_matching(S1, S2);
        if (wcm.size() == 0){
            cout << -1 << endl;
            continue;
        }

        //debug(wcm);

        string S3 = "";
        for (ll i = 0; i < N; i++){
            if (S1[i] == '?') S3.push_back('a');
            else S3.push_back(S1[i]);
        }

        //S3 + S2 の LCP を求める
        vector<int> sa = suffix_array(S3 + S2);
        vector<int> lcp = lcp_array(S3 + S2, sa);
        vector<int> rev_sa(N + M);
        for (int i = 0; i < N + M; i++){
            rev_sa[sa[i]] = i;
        }
        segtree<ll, op, e> seg(N + M);
        for (ll i = 0; i < N + M; i++){
            seg.set(i, lcp[i]);
        }
        ll idx = 0;
        for (ll i = 1; i < wcm.size(); i++){
            ll left, right;
            ll diffs = wcm[i] - wcm[idx];
            if (diffs >= M){
                idx = i;
                continue;
            }
            left = min(rev_sa[wcm[idx]], rev_sa[N]);
            right = max(rev_sa[wcm[idx]], rev_sa[N]);
            ll lcp1 = seg.prod(left, right);
            if (lcp1 < diffs){
                if (S3[wcm[i] + lcp1] < S2[lcp1]){
                    idx = i;
                    continue;
                }
                else{
                    continue;
                }
            }
            left = min(rev_sa[N], rev_sa[N + diffs]);
            right = max(rev_sa[N], rev_sa[N + diffs]);
            ll lcp2 = seg.prod(left, right);
            if (lcp2 < M - diffs){
                if (S2[lcp2] < S2[diffs + lcp2]){
                    idx = i;
                    continue;
                }
                else{
                    continue;
                }
            }
            left = min(rev_sa[wcm[idx] + M], rev_sa[N + M - diffs]);
            right = max(rev_sa[wcm[idx] + M], rev_sa[N + M - diffs]);
            ll lcp3 = seg.prod(left, right);
            if (lcp3 < diffs){
                if (S2[M - diffs + lcp3] < S3[wcm[idx] + M + lcp3]){
                    idx = i;
                    continue;
                }
                else{
                    continue;
                }
            }
        }
        cout << S3.substr(0, wcm[idx]) << S2 << S3.substr(wcm[idx] + M, N - wcm[idx]) << endl;
    }
}
0