Submission #2866819

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<cmath>
#include<bitset>
#include<iostream>
#include<algorithm>
#include<string>
#include<utility>
#include<tuple>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<stack>
#include<numeric>

#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define REP(i,n) for(int i = 0;i < n;i++)
#define MEM(a,b) memset(a,b,sizeof(a))

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

int main() {
	IOS;
	string s, t;
	bool exist;
	cin >> s >> t;
	if (s.size() < t.size()) {
		cout << "UNRESTORABLE" << endl;
		return 0;
	}
	reverse(s.begin(), s.end());
	reverse(t.begin(), t.end());
	int T = s.size() - t.size() + 1;
	bool tmp;
	REP(i, T) {
		tmp = true;
		REP(j, t.size())if (!(s[j + i] == t[j] || s[j + i] == '?'))tmp = false;
		if (tmp) {
			s.replace(i,t.size(),t);
			break;
		}
		if (i == T - 1 && !tmp) {
			cout << "UNRESTORABLE" << endl;
			return 0;
		}
	}
	reverse(s.begin(), s.end());
	REP(i, s.size()) {
		if (s[i] == '?')s[i] = 'a';
	}
	cout << s << endl;
}

Submission Info

Judge Result