Submission #1369668

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001


int main(){
    cin.sync_with_stdio(false);
    int n;
    string s;
    cin >> n >> s;

    int dp[n] = {};
    repl(i, 1, n) dp[i] = INF;
    rep(i, n) {
        if (i + 1 < n) minch(dp[i + 1], dp[i] + ((s[i] == '.') ? 0 : 1));
        if (i + 2 < n) minch(dp[i + 2], dp[i] + ((s[i] == '.') ? 0 : 1));
        if (i + 3 < n) minch(dp[i + 3], dp[i] + ((s[i] == '.') ? 0 : 1));
    }
    cout << dp[n - 1] << endl;

    return 0;
}

Submission Info

Judge Result