Submission #2225821

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;

string R, T;

int main() {
	cin >> R >> T;

	//Tの方が長かったら無条件で詰み
	int lr = (int)R.length();
	int lt = (int)T.length();
	if (lr<lt) cout << "UNRESTORABLE";
	else {
		//Tが適合するか下から検索
		bool match = false;
		for (int i = lr - lt;i >= 0;i--) {
			bool ptmatch = true;
			rep(j, lt)if (T[j] != R[i + j] && R[i + j] != '?')ptmatch = false;
			if (ptmatch) {
				match = true;
				rep(j, lt)R[i + j] = T[j];
				rep(j, lr) {
					if (R[j] == '?') R[j] = 'a';
					cout << R[j];
					}
					break;
				}
		}
		if (!match)cout << "UNRESTORABLE";
	}
}

Submission Info

Judge Result