HDU 4175 vector.resize() 坑点

HDU 4175 vector.resize() 坑点

**Vector.resize(size,padding);
size > old.size 的时候
用padding填充 新扩空间 并不会改变原有东西…
所以在原来有值的时候必须clear
不能直接用来初始化**

HDU 4175 一直WA 并不能发现问题所在。
最后用暴力算法还是WA
测试了好久才发现，
每次没有clear。

Problem Description
At Fred Hacker’s school, there are T × C classes, divided into C catagories of T classes each. The day begins with all the category 1 classes being taught simultaneously. These all end at the same time, and then all the category 2 classes are taught, etc. Fred has to take exactly one class in each category. His goal is to choose the set of classes that will minimize the amount of “energy” required to carry out his daily schedule.
The energy requirement of a schedule is the sum of the energy requirement of the classes themselves, and energy consumed by moving from one class to the next through the schedule.

More specifically, taking the jth class in the ith category uses Eij units of energy. The rooms where classes take place are located at integer positions (ranging from 0 to L) along a single hallway. The jth class in the ith category is located at position Pij. Fred starts the day at position 0, moves from class to class, according to his chosen schedule, and finally exits at location L. Moving a distance d uses d units of energy.

Input
The first line of the input is Z ≤ 20 the number of test cases. This is followed by Z test cases. Each test case begins with three space-separated integers: C, T, and L. Each of the following C× T lines gives, respectively, the location and energy consumption of a class. The first T lines represent the classes of category 1, the next T lines represent the classes of category 2, and so on. No two classes in the same category will have the same location.

Bounds:
1 ≤ C ≤ 25
1 ≤ T ≤ 1000
1 ≤ L ≤ 1,000,000
1 ≤ Eij ≤ 1,000,000
0 ≤ Pij ≤ L

Output
For each input instance, the output will be a single integer on a line by itself which is the minimum possible energy of a schedule satisfying the constraints.

Sample Input
1
3 2 5
2 1
3 1
4 1
1 3
1 4
3 2

Sample Output
11

Hint

Explanation of Sample Input:
Fred must take 3 classes every day, and for each he has 2 choices. The hall has length 5.
His first possible class is located at position 2 and will take 1 unit of energy each day, etc.

Explanation of Sample Output:
Here is one way to obtain the minimum energy:
Go to the class at location 2. Energy used: 3
Next, go to the class at location 4. Energy used: 6
Then go to the class at location 3. Energy used: 9
Finally, leave the school at location 5. Energy used: 11

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(int argc, char const *argv[])
{
    int Case;
    cin >> Case;
    int index = 0;
    vector<vector<long long int> >E;
    vector<vector<long long int> >location;
    vector<long long int> row;
    int C, T, L;
    while (index < Case) {
        cin >> C >> T >> L;
        row.resize(T, 0);
        E.resize(C + 2, row);
        location = E;
        for (int i = 1; i <= C; i++)
        {
            for (int j = 0; j < T; j++)
            {
                cin >> location[i][j] >> E[i][j];
            }
        }
        for (int i = 0; i < T; i++)
        {
            E[0][i] = 0;
            E[C + 1][i] = 0;
            location[0][0] = 0;
            location[C + 1][i] = L;
        }
        for (int i = 1; i <= C; i++)
        {
            for (int j = 0; j < T; j++)
            {
                long long int energy = E[i][j] + E[i - 1][j] + abs(location[i][j] - location[i - 1][j]);
                long long int new_energy;
                for (int k = 0; k < T; k++)
                {
                    new_energy = E[i][j] + E[i - 1][k] + abs(location[i][j] - location[i - 1][k]);
                    if (energy > new_energy)
                        energy = new_energy;
                }
                E[i][j] = energy;
            }
        }
        long long int minEnergy = E[C][0] + abs(location[C][0] - L);

        for (int i = 1; i < T; i++)
        {
            if (minEnergy > E[C][i] + abs(location[C][i] - L))
                minEnergy = E[C][i] + abs(location[C][i] - L);
        }
        //cout << "!!!";
        E.clear();
        location.clear();
        row.clear();
        cout << minEnergy << endl;
        index++;
    }
    return 0;
}