competitive-programming/solved-topcoder/Solved/BinPackingEasy.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97

#include <bits/stdc++.h>
using namespace std;

class BinPackingEasy {
public:
    int minBins(vector<int> v) {
        int ret = 0;
        int n = v.size();
        vector<int> flag(n, 0);
        sort(v.rbegin(), v.rend());
        for (int i = 0; i < n; i++) {
            if (flag[i] == 0) {
                int rem = 300 - v[i];
                for (int j = i + 1; j < n; j++)
                    if (flag[j] == 0 && v[j] <= rem) {
                        rem -= v[j];
                        flag[j] = 1;
                    }
                ret++;
            }
        }
        return ret;
    }

    // BEGIN CUT HERE
public:
    void run_test(int Case) {
        if ((Case == -1) || (Case == 0)) test_case_0();
        if ((Case == -1) || (Case == 1)) test_case_1();
        if ((Case == -1) || (Case == 2)) test_case_2();
        if ((Case == -1) || (Case == 3)) test_case_3();
        if ((Case == -1) || (Case == 4)) test_case_4();
    }

private:
    template <typename T>
    string print_array(const vector<T>& V) {
        ostringstream os;
        os << "{ ";
        for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\",";
        os << " }";
        return os.str();
    }
    void verify_case(int Case, const int& Expected, const int& Received) {
        cerr << "Test Case #" << Case << "...";
        if (Expected == Received)
            cerr << "PASSED" << endl;
        else {
            cerr << "FAILED" << endl;
            cerr << "\tExpected: \"" << Expected << '\"' << endl;
            cerr << "\tReceived: \"" << Received << '\"' << endl;
        }
    }
    void test_case_0() {
        int Arr0[] = {150, 150, 150, 150, 150};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 3;
        verify_case(0, Arg1, minBins(Arg0));
    }
    void test_case_1() {
        int Arr0[] = {130, 140, 150, 160};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 2;
        verify_case(1, Arg1, minBins(Arg0));
    }
    void test_case_2() {
        int Arr0[] = {101, 101, 101, 101, 101, 101, 101, 101, 101};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 5;
        verify_case(2, Arg1, minBins(Arg0));
    }
    void test_case_3() {
        int Arr0[] = {101, 200, 101, 101, 101, 101, 200, 101, 200};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 6;
        verify_case(3, Arg1, minBins(Arg0));
    }
    void test_case_4() {
        int Arr0[] = {123, 145, 167, 213, 245, 267, 289, 132, 154, 176, 198};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 8;
        verify_case(4, Arg1, minBins(Arg0));
    }

    // END CUT HERE
};

// BEGIN CUT HERE
int main() {
    BinPackingEasy ___test;
    ___test.run_test(-1);
    int gbase;
    cin >> gbase;  // erase this line if you are not using dev-cpp! :)
    return 0;
}
// END CUT HERE