南大ACMproblem.pdfVIP

Problems for Brute-force Searching THERE ARE THREE PROBLEMS. ALL TESTCASE TIME LIMIT IS 1000MS AND MEMORY LIMIT IS 64MB. 1 The Robbery In the downtown of Bucharest there is a very big bank with a very big vault. Inside the vault there are N very big boxes numbered from 1 to N . Inside the box with number k there are k very big diamonds, each of weight W and cost C . k k John and Brus are inside the vault at the moment. They would like to steal ev- erything, but unfortunately they are able to carry diamonds with the total weight not exceeding M . Your task is to help John and Brus to choose diamonds with the total weight less than or equal to M and the maximal possible total cost. Input The test case starts with a line containing two integers N and M separated by a single space. The next line contains N integers Wk separated by single spaces. The following line contains N integers Ck separated by single spaces. Output Print a single line containing the maximal possible total cost of diamonds. Sample Input Sample Output 1 2 Hang or not to hang Little Tom is learning how to program. He has just written some programs but is afraid to run them, because he does not know if they will ever stop. Please write a program to help him. This task is not as easy as it may seem, because Tom’s programs are possibly not deterministic. Given a program written by Tom, your program should tell him whether his program can stop and if so, what is the shortest possible time before it stops. Tom’s computer consists of 32 1-bit registers and the program consists of n instruc- tions. The registers are numbered from 0 to 31 and the instructions are numbered from 0 to n-1. Below, MEM[a] stands for the contents of the a-th register, 0 a b 32, 0 x n, 0 c 1. The instruction set is as follows: Instruction