forked from keshavnandan/Topcoder
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSurveillanceSystem.cpp
113 lines (103 loc) · 5.48 KB
/
SurveillanceSystem.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
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <climits>
#include <cstdio>
using namespace std;
typedef pair<int,int> pi;
typedef set<int> si;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef long long ll;
#define sz size()
#define mp(x, y) make_pair(x, y)
#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b)
#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b]
#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b)
#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b]
#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b)
#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b]
#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b)
#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b]
#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b)
#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b]
#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b)
#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b]
#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b]
class SurveillanceSystem{
public:
void g(string s, int c[55], int L){
if(s.empty()) return;
int n = s.size();
if(n < L) return;
fie(n-L){
string t = s.substr(i, L);
int j = count(t.begin(), t.end(), 'X');
c[i] = j;
}
}
vi convert(int n, int L, int c[55]){
vi m(55, 0);
fie(n-L) m[c[i]]++;
return m;
}
string getContainerInfo(string containers, vector <int> reports, int L){
string s = containers;
int n = s.size();
int c[55] = {0};
si S;
for(int i : reports) S.insert(i);
string ans(n, '?');
g(s, c, L);
vi m(55, 0);
for(int i : reports) m[i]++;
fi(n) cout<<c[i];
cout<<endl;
fi(n) cout<<m[i];
cout<<endl;
fi(n){
int flag = 0;
for(int j = max(0, i+1-L); j <= i && j+L <= n; j++) if(S.count(c[j])) flag = 1;
if(!flag) ans[i] = '-';
}
fi(n){
if(ans[i] == '-') continue;
string s1, s2;
s1 = s.substr(0, i);
s2 = s.substr(i+1, n-1-i);
int c1[55] = {0}, c2[55] = {0};
g(s1, c1, L);
g(s2, c2, L);
vi m1 = convert(s1.size(), L, c1), m2 = convert(s2.size(), L, c2);
fje(n){
int k = m1[j]+m2[j];
if(k < m[j]) ans[i] = '+';
}
}
return ans;
}
// 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() { string Arg0 = "-X--XX"; int Arr1[] = {1, 2}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 3; string Arg3 = "??++++"; verify_case(0, Arg3, getContainerInfo(Arg0, Arg1, Arg2)); }
void test_case_1() { string Arg0 = "-XXXXX-"; int Arr1[] = {2}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 3; string Arg3 = "???-???"; verify_case(1, Arg3, getContainerInfo(Arg0, Arg1, Arg2)); }
void test_case_2() { string Arg0 = "------X-XX-"; int Arr1[] = {3, 0, 2, 0}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 5; string Arg3 = "++++++++++?"; verify_case(2, Arg3, getContainerInfo(Arg0, Arg1, Arg2)); }
void test_case_3() { string Arg0 = "-XXXXX---X--"; int Arr1[] = {2, 1, 0, 1}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 3; string Arg3 = "???-??++++??"; verify_case(3, Arg3, getContainerInfo(Arg0, Arg1, Arg2)); }
void test_case_4() { string Arg0 = "-XX--X-XX-X-X--X---XX-X---XXXX-----X"; int Arr1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 7; string Arg3 = "???++++?++++++++++++++++++++??????--"; verify_case(4, Arg3, getContainerInfo(Arg0, Arg1, Arg2)); }
// END CUT HERE
};
// BEGIN CUT HERE
int main(){
SurveillanceSystem ___test;
___test.run_test(-1);
}
// END CUT HERE