|
| 1 | +#include <iostream> |
| 2 | +#include <sstream> |
| 3 | +#include <vector> |
| 4 | +#include <algorithm> |
| 5 | +#include <set> |
| 6 | +#include <map> |
| 7 | +#include <queue> |
| 8 | +#include <cstring> |
| 9 | +#include <climits> |
| 10 | +#include <cstdio> |
| 11 | +using namespace std; |
| 12 | +typedef pair<int,int> pi; |
| 13 | +typedef set<int> si; |
| 14 | +typedef vector<int> vi; |
| 15 | +typedef vector<vi> vvi; |
| 16 | +typedef vector<string> vs; |
| 17 | +typedef long long ll; |
| 18 | +#define sz size() |
| 19 | +#define mp(x, y) make_pair(x, y) |
| 20 | +#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b) |
| 21 | +#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b] |
| 22 | +#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b) |
| 23 | +#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b] |
| 24 | +#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b) |
| 25 | +#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b] |
| 26 | +#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b) |
| 27 | +#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b] |
| 28 | +#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b) |
| 29 | +#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b] |
| 30 | +#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b) |
| 31 | +#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b] |
| 32 | +#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b] |
| 33 | + |
| 34 | +class SurveillanceSystem{ |
| 35 | + public: |
| 36 | + void g(string s, int c[55], int L){ |
| 37 | + if(s.empty()) return; |
| 38 | + int n = s.size(); |
| 39 | + if(n < L) return; |
| 40 | + fie(n-L){ |
| 41 | + string t = s.substr(i, L); |
| 42 | + int j = count(t.begin(), t.end(), 'X'); |
| 43 | + c[i] = j; |
| 44 | + } |
| 45 | + } |
| 46 | + vi convert(int n, int L, int c[55]){ |
| 47 | + vi m(55, 0); |
| 48 | + fie(n-L) m[c[i]]++; |
| 49 | + return m; |
| 50 | + } |
| 51 | + string getContainerInfo(string containers, vector <int> reports, int L){ |
| 52 | + string s = containers; |
| 53 | + int n = s.size(); |
| 54 | + int c[55] = {0}; |
| 55 | + si S; |
| 56 | + for(int i : reports) S.insert(i); |
| 57 | + string ans(n, '?'); |
| 58 | + g(s, c, L); |
| 59 | + vi m(55, 0); |
| 60 | + for(int i : reports) m[i]++; |
| 61 | + fi(n) cout<<c[i]; |
| 62 | + cout<<endl; |
| 63 | + fi(n) cout<<m[i]; |
| 64 | + cout<<endl; |
| 65 | + |
| 66 | + fi(n){ |
| 67 | + int flag = 0; |
| 68 | + for(int j = max(0, i+1-L); j <= i && j+L <= n; j++) if(S.count(c[j])) flag = 1; |
| 69 | + if(!flag) ans[i] = '-'; |
| 70 | + } |
| 71 | + |
| 72 | + fi(n){ |
| 73 | + if(ans[i] == '-') continue; |
| 74 | + |
| 75 | + string s1, s2; |
| 76 | + s1 = s.substr(0, i); |
| 77 | + s2 = s.substr(i+1, n-1-i); |
| 78 | + int c1[55] = {0}, c2[55] = {0}; |
| 79 | + g(s1, c1, L); |
| 80 | + g(s2, c2, L); |
| 81 | + vi m1 = convert(s1.size(), L, c1), m2 = convert(s2.size(), L, c2); |
| 82 | + fje(n){ |
| 83 | + int k = m1[j]+m2[j]; |
| 84 | + if(k < m[j]) ans[i] = '+'; |
| 85 | + } |
| 86 | + } |
| 87 | + return ans; |
| 88 | + } |
| 89 | + |
| 90 | + |
| 91 | +// BEGIN CUT HERE |
| 92 | + public: |
| 93 | + 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(); } |
| 94 | + private: |
| 95 | + 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(); } |
| 96 | + 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; } } |
| 97 | + 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)); } |
| 98 | + 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)); } |
| 99 | + 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)); } |
| 100 | + 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)); } |
| 101 | + 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)); } |
| 102 | + |
| 103 | +// END CUT HERE |
| 104 | + |
| 105 | +}; |
| 106 | + |
| 107 | +// BEGIN CUT HERE |
| 108 | +int main(){ |
| 109 | + |
| 110 | + SurveillanceSystem ___test; |
| 111 | + ___test.run_test(-1); |
| 112 | +} |
| 113 | +// END CUT HERE |
0 commit comments