結果

問題 No.2231 Surprising Flash!
ユーザー n_vipn_vip
提出日時 2023-02-24 23:34:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,759 bytes
コンパイル時間 3,959 ms
コンパイル使用メモリ 204,596 KB
実行使用メモリ 20,384 KB
最終ジャッジ日時 2023-10-11 09:04:49
合計ジャッジ時間 68,079 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,352 KB
testcase_01 AC 5 ms
4,352 KB
testcase_02 WA -
testcase_03 AC 543 ms
4,348 KB
testcase_04 WA -
testcase_05 AC 107 ms
4,348 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 31 ms
4,352 KB
testcase_09 WA -
testcase_10 AC 27 ms
4,356 KB
testcase_11 AC 2,099 ms
18,248 KB
testcase_12 AC 2,133 ms
20,384 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 2,093 ms
18,304 KB
testcase_16 AC 2,159 ms
4,348 KB
testcase_17 AC 2,322 ms
4,892 KB
testcase_18 AC 2,081 ms
17,096 KB
testcase_19 AC 2,043 ms
17,092 KB
testcase_20 AC 2,087 ms
17,100 KB
testcase_21 AC 2,079 ms
17,156 KB
testcase_22 AC 2,086 ms
17,164 KB
testcase_23 AC 2,080 ms
17,164 KB
testcase_24 AC 2,085 ms
17,088 KB
testcase_25 AC 2,081 ms
17,176 KB
testcase_26 AC 2,073 ms
17,108 KB
testcase_27 AC 2,080 ms
17,184 KB
testcase_28 AC 2,033 ms
17,096 KB
testcase_29 AC 2,094 ms
18,300 KB
testcase_30 AC 2,122 ms
18,232 KB
testcase_31 AC 2,094 ms
18,224 KB
testcase_32 AC 2,097 ms
18,224 KB
testcase_33 AC 2,061 ms
18,244 KB
testcase_34 AC 2,052 ms
18,220 KB
testcase_35 AC 2,086 ms
18,368 KB
testcase_36 AC 2,096 ms
18,432 KB
testcase_37 AC 2,107 ms
18,232 KB
testcase_38 AC 2,098 ms
18,228 KB
testcase_39 AC 981 ms
4,992 KB
testcase_40 AC 665 ms
5,064 KB
testcase_41 WA -
testcase_42 AC 2 ms
4,348 KB
testcase_43 AC 1 ms
4,352 KB
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int X = 0;X < (int)(Y);++X)
#define reps(X,S,Y) for (int X = (int)(S);X < (int)(Y);++X)
#define rrep(X,Y) for (int X = (int)(Y)-1;X >=0;--X)
#define rreps(X,S,Y) for (int X = (int)(Y)-1;X >= (int)(S);--X)
#define repe(X,Y) for (X = 0;X < (Y);++X)
#define peat(X,Y) for (;X < (Y);++X)
#define all(X) X.begin(),X.end()
#define rall(X) X.rbegin(),X.rend()
#define eb emplace_back
#define UNIQUE(X) X.erase(unique(all(X)),X.end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_deduction_guides
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...));	return re;}
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
template<class T> bool erase(multiset<T> &st, const T &v){if(cauto it=st.find(v); it==st.end()) return false; else{ st.erase(it); return true;}}
#endif
#ifdef __cpp_init_captures
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){	addadd(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){	subsub(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
#endif
#ifdef NUIP
#define TT cauto TTT=read();rep(kase,TTT)if(cerr<<"Case #"<<kase<<endl)
#else
#define TT cauto TTT=read();rep(kase,TTT)
#endif
struct sorted_impl{template<class T>friend vector<T>operator-(vector<T>a,sorted_impl){sort(all(a));return a;}friend string operator-(string a,sorted_impl){sort(all(a));return a;}}sorted;struct reversed_impl{template<class T>friend vector<T>operator-(vector<T> a,reversed_impl){reverse(all(a));return a;}friend string operator-(string a,reversed_impl){reverse(all(a));return a;}}reversed;struct distinct_impl{template<class T>friend vector<T>operator-(vector<T> a,distinct_impl){sort(all(a));UNIQUE(a);return a;}}distinct;template<class S>struct sortedWith{const S f;sortedWith(const S &f):f(f){}template<class T>friend vector<T>operator-(vector<T> a,const sortedWith&b){sort(all(a),[&](cauto&i,cauto&j){return b.f(i)<b.f(j);});return a;}};
template<class T>int operator/(const T&v,const vector<T>&vs){return lower_bound(all(vs),v)-vs.begin();}
vector<int> Inds(const int n){vector<int> inds(n);iota(all(inds),0);return inds;}
const ll MOD=1e9+7; //998244353;

#include <atcoder/all>
using namespace atcoder;
#ifdef NUIP
#include "atcoder/atcoder/output"
#endif

using mint=modint998244353;

vector<bool> conv(const vector<bool> &vs, const vector<bool> &us){
	vector<mint> xs(all(vs));
	vector<mint> ys(rall(us));
	const int t=count(all(us),true);
	vector<bool> re(vs.size()+1-us.size());
	cauto zs=convolution(xs,ys);
	rep(i,re.size()) re[i]=zs[us.size()-1+i].val()==t;
	return re;
}
vector<bool> conv2(const vector<bool> &vs, const vector<bool> &us){
	vector<mint> xs(all(vs));
	vector<mint> ys(rall(us));
	const int t=count(all(us),true);
	vector<bool> re(vs.size()+1-us.size());
	cauto zs=convolution(xs,ys);
	rep(i,re.size()) re[i]=zs[us.size()-1+i].val()==0;
	return re;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cout<<fixed<<setprecision(0);
	TT{
		cauto n=read(0);
		cauto m=read(0);
		cauto s=read<string>();
		cauto t=read<string>();
		vector<bool> ok(n-m+1,true);
		reps(c,'a','z'+1){
			vector<bool> vs(n),us(m);
			rep(i,n) vs[i]=(s[i]==c || s[i]=='?');
			rep(i,m) us[i]=(t[i]==c || t[i]=='?');
			cauto zs=conv(vs,us);
			rep(i,ok.size())if(!zs[i]) ok[i]=false;
		}
		bool otoku=false;
		{
			vector<bool> vs(n),us(m);
			rep(i,n) vs[i]=s[i]=='?';
			rep(i,m) us[i]=t[i]!='a';
			cauto zs=conv2(vs,us);
			rep(i,ok.size())if(ok[i] && zs[i]) otoku=true;
		}
		auto re=s;
		for(auto &c:re)if(c=='?') c='a';
		int last=n;
		rrep(i,ok.size())if(ok[i]){ last=i; break;}
		if(last==n){
			cout<<-1 NL;
		}else{
			if(!otoku) rep(i,m) re[last+i]=t[i];
			cout<<re NL;
		}
	}
	return 0;
}
0