/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 544.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 2ms 516.0 KiB
#5 Accepted 2ms 516.0 KiB
#6 Accepted 2ms 456.0 KiB
#7 Accepted 3ms 740.0 KiB
#8 Accepted 3ms 580.0 KiB

Code

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

typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pi;
typedef pair<char, ll> pci;
typedef vector<pi> vii;
typedef map<ll, ll> mi;
typedef set<ll> seti;

#define sz size()
#define ins insert
#define mp make_pair
#define pb push_back
#define nl << "\n";
#define all(x) x.begin(), x.end()
#define db(x) cout << #x << " = " << x nl
#define input(x) for (auto &a : x) cin >> a;
#define view(x) cout << #x << ": "; for (auto a : x) {cout << a << " ";} cout nl
#define viewp(x) cout << #x << ": "; for (auto a : x) {cout << a.first << " " << a.second nl}

void solve() {
    ll n;
    cin >> n;
    string s;
    cin >> s;
    string s2 = "SeriousOJ";
    ll it = 0;
    for (auto x : s) {
        if (x == s2[it]) {
            it++;
        }
        if (it == 9) break;
    }
    if (it == 9) {
        cout << "YES" nl
    } else {
        cout << "NO" nl
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll t = 1;
    cin >> t;
    while (t--) {
        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:56:13
Judged At
2024-12-09 04:56:13
Judged By
Score
100
Total Time
3ms
Peak Memory
740.0 KiB