CodeForces 699C Vacations
2016-07-22 19:44
260 查看
C. 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:
on this day the gym is closed and the contest is not carried out;
on this day the gym is closed and the contest is carried out;
on this day the gym is open and the contest is not carried out;
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
output
input
output
input
output
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.
这个题很有意思,然后因为数据比较小,所以直接滚一遍。题目很简单,具体看代码吧。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[111],b[111];
int main()
{
int i,n;
while(~scanf("%d",&n))
{
int flag=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[0]==3)
{
b[0]=2;
a[0]=1;
flag=1;
}
if(flag&&i!=0)
b[i]=a[i];
}
int ans=0;
for(i=1;i<n;i++)
{
if(a[i]==3&&a[i-1]==2)
a[i]=1;
if(a[i]==3&&a[i-1]==1)
a[i]=2;
if(a[i]==a[i-1]&&(a[i]==2||a[i]==1))
a[i]=0;
}
for(i=0;i<n;i++)
if(a[i]==0)
ans++;
if(flag)
{
for(i=1;i<n;i++)
{
if(b[i]==3&&b[i-1]==2)
b[i]=1;
if(b[i]==3&&b[i-1]==1)
b[i]=2;
if(b[i]==b[i-1]&&(b[i]==2||b[i]==1))
b[i]=0;
}
int temp=0;
for(i=0;i<n;i++)
if(b[i]==0)
temp++;
if(temp<ans)
ans=temp;
}
printf("%d\n",ans);
}
return 0;
}
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:
on this day the gym is closed and the contest is not carried out;
on this day the gym is closed and the contest is carried out;
on this day the gym is open and the contest is not carried out;
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
22 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.
这个题很有意思,然后因为数据比较小,所以直接滚一遍。题目很简单,具体看代码吧。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[111],b[111];
int main()
{
int i,n;
while(~scanf("%d",&n))
{
int flag=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[0]==3)
{
b[0]=2;
a[0]=1;
flag=1;
}
if(flag&&i!=0)
b[i]=a[i];
}
int ans=0;
for(i=1;i<n;i++)
{
if(a[i]==3&&a[i-1]==2)
a[i]=1;
if(a[i]==3&&a[i-1]==1)
a[i]=2;
if(a[i]==a[i-1]&&(a[i]==2||a[i]==1))
a[i]=0;
}
for(i=0;i<n;i++)
if(a[i]==0)
ans++;
if(flag)
{
for(i=1;i<n;i++)
{
if(b[i]==3&&b[i-1]==2)
b[i]=1;
if(b[i]==3&&b[i-1]==1)
b[i]=2;
if(b[i]==b[i-1]&&(b[i]==2||b[i]==1))
b[i]=0;
}
int temp=0;
for(i=0;i<n;i++)
if(b[i]==0)
temp++;
if(temp<ans)
ans=temp;
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- google地图、高德地图基于基站定位位置纠偏
- 解决Android SDK Manager无法更新的问题[设置代理]
- 剑指offer——和为s的两个数字且乘积最小
- 转载:python使用urllib2抓取防爬取链接
- 欢迎使用CSDN-markdown编辑器
- linux终端,日期及echo的使用方法
- Numpy 常用函数及读写操作
- Android BLE开发——Android手机与BLE终端通信初识
- 基于MVC+EasyUI的Web开发框架经验总结(2)- 使用EasyUI的树控件构建Web界面
- 旋转数组的最小数字
- java打印文件夹以及文件的路径打印
- 关于我
- 【POJ2286】The Rotation Game
- eclipse快捷键 包括查找类、方法、变量
- UVA 10892 LCM Cardinality
- 小白笔记-------------------二分搜索算法(再刷一遍)
- c语言-指针变量的引用
- 梯度下降法
- Android 命名规范和编码规范(尽力简单,多写注释)
- Java 构建器