/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 8ms 328.0 KiB
#3 Accepted 8ms 328.0 KiB
#4 Accepted 6ms 540.0 KiB
#5 Accepted 6ms 332.0 KiB
#6 Accepted 6ms 332.0 KiB
#7 Accepted 6ms 588.0 KiB
#8 Accepted 6ms 756.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define yes cout<<"YES"<<"\n";
#define no cout<<"NO"<<"\n";
#define forn  for(int i=0;i<n;i++);
#define acin  for(int i=0;i<n;i++)cin>>arr[i];
#define v vector<int>arr(n);
//#define int long long 
void solve()
{
  int n;
  cin>>n;
 string s;
 cin>>s;
 string s1="SeriousOJ";
 int cnt=0;
 for (int i = 0, j = 0; i < n; i++)
 {
     if (s[i] == s1[j])
     {
         j++;
         cnt++;
     }
 }
 if (s1.size() == cnt)cout<<"YES"<<endl;
     
 else cout<<"NO"<<endl;
}
int main()
{
    int t;
    cin>>t;
    while (t--)
    { 
         solve();
    }
    
 

}

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 05:06:07
Judged At
2024-12-09 05:06:40
Judged By
Score
100
Total Time
8ms
Peak Memory
756.0 KiB