結果

問題 No.2231 Surprising Flash!
ユーザー cureskolcureskol
提出日時 2023-02-26 18:46:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,951 bytes
コンパイル時間 4,466 ms
コンパイル使用メモリ 260,460 KB
実行使用メモリ 55,340 KB
最終ジャッジ日時 2024-09-14 08:19:37
合計ジャッジ時間 35,905 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 WA -
testcase_03 AC 197 ms
5,376 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 16 ms
5,376 KB
testcase_09 WA -
testcase_10 AC 15 ms
5,376 KB
testcase_11 AC 995 ms
47,524 KB
testcase_12 AC 1,027 ms
55,340 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 1,007 ms
47,552 KB
testcase_16 AC 1,013 ms
5,456 KB
testcase_17 AC 1,045 ms
7,688 KB
testcase_18 AC 988 ms
43,360 KB
testcase_19 AC 980 ms
43,428 KB
testcase_20 AC 968 ms
43,444 KB
testcase_21 AC 975 ms
43,452 KB
testcase_22 AC 973 ms
43,392 KB
testcase_23 AC 972 ms
43,404 KB
testcase_24 AC 981 ms
43,424 KB
testcase_25 AC 982 ms
43,464 KB
testcase_26 AC 974 ms
43,328 KB
testcase_27 AC 978 ms
43,324 KB
testcase_28 AC 974 ms
43,456 KB
testcase_29 AC 998 ms
47,420 KB
testcase_30 AC 1,005 ms
47,556 KB
testcase_31 AC 1,008 ms
47,428 KB
testcase_32 AC 1,003 ms
47,520 KB
testcase_33 AC 1,007 ms
47,388 KB
testcase_34 AC 1,000 ms
47,540 KB
testcase_35 AC 1,017 ms
47,420 KB
testcase_36 AC 999 ms
47,424 KB
testcase_37 AC 991 ms
47,548 KB
testcase_38 AC 996 ms
47,600 KB
testcase_39 AC 464 ms
7,364 KB
testcase_40 AC 314 ms
7,168 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region template
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
 
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vll=vector<ll>;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
 
#define overload2(a,b,c,...) c
#define overload3(a,b,c,d,...) d
#define overload4(a,b,c,d,e,...) e
#define overload5(a,b,c,d,e,f,...) f
 
#define TYPE1(T) template<typename T>
#define TYPE2(T,U) template<typename T,typename U>
#define TYPE(...) overload2(__VA_ARGS__,TYPE2,TYPE1)(__VA_ARGS__)
#define TYPES1(T) template<typename... T>
#define TYPES2(H,T) template<typename H,typename... T>
#define TYPES(...) overload2(__VA_ARGS__,TYPES2,TYPES1)(__VA_ARGS__)
 
#define REP4(i,s,n,d) for(int i=(s);i<(n);i+=(d))
#define REP3(i,s,n) REP4(i,s,n,1)
#define REP2(i,n) REP3(i,0,n)
#define REP1(n) REP2(tomato,n)
#define REP(...) overload4(__VA_ARGS__,REP4,REP3,REP2,REP1)(__VA_ARGS__)
 
#define RREP4(i,n,s,d) for(int i=(n)-1;i>=(s);i-=(d))
#define RREP3(i,n,s) RREP4(i,n,s,1)
#define RREP2(i,n) RREP3(i,n,0)
#define RREP1(n) RREP2(tomato,n)
#define RREP(...) overload4(__VA_ARGS__,RREP4,RREP3,RREP2,RREP1)(__VA_ARGS__)

#define FOR4(a,b,c,d,v) for(auto [a,b,c,d]:v)
#define FOR3(a,b,c,v) for(auto [a,b,c]:v)
#define FOR2(a,b,v) for(auto [a,b]:v)
#define FOR1(a,v) for(auto a:v)
#define FOR(...) overload5(__VA_ARGS__,FOR4,FOR3,FOR2,FOR1)(__VA_ARGS__)

#define AFOR4(a,b,c,d,v) for(auto&[a,b,c,d]:v)
#define AFOR3(a,b,c,v) for(auto&[a,b,c]:v)
#define AFOR2(a,b,v) for(auto&[a,b]:v)
#define AFOR1(a,v) for(auto&a:v)
#define AFOR(...) overload5(__VA_ARGS__,AFOR4,AFOR3,AFOR2,AFOR1)(__VA_ARGS__)

#define CFOR4(a,b,c,d,v) for(const auto&[a,b,c,d]:v)
#define CFOR3(a,b,c,v) for(const auto&[a,b,c]:v)
#define CFOR2(a,b,v) for(const auto&[a,b]:v)
#define CFOR1(a,v) for(const auto&a:v)
#define CFOR(...) overload5(__VA_ARGS__,CFOR4,CFOR3,CFOR2,CFOR1)(__VA_ARGS__)

#define PFOR(v) for(bool f=true; (f ? exchange(f,false) : next_permutation(v));)
 
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define UNIQUE(v) SORT(v),v.erase(unique(ALL(v)),v.end())
#define SZ(v) int(v.size())
 
