/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 560.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 2ms 584.0 KiB
#4 Accepted 1ms 588.0 KiB
#5 Accepted 2ms 560.0 KiB
#6 Accepted 2ms 540.0 KiB
#7 Accepted 2ms 544.0 KiB
#8 Accepted 3ms 752.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
 
 
 
#define ll long long
#define ull unsigned long long
#define ld long double
#define f(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define endl '\n'
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define ANS cout<<ans<<endl
#define fastio ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);
ll gcd(ll a, ll b) {return __gcd(a,b);}
ll lcm(ll a, ll b) {return a* (b/gcd(a,b));}
const int m=1e9+7;
long long binpow(long long a, long long b) {
	long long res = 1;
	while (b > 0) {
		if (b & 1)
		res = (res * a)%m;
		a = (a * a)%m;
		b >>= 1;
	}
	return res;
}
bool subseq(string a,string b)
{
	ll x=a.size();
	ll y=b.size();
	if(x>y)return 0;
	ll i = 0, j = 0;
    while (i < x && j < y ){
        if (a[i] == b[j])i++;
        j++;
    }
    return i==x;
}

int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    ll t;cin>>t;while(t--)
    {
	    ll n;cin>>n;
	    string s;cin>>s;
	    string a;
	    a="SeriousOJ";
	    if(subseq(a,s))YES;
	    else NO;

    }
	    return 0;
}

Information

Submit By
Type
Submission
Problem
P1147 SeriousOJ Challenge
Contest
LU IUJPC : Sylhet Division 2024 Replay Contest
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-10 09:26:22
Judged At
2024-12-10 09:26:22
Judged By
Score
100
Total Time
3ms
Peak Memory
752.0 KiB