Submission #1945324

---

Source Code Expand

#include <iostream>
#include <vector>
#include<iomanip>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)

int N;
string S;
int width[3] = {1,2,3};

int dfs(int k) {
    if (k == 3 or k == 2 or k == 1) return 0;
    int now = N-k-1;
    int i;
    int ans = 101;
    for (i = 0; i < 3; i++) {
        if(S[now + width[i]] == 'X')
            ans = min(ans, dfs(k - width[i])+1);
        else {
            ans = min(ans, dfs(k - width[i]));
        }
    }
    return ans;
}


int main(int argc, const char * argv[]) {
    cin >> N;
    cin >> S;
    cout << dfs(N-1) << endl;
    return 0;
}

Submission Info

Judge Result