add more

Author: oeddyo

.DS_Store

@@ -0,0 +1,70 @@
+#include <iostream>
+#include <iomanip>    
+
+
+using namespace std;
+
+
+const int MAXN = 1001;
+double dp[MAXN][MAXN][2];
+const double INF = 999999999.99;
+int white, black;
+
+
+double get_ans(int w, int b, int who){
+    if(dp[w][b][who]!=INF){
+        return dp[w][b][who];
+    }
+    if(w>0 && b<=0){
+        return 1.0;
+    }
+    if(w<=0 || w+b<=0){
+        return 0.0;
+    }
+    double w_prob = w*1.0/(w+b);
+    if(who==0){
+        double res = w_prob;
+        res += (1-w_prob)*(1-get_ans(w,b-1,1-who));
+        dp[w][b][who] = res;
+        return res;
+    }else{
+        double res = w_prob;
+
+        //take one black out
+        int cur_b = b-1;
+        int cur_w = w;
+
+        //black jump
+        if(cur_b-1 >= 0){
+            res += (1-w_prob) * (cur_b*1.0/(cur_b + cur_w))*(1-get_ans(cur_w, cur_b-1, 1-who));
+        }
+
+        //white jump
+        if(cur_w-1 >= 0){
+            res += (1-w_prob) * (cur_w*1.0/(cur_w + cur_b))*(1-get_ans(cur_w-1,cur_b, 1-who));
+        }
+        dp[w][b][who] = res;
+        return res;
+    }
+}
+
+
+
+void work(){
+    for(int i=0; i<=white; i++){
+        for(int j=0;j<=black; j++){
+            dp[i][j][0] = dp[i][j][1] = INF;
+        }
+    }
+    
+    double ans = get_ans(white, black, 0);
+    cout<<std::setprecision(15)<< ans<<endl;
+}
+
+
+int main(){
+    cin>>white>>black;
+    work();
+    return 0;
+}
+

cf/105/a.out

@@ -0,0 +1,82 @@
+#include <iostream>
+#include <cstring>
+
+#include <vector>
+
+using namespace std;
+
+
+string S;
+string forb[14];
+
+const int INF = 99999999;
+const int MAXN = 100005;
+int N, dp[MAXN][2];
+
+bool is_in(int a, int b, string &myS){
+    for(int i=0; i<N; i++){
+        if((forb[i][0]==myS[a] && forb[i][1]==myS[b])||(forb[i][0]==myS[b] && forb[i][1]==myS[a])){
+            return true;
+        }
+    }
+    return false;
+}
+
+typedef pair<int, int> pii;
+void work(){
+    S+="#"; 
+    int n_char = S.length();
+    vector< pii > V;
+    int pre = 0, ans = 0;
+    for(int i=1; i<n_char; i++){
+        if(S[i]==S[pre]){
+            continue;
+        }else{
+            int a = pre;
+            int b = i-1;
+            V.push_back( pii(a,b));
+            pre = i;
+        }
+    }
+    for(int i=0; i<MAXN; i++){
+        dp[i][0] = dp[i][1] = INF;
+    }
+
+
+    dp[0][0] = V[0].second-V[0].first+1;
+    dp[0][1] = 0;
+    
+    int sz = V.size();
+    cout<<"sz = "<<sz<<endl;
+    for(int i=0; i<sz; i++){
+        cout<<V[i].first<<" "<<V[i].second<<endl;
+    }
+    for(int i=1; i<sz; i++){
+        int l_a = V[i].second-V[i].first+1;
+        if(is_in( V[i-1].first, V[i].first, S)){
+            dp[i][1] = min(dp[i-1][0], dp[i][1]);
+            dp[i][0] = min(dp[i-1][0],dp[i-1][1])+l_a;
+        }else{
+            dp[i][1] = min(min(dp[i-1][0], dp[i-1][1]), dp[i][1]);
+            dp[i][0] = min(dp[i-1][0],dp[i-1][1])+l_a;
+        }
+        cout<<"dp["<<i<<"][0] = "<<dp[i][0]<<" dp["<<i<<"][1] = "<<dp[i][1]<<endl;
+    }
+
+    ans = min(dp[sz-1][0], dp[sz-1][1]);
+    cout<<ans<<endl;
+}
+
+
+int main(){
+   
+    cin>>S;
+    cin>>N;
+    for(int i=0; i<N; i++){
+        cin>>forb[i];
+    }
+    work();
+
+    return 0;
+}
+

cf/105/div2_D.cpp

