Submission #702777

Source Code Expand

#include <string>
#include <cstdio>
#include <iostream>

int maxNumberOfCoach(const std::string& sin)
{
	const int ns = sin.size();
	bool onI(false);
	int n(0);
	for(int i = 0; i < ns;++i)
	{
		const bool currentI = sin[i] == 'I';
		if( (!onI && currentI) || (onI && !currentI) )
		{
			onI = !onI;
			++n;
		}
	}
	return n;
}

int main() {
    std::string s;
    std::cin >> s;
    std::string sin(s);
	const int n = maxNumberOfCoach(sin);
	std::cout << n << std::endl;
    return 0;
}

Submission Info

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

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 8
WA × 4
AC × 15
WA × 6
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 4 ms 256 KiB
sample_2.txt AC 4 ms 256 KiB
sample_3.txt AC 4 ms 256 KiB
sub1_1.txt WA 4 ms 256 KiB
sub1_2.txt WA 5 ms 256 KiB
sub1_3.txt WA 4 ms 256 KiB
sub1_4.txt AC 4 ms 256 KiB
sub1_5.txt AC 4 ms 256 KiB
sub1_6.txt AC 4 ms 256 KiB
sub1_7.txt AC 4 ms 256 KiB
sub1_8.txt AC 4 ms 256 KiB
sub1_9.txt WA 4 ms 256 KiB
sub2_1.txt AC 4 ms 256 KiB
sub2_2.txt AC 4 ms 256 KiB
sub2_3.txt AC 4 ms 256 KiB
sub2_4.txt AC 4 ms 256 KiB
sub2_5.txt AC 4 ms 256 KiB
sub2_6.txt AC 5 ms 256 KiB
sub2_7.txt AC 5 ms 256 KiB
sub2_8.txt WA 6 ms 256 KiB
sub2_9.txt WA 7 ms 384 KiB