提出 #75077757

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using PL = pair<ll,ll>;
template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define pb push_back
#define eb emplace_back
#define pob pop_back
template <class T>
bool chmax(T& a, const T& b) {return (a < b ? (a = b, true) : false);}
template <class T>
bool chmin(T& a, const T& b) {return (a > b ? (a = b, true) : false);}
const int INF = 2e9;
const ll LINF = 2e18;
const vector<int> di = {-1,1,0,0}, dj = {0,0,-1,1};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int q;
  cin >> q;
  rep(qi,q) {
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();
    string ns;
    rep(i,n) {
      ns.pb(s[i]);
      if(s[i] == ')') {
        if(sz(ns)-4 < 0) continue;
        if(ns.substr(sz(ns)-4) == "(xx)") {
          rep(j,4) ns.pob();
          rep(j,2) ns.pb('x');
        }
      }
    }

    string nt;
    rep(i,m) {
      nt.pb(t[i]);
      if(t[i] == ')') {
        if(sz(nt)-4 < 0) continue;
        if(nt.substr(sz(nt)-4) == "(xx)") {
          rep(j,4) nt.pob();
          rep(j,2) nt.pb('x');
        }
      }
    }

    cout << (ns == nt ? "Yes\n" : "No\n");
  }
  return 0;
}

提出情報

ジャッジ結果