@@ -0,0 +1,48 @@
+#include <iostream>
+#include <string>
+#include <stdio.h>
+#include <cstring>
+#include <string.h>
+
+
+using namespace std;
+
+string str1, str2;
+const int MAXN = 2003;
+int dp[MAXN][MAXN];
+
+void work(){
+    memset(dp,0,sizeof(dp));
+    int sz_1 = str1.size();
+    int sz_2 = str2.size();
+     
+    int tmp_max = 0;
+    for(int i=1; i<sz_1; i++){
+        for(int j=1; j<sz_2; j++){
+            if(str1[i]==str2[j]){
+                dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1);
+                //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
+                tmp_max = max(tmp_max, dp[i][j]);
+            }else{
+                dp[i][j] = 0; 
+            }
+
+        }
+    }
+    cout<<tmp_max<<endl;
+
+    cout<<sz_2 - 1 - tmp_max<<endl;
+}
+
+int main(){
+    cin>>str1;
+    cin>>str2;
+    str1 = "#"+str1;
+    str2 = "*"+str2;
+    work();
+
+
+
+    return 0;
+}
+

cf/109/A_div1.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+#include <string>
+#include <stdio.h>
+#include <cstring>
+#include <string.h>
+
+
+using namespace std;
+
+string str1, str2;
+const int MAXN = 2003;
+int dp[MAXN][MAXN];
+
+int work(string &mystr1, string &mystr2){
+
+    int ptr1 = 0, ptr2 = 0;
+    int sz1 = mystr1.size(), sz2 = mystr2.size();
+    
+    int cnt = 0;
+    while(ptr2<sz2){
+        while(ptr1<sz1){
+            if(mystr1[ptr1]==mystr2[ptr2]){
+                ptr1++, ptr2++;
+                cnt++;
+            }else{
+                ptr1++;
+            }
+        }
+        if(ptr1>=sz1){
+            break;
+        }
+    }
+    int len = 0;
+    
+    if(sz1>sz2){
+        return sz1 - cnt;
+    }else{
+        return sz2 - cnt;
+    }
+}
+
+int main(){
+    cin>>str1;
+    cin>>str2;
+
+
+    int sz = str1.size();
+    int sz2 = str2.size();
+    int ans = 1000000000;
+    for(int i=0; i<sz; i++){
+        for(int j=i; j<sz; j++){
+            int len = j-i+1;
+            string tmp = str1.substr(i, len);
+
+            if(tmp[0]!=str2[0] ||  tmp[len-1]!=str2[sz2-1])continue;
+
+            int cur = work(tmp, str1);
+            ans = min(cur, ans);
+            cout<<"tmp = "<<tmp<<endl;
+            cout<<cur<<endl;
+        }
+    }
+
+    cout<<"ans = "<<ans<<endl;
+
+
+    return 0;
+}
+

cf/109/a.out

@@ -0,0 +1,68 @@
+#include <iostream>
+#include <vector>
+#include <string.h>
+#include <queue>
+#include <fstream>
+
+using namespace std;
+
+int T, N;
+const int MAXN = 105;
+vector<int> G[MAXN];
+bool visited[MAXN];
+
+typedef pair<int, int> pii;
+
+int work(){
+    int cur_max_dis = 0;
+    for(int start=0; start<N; start++){
+        memset(visited, 0, sizeof(visited));
+        queue< pii > Q;
+        pii init(start, 0);
+        Q.push(init);
+        while(!Q.empty()){
+            pii cur = Q.front();
+            Q.pop();
+            cur_max_dis = max(cur_max_dis, cur.second);
+            visited[cur.first] = 1;
+            int sz = G[cur.first].size();
+            for(int i=0; i<sz; i++){
+                int next = G[cur.first][i];
+                if(visited[next]==false){
+                    pii next_node(next, cur.second+1);
+                    Q.push(next_node);
+                }
+            }
+        }
+    }
+    return cur_max_dis;
+}
+
+
+int main(){
+    ifstream fin("input.txt");
+    ofstream fout("output.txt"); 
+    fin>>T;
+    int ans = 0;
+    for(int spider = 0; spider <T; spider++){
+        fin>>N;
+        for(int i=0; i<MAXN; i++){
+            G[i].clear();
+        }
+
+        for(int i=0; i<N-1; i++){
+            int a, b;
+            fin>>a>>b;
+            a--,b--;
+            G[a].push_back(b);
+            G[b].push_back(a);
+        }
+        //cout<<"ready "<<endl;
+        int cur = work();
+        ans += cur;
+    }
+    fout<<ans<<endl;
+
+    return 0;
+}
+