-
Notifications
You must be signed in to change notification settings - Fork 5
/
LittleElephantAndIntervalsDiv1.cpp
114 lines (95 loc) · 3.28 KB
/
LittleElephantAndIntervalsDiv1.cpp
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
// BEGIN CUT HERE
/*
SRM 595 Div1 Easy (250)
問題
-何個かの白いボールが横一列に並んでいる
-ロボットがコマンドに従ってボールを白か黒に塗る
-一つのコマンドは開始位置と終了位置と色からなる
-塗り方の総数を求める
*/
// END CUT HERE
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std;
class LittleElephantAndIntervalsDiv1 {
public:
long long getNumber(int M, vector <int> L, vector <int> R) {
int f[1001] = {};
for (int i = 0; i < (int)L.size(); ++i) {
for (int j = L[i]; j <= R[i]; ++j) {
f[j] = i+1;
}
}
long long ans = 1;
for (int i = 1; i <= L.size(); ++i) {
for (int j = 1; j <= M; ++j) {
if (f[j] == i) {
ans *= 2;
break;
}
}
}
return ans;
}
// BEGIN CUT HERE
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 long long &Expected, const long long &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
public:
void run_test(int Case) {
int n = 0;
// test_case_0
if ((Case == -1) || (Case == n)){
int Arg0 = 4;
int Arr1[] = {1, 2, 3};
int Arr2[] = {1, 2, 3};
long long Arg3 = 8LL;
vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
verify_case(n, Arg3, getNumber(Arg0, Arg1, Arg2));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
int Arg0 = 3;
int Arr1[] = {1, 1, 2};
int Arr2[] = {3, 1, 3};
long long Arg3 = 4LL;
vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
verify_case(n, Arg3, getNumber(Arg0, Arg1, Arg2));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
int Arg0 = 1000;
int Arr1[] = {47};
int Arr2[] = {747};
long long Arg3 = 2LL;
vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
verify_case(n, Arg3, getNumber(Arg0, Arg1, Arg2));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
int Arg0 = 42;
int Arr1[] = {5, 23, 4, 1, 15, 2, 22, 26, 13, 16, 28, 13, 27, 9, 18, 4, 10, 3, 4, 4, 3, 4, 1, 18, 18, 2, 38, 4, 10, 12, 3, 30, 11, 38, 2, 13, 1, 13, 18, 16, 13, 2, 14, 27, 13, 3, 26, 19, 5, 10};
int Arr2[] = {30, 41, 17, 1, 21, 6, 28, 30, 15, 19, 31, 28, 35, 27, 30, 13, 31, 5, 8, 25, 40, 10, 3, 26, 23, 9, 40, 8, 40, 23, 12, 37, 35, 39, 11, 34, 10, 21, 22, 21, 24, 5, 39, 27, 17, 16, 26, 35, 25, 36};
long long Arg3 = 256LL;
vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
verify_case(n, Arg3, getNumber(Arg0, Arg1, Arg2));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
LittleElephantAndIntervalsDiv1 ___test;
___test.run_test(-1);
}
// END CUT HERE