提出 #52401939

---

ソースコード 拡げる

// WEBLINK

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>

using namespace std;

using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vii = vector<ii>;

#define pb push_back
#define fst first
#define snd second
#define all(x) (x).begin,(x).end()
#define rall(x) (x).rbegin,(x).rend()

// ------------- SORT -------------------

template<class T> void SORT(vector<T> & a) { sort(a.begin(), a.end()); }
template<class T> void RSORT(vector<T> & a) { sort(a.rbegin(), a.rend()); }

// ------------- INPUT -------------------

template<class T> void inp(T & x) { cin >> x; }
template<class T> void inp(vector<T> & t) { for (auto && x : t) cin >> x; }

// ---------- MOD --------------------
const int mod = 1000000007;

void add(int & x, int y) {
	x += y;
	if (x < 0) x += mod;
	if (x >= mod) x -= mod;
}
int add2(int x, int y) {
	x += y;
	if (x < 0) x += mod;
	if (x >= mod) x -= mod;
	return x;
}

int mul(int x, int y) {ll r = x; r *= y; return r % mod;}

int power(int x, int p) {
	if (x < 0 or p < 0) return 0;
	int r = 1;
	while (p > 0)
	{
		if (p & 1) r = mul(r, x);
		x = mul(x, x); p /= 2;
	} return r;
}
int inv(int a) { return power(a, mod - 2); }

// ------------- MINMAX -------------------

template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}

// ----------- MATHS ------------

ll sq(int x) { ll r = x; return r * r; }

// ---------- DEBUG --------------------

//#define ON_PC
#ifdef ON_PC
#include </Users/karanaggarwal/code/debug.h>
#else
#define deb(x...)
#endif

///////////////////////////////////


bool f()
{
    string S, T;
    cin >> S >> T;
    int i = 0, j = 0;
    int n = S.size();
    int m = T.size();
    if (T[m-1] == 'X') m--;
    
    for (;i<n and j < m; j++)
    {
        while (i < n and S[i] + ('A'-'a') != T[j])
            i++;
    }
    return (i < n);
}


void solve()
{
    if (f()) cout << "Yes" << endl;
    else cout << "No" << endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t = 1;
	// cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}

提出情報

ジャッジ結果