competitive-programming/solved-topcoder/Solved/SplitIntoPairs.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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define inf HUGE_VAL

class SplitIntoPairs {
public:
    int makepairs(vector<int> A, int X) {
        cout << A.size() << endl;
        int ret = 0, k = 0;
        vector<int> v;
        vector<int> vv;
        int i;
        for (i = 0; i < A.size(); i++) {
            if (A[i] < 0)
                vv.push_back(A[i]);
            else
                v.push_back(A[i]);
        }
        sort(v.begin(), v.end());
        sort(vv.begin(), vv.end());
        k = 0;
        ret = 0;
        if (v.size()) {
            ret = v.size() / 2;
            if (v.size() % 2) k = 1;
        }
        if (vv.size()) {
            ret += vv.size() / 2;
        }
        if (k == 1) {
            if ((long long)vv[vv.size() - 1] * v[0] >= X) ret++;
        }
        vv.clear();
        v.clear();
        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();
        if ((Case == -1) || (Case == 5)) test_case_5();
    }

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[] = {2, -1};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -1;
        int Arg2 = 0;
        verify_case(0, Arg2, makepairs(Arg0, Arg1));
    }
    void test_case_1() {
        int Arr0[] = {1, -1};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -1;
        int Arg2 = 1;
        verify_case(1, Arg2, makepairs(Arg0, Arg1));
    }
    void test_case_2() {
        int Arr0[] = {-5, -4, 2, 3};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -1;
        int Arg2 = 2;
        verify_case(2, Arg2, makepairs(Arg0, Arg1));
    }
    void test_case_3() {
        int Arr0[] = {5, -7, 8, -2, -5, 3};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -7;
        int Arg2 = 3;
        verify_case(3, Arg2, makepairs(Arg0, Arg1));
    }
    void test_case_4() {
        int Arr0[] = {3, 4, 5, 6, 6, -6, -4, -10, -1, -9};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -2;
        int Arg2 = 4;
        verify_case(4, Arg2, makepairs(Arg0, Arg1));
    }
    void test_case_5() {
        int Arr0[] = {1000000, 1000000};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = -5;
        int Arg2 = 1;
        verify_case(5, Arg2, makepairs(Arg0, Arg1));
    }

    // END CUT HERE
};

// BEGIN CUT HERE
int main() {
    int a[] = {-7726273, -198566,  9681506,  -6792315, -540917,  -4861632, -4982458, -1383709, -6158006, 4166470,
               -6812236, -624690,  5158649,  -9032251, -8845697, 4151603,  6274931,  -8029271, -5157899, 6663477,
               -1398145, -4257609, 145272,   -5237570, 861762,   -4839969, -2853810, 577517,   -941855,  707825,
               -9448768, -438974,  -2454848, 9216156,  5254895,  -923375,  440146,   3309157,  -9364361, 8771003};
    int n = -2352133;
    vector<int> v(a, a + 40);
    n = SplitIntoPairs().makepairs(v, n);
    cout << n;
    return 0;
}
// END CUT HERE