competitive-programming/solved-topcoder/Solved/CatsOnTheLineDiv2.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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;

#define ft        first
#define sd        second
#define mp        make_pair
#define pb(x)     push_back(x)
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define mem(a, b) memset(a, b, sizeof(a))
#define meminf(a) memset(a, 126, sizeof(a))
#define inf       1e7
#define eps       1e-9
#define mod       1000000007
#define NN        10100
#define z         4000

// cout << setfill('0') << setw(3) << a << endl;
// cout << fixed << setprecision(20) << a << endl;

struct D {
    int pos, cnt;
} a[60];

bool flag[NN];

bool comp(D aa, D bb) { return aa.pos < bb.pos; }

struct CatsOnTheLineDiv2 {
    string getAnswer(vector<int> position, vector<int> count, int time) {
        string ret;
        int n = count.size();
        int i, j, k, l;
        for (i = 0; i < count.size(); i++) {
            a[i].pos = position[i];
            a[i].cnt = count[i];
        }
        sort(a, a + n, comp);
        mem(flag, 0);

        int low = -inf;
        int high = inf;

        for (i = 0; i < n; i++) {
            low = a[i].pos - time + z;
            high = a[i].pos + time + z;
            int cnt = 0;
            while (low <= high && cnt < a[i].cnt) {
                if (flag[low] == 0) {
                    cnt++;
                    flag[low] = 1;
                }
                low++;
            }
            if (cnt < a[i].cnt) return "Impossible";
        }

        return "Possible";
    }

    // 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 string& Expected, const string& 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[] = {0};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arr1[] = {7};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arg2 = 3;
        string Arg3 = "Possible";
        verify_case(0, Arg3, getAnswer(Arg0, Arg1, Arg2));
    }
    void test_case_1() {
        int Arr0[] = {0};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arr1[] = {8};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arg2 = 2;
        string Arg3 = "Impossible";
        verify_case(1, Arg3, getAnswer(Arg0, Arg1, Arg2));
    }
    void test_case_2() {
        int Arr0[] = {0, 1};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arr1[] = {3, 1};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arg2 = 0;
        string Arg3 = "Impossible";
        verify_case(2, Arg3, getAnswer(Arg0, Arg1, Arg2));
    }
    void test_case_3() {
        int Arr0[] = {5, 0, 2};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arr1[] = {2, 3, 5};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arg2 = 2;
        string Arg3 = "Impossible";
        verify_case(3, Arg3, getAnswer(Arg0, Arg1, Arg2));
    }
    void test_case_4() {
        int Arr0[] = {5, 1, -10, 7, 12, 2, 10, 20};
        vector<int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arr1[] = {3, 4, 2, 7, 1, 4, 3, 4};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arg2 = 6;
        string Arg3 = "Possible";
        verify_case(4, Arg3, getAnswer(Arg0, Arg1, Arg2));
    }

    // END CUT HERE
};

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