CodeForces 698A Vacations

题目地址

A. Vacations

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options:

1. on this day the gym is closed and the contest is not carried out;
2. on this day the gym is closed and the contest is carried out;
3. on this day the gym is open and the contest is not carried out;
4. on this day the gym is open and the contest is carried out.

On each of days Vasya can either have a rest or write the contest (if it is carried out on this day), or do sport (if the gym is open on this day).

Find the minimum number of days on which Vasya will have a rest (it means, he will not do sport and write the contest at the same time). The only limitation that Vasya has — he does not want to do the same activity on two consecutive days: it means, he will not do sport on two consecutive days, and write the contest on two consecutive days.

Input

The first line contains a positive integer n (1 ≤ n ≤ 100) — the number of days of Vasya's vacations.

The second line contains the sequence of integers a1, a2, ..., an (0 ≤ ai ≤ 3) separated by space, where:

• ai equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
• ai equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
• ai equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
• ai equals 3, if on the i-th day of vacations the gym is open and the contest is carried out.

Output

Print the minimum possible number of days on which Vasya will have a rest. Remember that Vasya refuses:

• to do sport on any two consecutive days,
• to write the contest on any two consecutive days.

Examples

input

4
1 3 2 0

output

2

input

7
1 3 3 2 1 2 3

output

0

input

2
2 2

output

1

Note

In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days.

In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day.

In the third test Vasya can do sport either on a day number 1 or number 2. He can not do sport in two days, because it will be contrary to the his limitation. Thus, he will have a rest for only one day.

简单题意：有n天，每天有休息/健身/打比赛三个选项，不能连续两天或两天以上的健身/打比赛，告诉你每天是否可以健身/打比赛，求出n天里最少休息的天数。

思路：二维DP，第一维是天数，第二维是状态（休息/健身/打比赛）

我的代码：

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int MaxN = 105;
int n;
int f[MaxN][4];
int date[MaxN];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	memset(f, 0, sizeof(f));
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> date[i];
	for (int i = 1; i <= n; i++) {
		if (date[i] == 0) {
			f[i][1] = min(f[i - 1][1], min(f[i - 1][2], f[i - 1][3])) + 1;
			f[i][2] = MaxN;
			f[i][3] = MaxN;
		} else if (date[i] == 1) {
			f[i][1] = min(f[i - 1][1], min(f[i - 1][2], f[i - 1][3])) + 1;
			f[i][2] = min(f[i-1][1],f[i-1][3]);
			f[i][3] = MaxN;
		} else if (date[i] == 2) {
			f[i][1] = min(f[i - 1][1], min(f[i - 1][2], f[i - 1][3])) + 1;
			f[i][2] = MaxN;
			f[i][3] = min(f[i - 1][1], f[i - 1][2]);
		} else {
			f[i][1] = min(f[i - 1][1], min(f[i - 1][2], f[i - 1][3])) + 1;
			f[i][2] = min(f[i - 1][1], f[i - 1][3]);
			f[i][3] = min(f[i - 1][1], f[i - 1][2]);
		}
	}
	int ans = min(f[n][1], min(f[n][2], f[n][3]));
	cout << ans << "\n";
}

Z君代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<ctime>
#include<complex>
#define ft first
#define sd second
#define pb push_back
#define mkp make_pair
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)<(b)?(b):(a))
using namespace std;
typedef long long LL;
typedef pair<int,int> Pair;
const int inf=0x3f3f3f3f;
const double eps=1e-6;
const int mod=1e9+7;
const int maxn=110;
int n;
int dp[maxn][5];
int a[maxn];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        dp[i][0]=max(max(dp[i-1][0],dp[i-1][1]),dp[i-1][2]);
        if(a[i]==1)
        {
            dp[i][2]=max(dp[i-1][0],dp[i-1][1])+1;
        }
        else if(a[i]==2)
        {
            dp[i][1]=max(dp[i-1][0],dp[i-1][2])+1;
        }
        else if(a[i]==3)
        {
            dp[i][2]=max(dp[i-1][0],dp[i-1][1])+1;
            dp[i][1]=max(dp[i-1][0],dp[i-1][2])+1;
        }
    }
    cout<<n-max(max(dp[n][0],dp[n][1]),dp[n][2])<<endl;
}

学弟的代码：

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#define INF 200
using namespace std;
int n, a[200], f[200][5];
int main(){
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i];
    for (int i=1;i<=n;i++) f[i][1]=f[i][2]=f[i][0]=INF;
    for (int i=1;i<=n;i++){
        if (a[i]==0) f[i][0]=min(f[i-1][1],min(f[i-1][0],f[i-1][2]))+1;
        if (a[i]==1){
                     f[i][1]=min(f[i-1][0],f[i-1][2]);
                     f[i][0]=min(f[i-1][0],min(f[i-1][1],f[i-1][2]))+1;
                     }
        if (a[i]==2){
                     f[i][2]=min(f[i-1][0],f[i-1][1]);
                     f[i][0]=min(f[i-1][0],min(f[i-1][2],f[i-1][1]))+1;
                     }
        if (a[i]==3){
                     f[i][1]=min(f[i-1][0],f[i-1][2]);
                     f[i][2]=min(f[i-1][0],f[i-1][1]);
                     f[i][0]=min(f[i-1][0],min(f[i-1][2],f[i-1][1]))+1;
                     }
    }
    int ans=min(f[n][0],min(f[n][1],f[n][2]));
    cout<<ans<<endl;
    return 0;
}