/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 772.0 KiB
#3 Accepted 2ms 564.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 2ms 332.0 KiB
#6 Accepted 2ms 540.0 KiB
#7 Accepted 2ms 744.0 KiB
#8 Accepted 1ms 816.0 KiB

Code

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

#define ll long long
#define bug(a) cout << #a << " : " << a << endl;

void solve(){
	int n;	cin >> n;
	string s;	cin >> s;

	string tar = "SeriousOJ";
	int idx = 0;
	int cnt = 0;
	for(int i = 0; i < n; i++){
		if ( idx == 9 ) break;
		if (s[i] == tar[idx]){
			idx++;
			cnt++;
		}
	}

	cout << (cnt == tar.size() ? "YES" : "NO") << '\n';
}	

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	int tc = 1, cs = 0;
	cin >> tc;

	while(tc--){
		//cout << "Case # " << ++cs << ": " ;
		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 04:50:47
Judged At
2024-12-09 04:50:47
Judged By
Score
100
Total Time
2ms
Peak Memory
816.0 KiB