Submission #1338791


Source Code Expand

#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;

std::string S;
bool nextI = true;
int ans;

int main()
{
	in >> S;

	rep(i, S.length())
	{
		if (nextI)
		{
			if (S[i] == 'I')
			{
				++ans;
				nextI = false;
			}
		}
		else
		{
			if (S[i] == 'O')
			{
				++ans;
				nextI = true;
			}
		}
	}
	if (nextI) { --ans; }

	out << ans << std::endl;
	return 0;
}

Submission Info

Submission Time
Task A - IOI列車で行こう2
User Bwambocos
Language C++14 (GCC 5.4.1)
Score 0
Code Size 528 Byte
Status WA
Exec Time 3 ms
Memory 384 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 11
WA × 1
AC × 20
WA × 1
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
Subtask1 sample_1.txt, sample_2.txt, sample_3.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub1_7.txt, sub1_8.txt, sub1_9.txt
Subtask2 sample_1.txt, sample_2.txt, sample_3.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub1_7.txt, sub1_8.txt, sub1_9.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub2_7.txt, sub2_8.txt, sub2_9.txt
Case Name Status Exec Time Memory
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sub1_1.txt AC 1 ms 256 KB
sub1_2.txt AC 1 ms 256 KB
sub1_3.txt AC 1 ms 256 KB
sub1_4.txt WA 1 ms 256 KB
sub1_5.txt AC 1 ms 256 KB
sub1_6.txt AC 1 ms 256 KB
sub1_7.txt AC 1 ms 256 KB
sub1_8.txt AC 1 ms 256 KB
sub1_9.txt AC 1 ms 256 KB
sub2_1.txt AC 1 ms 256 KB
sub2_2.txt AC 1 ms 256 KB
sub2_3.txt AC 1 ms 256 KB
sub2_4.txt AC 1 ms 256 KB
sub2_5.txt AC 1 ms 256 KB
sub2_6.txt AC 2 ms 256 KB
sub2_7.txt AC 2 ms 256 KB
sub2_8.txt AC 2 ms 256 KB
sub2_9.txt AC 3 ms 384 KB