codeforces---1042B- Vitamins(JAVA)

Vitamins

Description

Berland shop sells n kinds of juices. Each juice has its price ci. Each juice includes some set of vitamins in it. There are three types of vitamins: vitamin “A”, vitamin “B” and vitamin “C”. Each juice can contain one, two or all three types of vitamins in it.
Petya knows that he needs all three types of vitamins to stay healthy. What is the minimum total price of juices that Petya has to buy to obtain all three vitamins? Petya obtains some vitamin if he buys at least one juice containing it and drinks it.

Input

The first line contains a single integer n(1≤n≤1000)— the number of juices.
Each of the next n lines contains an integer ci (1≤ci≤100000)and a string si
— the price of the i-th juice and the vitamins it contains. String si contains from
1 to 3 characters, and the only possible characters are “A”, “B” and “C”. It is guaranteed that each letter appears no more than once in each string si. The order of letters in strings si is arbitrary.

Output

Print -1 if there is no way to obtain all three vitamins. Otherwise print the minimum total price of juices that Petya has to buy to obtain all three vitamins.

Sample

Input
4
5 C
6 B
16 BAC
4 A
Output
15

Input
2
10 AB
15 BA
Output
-1

Input
5
10 A
9 BC
11 CA
4 A
5 B
Output
13

Input
6
100 A
355 BCA
150 BC
160 AC
180 B
190 CA
Output
250

Input
2
5 BA
11 CB
Output
16

Note

In the first example Petya buys the first, the second and the fourth juice. He spends 5+6+4=15 and obtains all three vitamins. He can also buy just the third juice and obtain three vitamins, but its cost is 16, which isn’t optimal.
In the second example Petya can’t obtain all three vitamins, as no juice contains vitamin “C”.

题目解释

大体意思就是卖很多种饮料。每种饮料可能包含维生素A,B,C一种或多种。我们要做的就是，从输入的数据中，找出能完全获取三种维生素ABC的最低价格。
注意啦:字母ABC的顺序是可以打乱的，但是每条数据每种维生素只会出现一次
我写的程序一如既往没有任何算法哈哈哈哈哈，真是尴尬。。。。就是硬写。什么DP、回溯、递归什么的在我脑子里都只有一个名字哈哈哈哈哈。所以。。。开始吧

Java 代码实现

package algorithm_study;
import java.util.Arrays;
import java.util.Scanner;
public class Vitamins {
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int mina=Integer.MAX_VALUE, minb=Integer.MAX_VALUE, minc =Integer.MAX_VALUE, minab=Integer.MAX_VALUE, 
				minac=Integer.MAX_VALUE, minbc=Integer.MAX_VALUE, min3=Integer.MAX_VALUE;
		int wa=0, wb=0,wc=0,wab=0,wac=0,wbc=0,w3=0;
		while(n>=0){
			String str = "";
			str = sc.nextLine();
			String[] temp = str.split(" ");
			if(temp.length ==2){
				if(temp[1].length()==3){ //当vitamins包含3种时
					w3 = Integer.parseInt(temp[0]);
					if(w3<min3){
						min3 = w3;
					}
				}
				if(temp[1].length()==2 && (temp[1].equals("AB")|| temp[1].equals("BA"))){
					wab = Integer.parseInt(temp[0]);
					if(wab<minab){
						minab = wab;
					}
				}
				if(temp[1].length()==2 && (temp[1].equals("AC")|| temp[1].equals("CA"))){
					wac = Integer.parseInt(temp[0]);
					if(wac<minac){
						minac = wac;
					}
				}
				if(temp[1].length()==2 && (temp[1].equals("BC")|| temp[1].equals("CB"))){
					wbc = Integer.parseInt(temp[0]);
					if(wbc<minbc){
						minbc = wbc;
					}
				}
				if(temp[1].length()==1 && temp[1].equals("A")){
					wa = Integer.parseInt(temp[0]);
					if(wa<mina){
						mina = wa;
					}
				}
				if(temp[1].length()==1 && temp[1].equals("B")){
					wb = Integer.parseInt(temp[0]);
					if(wb<minb){
						minb = wb;
					}
				}
				if(temp[1].length()==1 && temp[1].equals("C")){
					wc = Integer.parseInt(temp[0]);
					if(wc<minc){
						minc = wc;
					}
				}
			}
			n--;
		}
		int[] juice = {min3,addExact(mina,minbc),addExact(minb,minac),addExact(minc,minab),addExact(mina,addExact(minb,minc)),
				addExact(minab,minac),addExact(minab,minbc),addExact(minac,minbc),addExact(minac,minab)};
		
		if(min3!=Integer.MAX_VALUE || (mina !=Integer.MAX_VALUE && minbc!=Integer.MAX_VALUE) || (minb !=Integer.MAX_VALUE && minac !=Integer.MAX_VALUE)
				|| (mina!=Integer.MAX_VALUE && minb!=Integer.MAX_VALUE && minc!=Integer.MAX_VALUE)
				|| (minab!=Integer.MAX_VALUE && minac!=Integer.MAX_VALUE) || (minab!=Integer.MAX_VALUE && minbc!=Integer.MAX_VALUE) 
				|| (minac!=Integer.MAX_VALUE && minbc!=Integer.MAX_VALUE) || (minac!=Integer.MAX_VALUE && minab!=Integer.MAX_VALUE)){		
			Arrays.sort(juice);
			System.out.println(juice[0]);
		}
		else{
			System.out.println(-1);
		}
	}
	
	public static int addExact(int x, int y) { //判断溢出
        int r = x + y;
        if (((x ^ r) & (y ^ r)) < 0) {
            r=Integer.MAX_VALUE;
        }
        return r;
    }
}

叨叨

codeforces是真的好噢，能根据wrong test number来排查你的程序可能错在哪里。真是棒。