| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 484506 | M4mou | 버섯 세기 (IOI20_mushrooms) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
 string s;
int use_machine(vector<int> a){
    int cnt = 0;
    for(int i = 0;i<((int)a.size())-1;i++){
        if(s[a[i]] != s[a[i+1]])cnt++;
    }
    return cnt;
}
int count_mushrooms(int n) {
	int cnt = 1;
    for(int i = 1;i<n-1;i+=2){
        vector<int> a;
        a.push_back(i);
         a.push_back(0);
         a.push_back(i+1);
        int x = use_machine(a);
        if(x == 0){
            cnt += 2;
        }
        else if(x == 1){
            cnt += 1;
        }
    }
    if(n%2==0){
         vector<int> a;
         a.push_back(0);
        a.push_back(n-1);
         int x = use_machine(a);
        if(x == 0)cnt++;
    }
    return cnt;
}
int main(){
    while(1){
    cin >> s;
    cout << count_mushrooms(s.size()) << endl;
    }
}
