Interesting Calculator CSU
来源:互联网 发布:linux vim 不保存退出 编辑:程序博客网 时间:2024/06/07 21:10
题目:
There is an interesting calculator. It has 3 rows of buttons.
Row 1: button 0, 1, 2, 3, …, 9. Pressing each button appends that digit to the end of the display.
Row 2: button +0, +1, +2, +3, …, +9. Pressing each button adds that digit to the display.
Row 3: button *0, *1, *2, *3, …, *9. Pressing each button multiplies that digit to the display.
Note that it never displays leading zeros, so if the current display is 0, pressing 5 makes it 5 instead of 05. If the current display is 12, you can press button 3, +5, *2 to get 256. Similarly, to change the display from 0 to 1, you can press 1 or +1 (but not both!).
Each button has a positive cost, your task is to change the display from x to y with minimum cost. If there are multiple ways to do so, the number of presses should be minimized.
Input
There will be at most 30 test cases. The first line of each test case contains two integers x and y(0<=x<=y<=105). Each of the 3 lines contains 10 positive integers (not greater than 105), i.e. the costs of each button.
Output
For each test case, print the minimal cost and the number of presses.
Sample Input
12 256
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
12 256
100 100 100 1 100 100 100 100 100 100
100 100 100 100 100 1 100 100 100 100
100 100 10 100 100 100 100 100 100 100
Sample Output
Case 1: 2 2
Case 2: 12 3
思路:
把所能达到的数字当做一个一个点,则起始数字和目标数字便是起点和终点,而给定的那些按钮可以想象成可以走的步数,与是便可以抽象成一个迷宫问题了。简单的bfs即可
代码:
#include <iostream>#include <cstdio>#include <queue>#define INF 0x3f3f3f3fusing namespace std;int n,m;int no;int w[3][10];int vis[123456];struct NUM{ int cost; int times; int num; NUM(){} NUM(int _cost,int _times,int _num):cost(_cost),times(_times),num(_num){} friend bool operator < (NUM a,NUM b) { if(a.cost!=b.cost) return a.cost>b.cost; else return a.times>b.times; }};priority_queue<NUM>q;void init(){ for(int i=0;i<100005;i++) vis[i]=INF; while(!q.empty()) q.pop();}void bfs(int st){ NUM t; q.push(NUM(0,0,st)); vis[st]=1; while(!q.empty()) { t=q.top(); if(t.num==m) { printf("Case %d: %d %d\n",++no,t.cost,t.times); return; } q.pop(); for(int i=0;i<3;i++) { for(int j=0;j<10;j++) { if(i==0&&t.num*10+j<=m&&t.cost+w[i][j]<vis[t.num*10+j]) q.push(NUM(t.cost+w[i][j],t.times+1,t.num*10+j)),vis[t.num*10+j]=t.cost+w[i][j]; if(i==1&&t.num+j<=m&&t.cost+w[i][j]<vis[t.num+j]) q.push(NUM(t.cost+w[i][j],t.times+1,t.num+j)),vis[t.num+j]=t.cost+w[i][j]; if(i==2&&t.num*j<=m&&t.cost+w[i][j]<vis[t.num*j]) q.push(NUM(t.cost+w[i][j],t.times+1,t.num*j)),vis[t.num*j]=t.cost+w[i][j]; } } }}int main(){ no=0; while(scanf("%d%d",&n,&m)!=EOF) { init(); for(int i=0;i<3;i++) { for(int j=0;j<10;j++) { scanf("%d",&w[i][j]); } } bfs(n); } return 0;}
- Interesting Calculator CSU
- CSU-1336--Interesting Calculator(bfs)
- CSU~1336: Interesting Calculator(spfa)
- CSU 1336 Interesting Calculator(spfa)
- CSU-1336: Interesting Calculator,最短路思想!
- CSU 1336: Interesting Calculator<BFS+优化><湖南省赛真题>
- Interesting Calculator
- Interesting Calculator
- CSU 1336: Interesting Calculator(BFS啊 湖南省第九届大学生计算机程序设计竞赛)
- UVA 12664 Interesting Calculator
- Interesting Calculator UVA
- Interesting Calculator UVA
- Interesting Calculator UVA
- TOJ 4603 Interesting Calculator -- SPFA
- Interesting Calculator 湖南第九届省赛
- UVA 12664 Interesting Calculator(spfa)
- CSU1336(湖南第九届原题) Interesting Calculator
- CSUOJ 1336 Interesting Calculator spfa / 优先队列
- HOOK技术(钩子)
- 关于android:layout_weight属性你不知道的事
- ZooKeeper
- jedis使用
- csdn中如何转载别人的文章?
- Interesting Calculator CSU
- 简单且广泛运用的模式——单例模式
- 2017.08.21
- JavaScript基础库
- Linux进程内存分析和内存泄漏定位
- 记一次生产故障,数据库报错:WARNING: inbound connection timed out (ORA-3136)
- 【lightoj 1214】Large Division (大数除法)
- reg51 reg52区别
- form表单中enctype属性全解析