/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 768.0 KiB
#3 Accepted 2ms 332.0 KiB
#4 Accepted 2ms 332.0 KiB
#5 Accepted 2ms 356.0 KiB
#6 Accepted 2ms 560.0 KiB
#7 Accepted 2ms 600.0 KiB
#8 Accepted 2ms 772.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

#define nl '\n'
#define ll long long
#define int long long
#define pii pair<int, int> 



void solve(){
    int n; cin >> n;
    string s, t = "SeriousOJ"; cin >> s;
    int m = t.size();
    int i=0, j = 0;
    while(i<n and j<m) {
        if(s[i] == t[j]) j++;
        ++i;
    }
    cout << (j==m?"YES\n" : "NO\n");
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1, tc = 0;
    cin >> t ;
    while(t--){
        // cout << "Case " << ++tc  << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1147 SeriousOJ Challenge
Contest
LU IUJPC : Sylhet Division 2024
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-09 04:50:44
Judged At
2024-12-09 04:50:44
Judged By
Score
100
Total Time
2ms
Peak Memory
772.0 KiB