#843658 (C++17) No.2231 Surprising Flash!

提出ソース

結果

問題	No.2231 Surprising Flash!
ユーザー	PCTprobability
提出日時	2023-02-24 22:44:51
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,440 bytes
コンパイル時間	5,177 ms
コンパイル使用メモリ	282,040 KB
実行使用メモリ	28,496 KB
最終ジャッジ日時	2024-09-13 07:57:56
合計ジャッジ時間	49,717 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	4 ms 6,812 KB
testcase_02	WA	-
testcase_03	AC	285 ms 6,940 KB
testcase_04	WA	-
testcase_05	AC	3 ms 6,944 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	30 ms 6,940 KB
testcase_09	WA	-
testcase_10	AC	3 ms 6,940 KB
testcase_11	AC	20 ms 10,584 KB
testcase_12	AC	26 ms 12,740 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	20 ms 10,584 KB
testcase_16	AC	1,947 ms 6,940 KB
testcase_17	AC	2,081 ms 6,940 KB
testcase_18	AC	1,995 ms 28,180 KB
testcase_19	AC	1,995 ms 28,156 KB
testcase_20	AC	1,994 ms 28,092 KB
testcase_21	AC	1,993 ms 28,212 KB
testcase_22	AC	1,994 ms 28,240 KB
testcase_23	AC	2,000 ms 28,236 KB
testcase_24	AC	2,028 ms 28,120 KB
testcase_25	AC	2,012 ms 28,052 KB
testcase_26	AC	1,997 ms 28,232 KB
testcase_27	AC	1,998 ms 28,100 KB
testcase_28	AC	2,000 ms 28,088 KB
testcase_29	AC	2,024 ms 28,480 KB
testcase_30	AC	2,029 ms 28,364 KB
testcase_31	AC	2,023 ms 28,440 KB
testcase_32	AC	2,024 ms 28,388 KB
testcase_33	AC	2,030 ms 28,484 KB
testcase_34	AC	21 ms 10,716 KB
testcase_35	AC	21 ms 10,584 KB
testcase_36	AC	21 ms 10,712 KB
testcase_37	AC	21 ms 10,580 KB
testcase_38	AC	21 ms 10,580 KB
testcase_39	AC	925 ms 6,944 KB
testcase_40	AC	614 ms 6,944 KB
testcase_41	WA	-
testcase_42	AC	2 ms 6,940 KB
testcase_43	AC	2 ms 6,940 KB
testcase_44	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
using mint = modint998244353;
ll op(ll a,ll b){
  return a+b;
}
ll e(){
  return 0ll;
}
template< unsigned mod >
struct RollingHash {
  vector< unsigned > hashed, power;

  inline unsigned mul(unsigned a, unsigned b) const {
    unsigned long long x = (unsigned long long) a * b;
    unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
    asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
    return m;
  }

  RollingHash(const string &s, unsigned base = 10007) {
    int sz = (int) s.size();
    hashed.assign(sz + 1, 0);
    power.assign(sz + 1, 0);
    power[0] = 1;
    for(int i = 0; i < sz; i++) {
      power[i + 1] = mul(power[i], base);
      hashed[i + 1] = mul(hashed[i], base) + s[i];
      if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;
    }
  }

  unsigned get(int l, int r) const {
    unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
    if(ret >= mod) ret -= mod;
    return ret;
  }

  unsigned connect(unsigned h1, int h2, int h2len) const {
    unsigned ret = mul(h1, power[h2len]) + h2;
    if(ret >= mod) ret -= mod;
    return ret;
  }

  int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {
    int len = min(r1 - l1, r2 - l2);
    int low = -1, high = len + 1;
    while(high - low > 1) {
      int mid = (low + high) / 2;
      if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;
      else high = mid;
    }
    return (low);
  }
};

using RH = RollingHash< 1000000007 >;
void solve(){
  ll n,m;
  cin>>n>>m;
  string s,t;
  cin>>s>>t;
  {
    auto s2=s;
    for(auto &e:s2) if(e=='?') e='a';
    RH rh(s2),rh2(t);
    for(int i=0;i<n-m+1;i++){
      if(rh.get(i,i+m)==rh2.get(0,m)){
        cout<<s2<<endl;
        return;
      }
    }
  }
  vector<ll> ok(n-m+1,1);
  segtree<ll,op,e> seg(n);
  for(int i=0;i<n;i++){
    if(s[i]=='?') seg.set(i,1);
  }
  for(int i=0;i<26;i++){
    vector<mint> b(m);
    for(int j=0;j<m;j++){
      if((t[j]-'a')==i) b[j]=1;
    }
    vector<mint> a(n);
    for(int j=0;j<n;j++){
      if(s[j]=='?') continue;
      if((s[j]-'a')!=i) a[j]=1;
    }
    rever(b);
    auto c=convolution(a,b);
    for(int j=0;j<c.size();j++){
      if(c[j].val()==0) continue;
      int k=j-(m-1);
      if(0<=k&&k<n-m+1){
        ok[k]=0;
      }
    }
  }
  for(int i=ok.size()-1;i>=0;i--){
    if(ok[i]&&seg.prod(i,i+m)==0){
      for(int j=0;j<m;j++){
        s[i+j]=t[j];
      }
      for(auto &e:s) if(e=='?') e='a';
      cout<<s<<endl;
      return;
    }
  }
  for(int i=ok.size()-1;i>=0;i--){
    if(ok[i]){
      for(int j=0;j<m;j++){
        s[i+j]=t[j];
      }
      for(auto &e:s) if(e=='?') e='a';
      cout<<s<<endl;
      return;
    }
  }
  cout<<-1<<endl;
}
int main() {
  cincout();
  ll t;
  cin>>t;
  while(t--){
    solve();
  }
}

yukicoder

結果

テストケース

ソースコード