Submission #1624453
Source Code Expand
#include<iostream> #include<string> #include<string.h> #include<algorithm> #include<stdio.h> #include<cmath> #include<vector> #include<utility> #include<queue> #include<stack> #include<stdlib.h> #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) #define MOD 1000000007 using namespace std; int main(void) { string s; string t; bool flag = false; cin >> s; FOR(i, 0, s.size() - 1) { if ((flag == false)&(s[i] == 'I')) { t.push_back('I'); flag = true; } else if ((flag == true) && (s[i] == 'O')) { t.push_back('O'); flag = false; } } if (t.size()%2==0&&t.size()!=0) { t.pop_back(); } if (t.size() >= 1) { cout << t.size() << endl; } else { cout << 0 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - IOI列車で行こう2 |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 801 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | AC | 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 | 3 ms | 256 KB |
sub2_9.txt | AC | 3 ms | 384 KB |