forked from keshavnandan/Topcoder
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCuttingBitString.cpp
90 lines (80 loc) · 3.88 KB
/
CuttingBitString.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
#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 make_pair
#define pb push_back
#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 CuttingBitString{
bool isPower(string s){
if(s[0] == '0') return false;
ll a = stoll(s, NULL, 2);
while(a % 5 == 0) a = a/5;
return a == 1;
}
public:
int getmin(string s){
int n = s.size();
int dp[55] = {0};
fi(n){
string t = s.substr(0, i+1);
if(isPower(t)){
dp[i] = 1;
continue;
}
int minv = 1000;
fj(i){
if(dp[j] == 0 || !isPower(s.substr(j+1, i-j))) continue;
minv = min(minv, dp[j]+1);
}
if(minv < 1000) dp[i] = minv;
}
return dp[n-1] == 0 ? -1 : dp[n-1];
}
// 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() { string Arg0 = "101101101"; int Arg1 = 3; verify_case(0, Arg1, getmin(Arg0)); }
void test_case_1() { string Arg0 = "1111101"; int Arg1 = 1; verify_case(1, Arg1, getmin(Arg0)); }
void test_case_2() { string Arg0 = "00000"; int Arg1 = -1; verify_case(2, Arg1, getmin(Arg0)); }
void test_case_3() { string Arg0 = "110011011"; int Arg1 = 3; verify_case(3, Arg1, getmin(Arg0)); }
void test_case_4() { string Arg0 = "1000101011"; int Arg1 = -1; verify_case(4, Arg1, getmin(Arg0)); }
void test_case_5() { string Arg0 = "111011100110101100101110111"; int Arg1 = 5; verify_case(5, Arg1, getmin(Arg0)); }
// END CUT HERE
};
// BEGIN CUT HERE
int main()
{
CuttingBitString ___test;
___test.run_test(-1);
}
// END CUT HERE