/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Wrong Answer 2ms 328.0 KiB
#3 Wrong Answer 2ms 540.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;

void solve() {
    ll n; string s; cin >> n >> s;
    string check = "seriousoj";
    ll cnt = 0;
    transform(s.begin(), s.end(), s.begin(), ::tolower);
    for(ll i=0, j=0; i<s.size() && j<check.size(); ) {
        if(s[i] == check[j]) {
            i++; j++; cnt++;
        }
        else i++;
    }
    cout << (cnt == 9 ? "YES\n" : "NO\n");
}

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

    ll t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1147 SeriousOJ Challenge
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-10 14:41:37
Judged At
2024-12-10 14:41:37
Judged By
Score
10
Total Time
2ms
Peak Memory
540.0 KiB