Submission #1718733

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll solve(int N) {
    return -1LL;
}

#define xxx "UNRESTORABLE"

string solve(string& s, string& t) {
    int ls = s.size(), lt = t.size();
    if (ls < lt) return xxx;

    set<string> cand;
    for (int i=0; i<ls-lt+1; ++i) {
        bool matched = true;
        rep(j, lt) {
            if (s[i+j] == '?') continue;
            if (s[i+j] == t[j]) continue;
            matched = false; break;
        }
        if (matched) {
            vector<char> ans(ls);
            rep(i, ls) ans[i] = (s[i] == '?')? 'a' : s[i];
            rep(j, lt) ans[i+j] = t[j];
            cand.insert(string(ALL(ans)));
        }
    }
    if (cand.size() == 0) return xxx;
    return *cand.begin();
}
int main() {
    string s, t;
    cin >> s;
    cin >> t;
    cout << solve(s, t) << endl;
    return 0;
}

Submission Info

Judge Result