Submission #2866308

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <set>
#include <unordered_map>
#include <queue>
#include <iomanip>
#include <map>

#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define P pair<int, int>
#define ll long long

using namespace std;
int mod = 1000000007;

string s;
string t;

int main() {
  cin >> s >> t;

  int pos = -1;
  for (int i=0; i<s.size()-t.size()+1; i++) {
    bool matched = true;
    for (int j=0; j<t.size(); j++) {
      if (s.at(i+j) != '?' && s.at(i+j) != t.at(j)) {
        matched = false;
        break;
      }
    }
    if (matched) {
      pos = i;
    }
  }

  if (pos == -1) {
    cout << "UNRESTORABLE" << endl;
    return 0;
  }

  string ans;
  for (int i=0; i<s.size(); i++) {
    if (s.at(i) != '?') {
      ans.push_back(s.at(i));
    } else if (i < pos || i >= pos + t.size()) {
      ans.push_back('a');
    } else {
      ans.push_back(t.at(i-pos));
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result