CodeForces 651 A Joysticks
来源:互联网 发布:淘宝运营学起来难吗 编辑:程序博客网 时间:2024/05/01 14:38
Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged at a1 percent and second one is charged at a2 percent. You can connect charger to a joystick only at the beginning of each minute. In one minute joystick either discharges by 2 percent (if not connected to a charger) or charges by 1 percent (if connected to a charger).
Game continues while both joysticks have a positive charge. Hence, if at the beginning of minute some joystick is charged by 1 percent, it has to be connected to a charger, otherwise the game stops. If some joystick completely discharges (its charge turns to 0), the game also stops.
Determine the maximum number of minutes that game can last. It is prohibited to pause the game, i. e. at each moment both joysticks should be enabled. It is allowed for joystick to be charged by more than 100 percent.
The first line of the input contains two positive integers a1 and a2 (1 ≤ a1, a2 ≤ 100), the initial charge level of first and second joystick respectively.
Output the only integer, the maximum number of minutes that the game can last. Game continues until some joystick is discharged.
3 5
6
4 4
5
#include <iostream>#include <string.h>#include <stdlib.h>#include <algorithm>#include <math.h>#include <stdio.h>using namespace std;long long int dp[205][205];int n,m;long long int dfs(int x,int y){ //cout<<x<<" "<<y<<endl; if(dp[x][y]!=-1) return dp[x][y]; if(x-2<0&&y-2>=0) dp[x][y]=dfs(x+1,y-2)+1; else if(x-2>=0&&y-2<0) dp[x][y]=dfs(x-2,y+1)+1; else { dp[x][y]=max(dfs(x+1,y-2),dfs(x-2,y+1)); dp[x][y]++; } return dp[x][y];}int main(){ memset(dp,-1,sizeof(dp)); for(int i=1;i<=100;i++) dp[i][0]=0,dp[0][i]=0; dp[1][1]=0; scanf("%d%d",&n,&m); printf("%lld\n",dfs(n,m)); return 0;}
- CodeForces 651A-Joysticks
- Codeforces 651A Joysticks
- 【CodeForces】[651A]Joysticks
- Codeforces 651A Joysticks
- codeforces 651A Joysticks
- CodeForces 651 A Joysticks
- CodeForces-651A. Joysticks
- CodeForces 651A Joysticks
- codeforces 651A Joysticks
- codeforces 651A A. Joysticks
- codeforces 651A Joysticks【贪心】
- Codeforces 651A Joysticks 【贪心】
- CodeForces 651A:Joysticks【模拟】
- codeforces--651A Joysticks(贪心)
- Codeforces 651A Joysticks【贪心】
- 【CodeForces 651A】Joysticks 模拟
- Codeforces 651A Joysticks(模拟)
- 【codeforces】-#651A-Joysticks(耗电,充电)
- Hive分析窗口函数之CUME_DIST和PERCENT_RANK
- 时光商店下载网页设计
- 总结:如何驱动DS18B20温度传感器
- 前端插件
- 【转载】MFC的程序执行顺序
- CodeForces 651 A Joysticks
- iptables参考命令
- 【VK Cup 2016 - Round 1 (Div 2 Edition)A】【水题 暴力】Bear and Reverse Radewoosh 做题由易到难分高有难到易分高
- Hive分析窗口函数之LAG,LEAD,FIRST_VALUE和LAST_VALUE
- HNACM(七)B.海岛争霸
- LeetCode之3_Longest Substring Without Repeating Characters
- Google Map Android api V2 中使用MapView遇到CameraUpdateFactory is not initialized!的解决办法
- 架构小谈
- maven 教程一 入门