SRM 459 DIV 2

#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <string> #include <cstring> using namespace std; //template<class T> T gcd(T a,T b){ if(a<0) return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);} //template <class T> T lcm(T a,T b){ return a*(b/gcd(a,b));} //template <typename T> string tostr(const T& t) { ostringstream os; os<<t; return os.str(); } // vector< string > words; istringstream sin(str); string t;while (sin >> t); words.push_back(t); #define PI 3.1415926535897932384626 class RecursiveFigures { public:double getArea(int sideLength, int K) { double sum=0; double L=sideLength; while(K--) { sum+=PI*(L*L)/4-L*L/2.0; L=L/sqrt(2.0); } sum+=L*L; return sum; } };

 250分的题目还是非常顺利的。。

#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <string> #include <cstring> using namespace std; //template<class T> T gcd(T a,T b){ if(a<0) return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);} //template <class T> T lcm(T a,T b){ return a*(b/gcd(a,b));} //template <typename T> string tostr(const T& t) { ostringstream os; os<<t; return os.str(); } // vector< string > words; istringstream sin(str); string t;while (sin >> t); words.push_back(t); class Inequalities { public:int maximumSubset(vector <string> IP) { int a[3001]; memset(a,0,sizeof(a)); for(double i=-0.5;i<=1001;i+=0.5) { for(int j=0;j<IP.size();j++) { char X; istringstream sin(IP[j]); sin>>X; string Y; sin>>Y; int Z; sin>>Z; if(Y=="<") { if(i<Z) a[(int)(i*2+1)]++; // break; } if(Y=="<=") { if(i<=Z) a[(int)(i*2+1)]++; //break; } if(Y=="=") { if(Z==i) a[(int)(i*2+1)]++; // break; } if(Y==">=") { if(i>=Z) a[(int)(i*2+1)]++; // break; } if(Y==">") { if(i>Z) a[(int)(i*2+1)]++; // break; } } } int min=0; int mark=0; for(int i=0;i<=3000;i++) { if(a[i]>=min) { mark=i; min=a[i]; } } cout<<mark<<endl; return min; } };

 

500分的题目再次犯了错误，自己不够细心读题啊！结果把1001写成了1000，然后很快被cha到，自己还是蛮郁闷的。。。。

下次不要再犯如此之错误

#include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <sstream> #include <cstring> #include <functional> #include <cstdlib> #include <queue> #include <map> #include <set> #include <cctype> #include <string> #include <vector> using namespace std; class ParkAmusement { public: double getProbability(vector <string> landings, int startLanding, int K); }; vector <string> landings; int n; double dp[64][64]; int outnum[64]; //calp函数实现从start节点开始走K步，走到Exit的概率 //dp[][]表示走了K步，走到当前柱子的概率 double calp(int start, int k) { if (landings[start][start] == 'E' || landings[start][start] == 'P') return 0; memset(dp, 0, sizeof(dp)); dp[start][0] = 1.0; for (int i = 0; i < k; ++i) { for (int now = 0; now < n; ++now) { if (dp[now][i] == 0) continue; if (landings[now][now] != '0') continue; for (int j = 0; j < n; ++j) { if (landings[now][j] == '1') { dp[j][i + 1] += dp[now][i] / outnum[now]; } } } } //结果可能会有多个出口！所以要遍历！ double ret = 0; for (int i = 0; i < n; ++i) { if (landings[i][i] == 'E') ret += dp[i][k]; } return ret; } double ParkAmusement::getProbability(vector <string> _landings, int startLanding, int K) { landings = _landings; n = landings.size(); memset(outnum, 0, sizeof(outnum)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (landings[i][j] == '1') ++outnum[i]; } } //outnum[]保存我们此时可以达到的landing 数 double p = calp(startLanding, K); double sum = 0; for (int i = 0; i < n; ++i) { sum += calp(i, K); } return p / sum; }

 

1000分是一个dp问题！这个问题我觉得非常好！虽然读题的时候感觉很模糊，不是很清楚！

dp的过程还是非常清晰的！