选择任意一个区间逆序是一个操作。

  • 从后往前扫描，后缀的 $?$ 可以全部替换成 $1$
  • 如果遇到 $0$，那么可能会需要一次操作（如果 $0$ 的前面都是 $0$ 或者 $?$，那么就不需要）
  • $0$ 之后紧接的 $?$ 可以替换成 $0$，这样结果不会更差
  • 如果遇到 $1$，那么就找到了这次操作的左端，同时 $1$ 左边紧接的 $1$ 可以算作一次操作，如果遇到 $?$ 那么可以替换成 $1$
  • 之后再遇到 $0$ 就是新的一轮操作
// Date: Sat Dec  9 16:41:32 2023

#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
const int dir[8][2] = {
    {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
};

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;

const ull Pr = 131;

#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])

#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nonempty(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())

#ifdef _DEBUG
#define debug1(x) cout << #x " = " << x << endl;
#define debug2(x, y) cout << #x " = " << x << " " #y " = " << y << endl;
#define debug3(x, y, z)                                                        \
  cout << #x " = " << x << " " #y " = " << y << " " #z " = " << z << endl;
#else
#define debug1
#define debug2
#define debug3
#endif

const int N = 300010;

int t, d0[N], d1[N];
string s;

int main(void) {
#ifdef _DEBUG
  freopen("1837c.in", "r", stdin);
#endif
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  cin >> t;

  while (t--) {
    cin >> s;
    int n = SZ(s), cnt = 0;

    For(i, 0, n) {
      if (s[i] == '?')
        cnt++;
    }
    if (!cnt) {
      cout << s << '\n';
      continue;
    }

    bool flag = false;
    Rof(i, 0, n) {
      if (s[i] == '?') {
        if (!flag)
          s[i] = '1';
        else {
          s[i] = '0';
        }
      } else if (s[i] == '1') {
        if (!flag)
          continue;
        else {
          flag = false;
        }
      } else {
        if (!flag)
          flag = true;
      }
    }

    cout << s << '\n';
  }

  return 0;
}