Store Credit-GOOGLE CODE JAM AFICA 2010 Qualification Round

题目来源：http://code.google.com/codejam/contest/dashboard?c=351101#s=p0

 

我的算法效率很低啊，直接一个一个比的，还有什么好的算法吗？恩，待会儿上网搜一下。

#include <iostream> #include <vector> #include <fstream> using namespace std; int main() { int cnt,tmp; ifstream in("A-large-practice.in"); ofstream out("A-large-practice.out"); vector<int> item_num; vector<int> credit; int** item; int i=0,j=0,k; //读取数据 in >> cnt; item = new int*[cnt]; while(cnt>0) { in >> tmp; credit.push_back(tmp); in >> tmp; item_num.push_back(tmp); i=0; item[j]=new int[tmp]; while(tmp>0) { in >> item[j][i++]; tmp--; } j++; cnt--; } //开始处理 for(i=0;i<credit.size();i++) { for(j=0;j<item_num[i];j++) { for(k=j+1;k<item_num[i];k++) { if(item[i][j]+item[i][k]==credit[i]) out << "Case #" << i+1 << ": " << j+1 << " " << k+1 << endl; } } } return 0; }

 

附录：

Problem

You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you would like to buy two items that add up to the entire value of the credit. The solution you provide will consist of the two integers indicating the positions of the items in your list (smaller number first).

Input

The first line of input gives the number of cases, N. N test cases follow. For each test case there will be:

• One line containing the value C, the amount of credit you have at the store.
• One line containing the value I, the number of items in the store.
• One line containing a space separated list of I integers. Each integer P indicates the price of an item in the store.
• Each test case will have exactly one solution.

Output

For each test case, output one line containing "Case #x: " followed by the indices of the two items whose price adds up to the store credit. The lower index should be output first.

Limits

5 ≤ C ≤ 1000
1 ≤ P ≤ 1000

Small dataset

N = 10
3 ≤ I ≤ 100

Large dataset

N = 50
3 ≤ I ≤ 2000

Sample

Input	Output
3 100 3 5 75 25 200 7 150 24 79 50 88 345 3 8 8 2 1 9 4 4 56 90 3	Case #1: 2 3 Case #2: 1 4 Case #3: 4 5