Submission #1735799


Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
vector<pair<char,int>> vec;
string s;

int main(){
	cin >> s;
	
	int c=0;
	vec.push_back(make_pair('0',-1));
	REP(i,0,s.size()){
		if(vec[c].first==s[i]) vec[c].second++;
		else vec.push_back(make_pair(s[i],1)),c++;
	}
	
	int ma=0;
	REP(i,1,vec.size()-2){
		if(vec[i].first=='J' and vec[i+1].first=='O' and vec[i+2].first=='I'){
			if(vec[i+1].second<=min(vec[i].second,vec[i+2].second)){
				ma=max(ma,min(vec[i+1].second, min(vec[i].second, vec[i+2].second)));
			}
		}
	}
	
	cout << ma << endl;
	return 0;
}

Submission Info

Submission Time
Task A - JJOOII (JJOOII)
User ecasdqina
Language C++14 (GCC 5.4.1)
Score 100
Code Size 844 Byte
Status AC
Exec Time 48 ms
Memory 11256 KB

Judge Result

Set Name set01 set02 set03 set04 set05 set06 set07 set08 set09 set10
Score / Max Score 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10 10 / 10
Status
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
AC × 5
Set Name Test Cases
set01 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt
set02 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt
set03 03-01.txt, 03-02.txt, 03-03.txt, 03-04.txt, 03-05.txt
set04 04-01.txt, 04-02.txt, 04-03.txt, 04-04.txt, 04-05.txt
set05 05-01.txt, 05-02.txt, 05-03.txt, 05-04.txt, 05-05.txt
set06 06-01.txt, 06-02.txt, 06-03.txt, 06-04.txt, 06-05.txt
set07 07-01.txt, 07-02.txt, 07-03.txt, 07-04.txt, 07-05.txt
set08 08-01.txt, 08-02.txt, 08-03.txt, 08-04.txt, 08-05.txt
set09 09-01.txt, 09-02.txt, 09-03.txt, 09-04.txt, 09-05.txt
set10 10-01.txt, 10-02.txt, 10-03.txt, 10-04.txt, 10-05.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
02-01.txt AC 1 ms 256 KB
02-02.txt AC 1 ms 256 KB
02-03.txt AC 1 ms 256 KB
02-04.txt AC 1 ms 256 KB
02-05.txt AC 1 ms 256 KB
03-01.txt AC 2 ms 256 KB
03-02.txt AC 1 ms 256 KB
03-03.txt AC 1 ms 256 KB
03-04.txt AC 1 ms 256 KB
03-05.txt AC 1 ms 256 KB
04-01.txt AC 2 ms 256 KB
04-02.txt AC 2 ms 256 KB
04-03.txt AC 1 ms 256 KB
04-04.txt AC 2 ms 256 KB
04-05.txt AC 1 ms 256 KB
05-01.txt AC 34 ms 1412 KB
05-02.txt AC 36 ms 1412 KB
05-03.txt AC 22 ms 6776 KB
05-04.txt AC 6 ms 1020 KB
05-05.txt AC 1 ms 256 KB
06-01.txt AC 34 ms 1412 KB
06-02.txt AC 34 ms 1412 KB
06-03.txt AC 21 ms 1796 KB
06-04.txt AC 48 ms 11128 KB
06-05.txt AC 1 ms 256 KB
07-01.txt AC 34 ms 1412 KB
07-02.txt AC 34 ms 1412 KB
07-03.txt AC 23 ms 1412 KB
07-04.txt AC 36 ms 2180 KB
07-05.txt AC 47 ms 10232 KB
08-01.txt AC 34 ms 1412 KB
08-02.txt AC 34 ms 1412 KB
08-03.txt AC 27 ms 1412 KB
08-04.txt AC 34 ms 1412 KB
08-05.txt AC 47 ms 11256 KB
09-01.txt AC 34 ms 1412 KB
09-02.txt AC 34 ms 1412 KB
09-03.txt AC 31 ms 1412 KB
09-04.txt AC 34 ms 1412 KB
09-05.txt AC 41 ms 6396 KB
10-01.txt AC 34 ms 1412 KB
10-02.txt AC 34 ms 1412 KB
10-03.txt AC 34 ms 1412 KB
10-04.txt AC 34 ms 1412 KB
10-05.txt AC 40 ms 6140 KB