TYPES(T) void input(T&... a){ (cin>>...>>a); }
#define DECLARE(T,...) T __VA_ARGS__;input(__VA_ARGS__);
#define INT(...) DECLARE(int,__VA_ARGS__)
#define STR(...) DECLARE(string,__VA_ARGS__)
#define LL(...) DECLARE(long long,__VA_ARGS__)
#define CHR(...) DECLARE(char,__VA_ARGS__)
#define DBL(...) DECLARE(double,__VA_ARGS__)
#define VI(n,v) vi v(n);cin>>v;
#define VLL(n,v) vll v(n);cin>>v;
 
TYPE(T) istream&operator>>(istream&is,vector<T>&v){
  for(auto&a:v)cin>>a;
  return is;
}
TYPE(T) ostream&operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  REP(i,v.size()){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}
TYPE(T,S) istream&operator>>(istream&is,pair<T,S>&p){
  cin>>p.first>>p.second;
  return is;
}

#ifdef __DEBUG
 #include <debug>
#else
 #define debug(...) void(0)
#endif

void print(){ cout << '\n'; }
TYPES(T,Ts) void print(const T& a,const Ts&... b){
  cout<<a;
  (cout<<...<<(cout<< ' ',b));
  cout << '\n';
}
 
TYPE(T) using pq=priority_queue<T>;
TYPE(T) using pqg=priority_queue<T,vector<T>,greater<T>>;
TYPE(T) T pick(queue<T>& que){assert(que.size()); T a=que.front();que.pop();return a;}
TYPE(T) T pick(pq<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(pqg<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(stack<T>& sta){assert(sta.size()); T a=sta.top();sta.pop();return a;}
TYPE(T) void clear(T&v){ v=decltype(v)(); }
 
string YES(bool f=true){return (f?"YES":"NO");}
string Yes(bool f=true){return (f?"Yes":"No");}
string yes(bool f=true){return (f?"yes":"no");}
 
constexpr int INF=1e9+7;
constexpr ll LINF=ll(1e18)+7;
constexpr ld EPS=1e-10;
 
vi iota(int n){vi a(n);iota(ALL(a),0);return a;}
TYPE(T) vector<pair<T,int>> query_sort(const vector<T>&v){
  vector<pair<T,int>> res(v.size());
  REP(i,v.size())res[i]={v[i],i};
  SORT(res);
  return res;
}
TYPE(T) T rev(T a){ REVERSE(a);return a; }
TYPE(T) void fin(T a){cout<<a<<endl;exit(0);}
TYPE(T) bool chmax(T &a,T b){return (a<b&&(a=b,true));}
TYPE(T) bool chmin(T &a,T b){return (a>b&&(a=b,true));}
TYPES(T,Ns) auto make_vector(T x,int n,Ns ...ns){
  if constexpr(sizeof...(ns)==0)return vector<T>(n,x);
  else return vector(n,make_vector<T>(x,ns...));
}
bool in(const ll S,const int a){return (S>>a)&1;}
int popcount(const ll S){return __builtin_popcountll(S);}
int digit(char c){ return (c>='0' and c<='9' ? c-'0' : -1);}
ll sqrtll(ll a){ 
  for(ll b=sqrt(a);b*b<=a;b++)if(b*b==a)return b;
  for(ll b=sqrt(a);b>=0 and b*b>=a;b--)if(b*b==a)return b;
  return -1;
}
#pragma endregion template

#include <atcoder/convolution>
using namespace atcoder;

vector<int> wild_pattern_matching(const string&T,const string&P){
  int n=T.size(),m=P.size();
  vector<ll> f(n),g(m);
  REP(i,n)f[i] = T[i]=='?' ? 0 : T[i]-'a'+1;
  REP(j,m)g[j] = P[j]=='?' ? 0 : P[j]-'a'+1;
  REVERSE(g);
  vector<ll> sum(n-(m-1),0);
  {
    auto F=f;
    AFOR(a,F)a=a*a*a;
    auto fg=convolution_ll(F,g);
    REP(i,n-(m-1))sum[i] += fg[i+m-1];
  }
  {
    auto F=f;
    AFOR(a,F)a=a*a;
    auto G=g;
    AFOR(a,G)a=a*a;
    auto fg=convolution_ll(F,G);
    REP(i,n-(m-1))sum[i] -= 2*fg[i+m-1];
  }
  {
    auto G=g;
    AFOR(a,G)a=a*a*a;
    auto fg=convolution_ll(f,G);
    REP(i,n-(m-1))sum[i] += fg[i+m-1];
  }
  debug(sum);

  vector<int> res;
  REP(i,n-(m-1))if(!sum[i])res.push_back(i);
  debug(res);
  return res;
}

string solve(){
  INT(n,m);
  STR(T,P);
  auto v=wild_pattern_matching(T,P);
  if(!v.size())return "-1";
  REP(i,m)T[v.back()+i]=P[i];
  AFOR(c,T)if(c=='?')c='a';
  return T;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int testsize;cin>>testsize;
  while(testsize--)cout<<solve()<<'\n';
}
0