SRM481 div1

 搞了很久才搞出topcoder的客户端以及各种插件和程序的写法。。

好麻烦。进入pratice 练习了一场考试。。

orz。。。一场75分钟三道题的考试。我的水平看英文题加敲代码一共花了几小时才完成 - -

 

罚时好可怕= =、、还有一大串没几人看得懂的数学公式计分规则、。插件生成的。各种orz

 

以下不全是我自己想出来的。

 

 

250分题。可以枚举几个说真话的人说谎，我是列方程然后解。。判断一下解得范围

 

500分题。我们可以知道如果一个人要完成任务。。他的所有任务要连续的才可以最优。。

其他的什么都好解决

主要是要解决对于任意一段任务，每个任务期望等待时间。。

这个我们对于一个任务任意一种排列。有一个相反的序列，就是把所有元素反过来。。

每个排列都有个相反的排列。。最后的期望时间就是在总时间的最中间..

 

900分题。前几天考试考到过。牛逼题目啊。。在此题中，我们到达一个点。如果正向的思路的dp是需要两个值，
一个是到达这个点的最少时间和之前的最大时间。
。我在考试时候想的是二分时间，然后状压dp。因为这样很明显tle-。所以作罢。。
题解的方法很巧妙的反过来做。我们用f[l][r][opt][0]表示在这段区间内。选完opt中剩下的所花费最少时间。
我们的目标状态是f[k][k][i][1<<(i-1][0]。。这样我们可以不用考虑路程。因为最少时间直接从路程加上去。。
从而得到需要的值
这道题让我知道了一种新的思路。。。
以后做到这种记录两个值的dp题目的时候，如果二分不行。需用这种逆向的思路想一下。

// BEGIN CUT HERE // END CUT HERE #line 5 "ChickenOracle.cpp" #include <cstdlib> #include <cctype> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <queue> #include <stack> #include <fstream> #include <numeric> #include <iomanip> #include <bitset> #include <list> #include <stdexcept> #include <functional> #include <utility> #include <ctime> using namespace std; #define PB push_back #define MP make_pair #define REP(i,n) for(i=0;i<(n);++i) #define FOR(i,l,h) for(i=(l);i<=(h);++i) #define FORD(i,h,l) for(i=(h);i>=(l);--i) typedef vector<int> VI; typedef vector<string> VS; typedef vector<double> VD; typedef long long LL; typedef pair<int,int> PII; int min(int x,int y) {return x<y?x:y;} bool solve(int n,int ans, int lie ,int liar) { // ans= liar - x+ (n-lie) -x if ((n-lie+liar-ans)%2) return false; int x=(n-lie+liar-ans)/2; if (x<=liar && x<=n-lie && liar-x<=lie && x>=0 ) return true; else return false; } class ChickenOracle { public: string theTruth(int n, int m, int lie, int liar) { bool t1=solve(n,m,lie,liar); bool t2=solve(n,n-m,lie,liar); if (t1 && t2) return "Ambiguous"; if (t1) return "The egg"; if (t2) return "The chicken"; return "The oracle is a lie"; } // 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(); } 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() { int Arg0 = 10; int Arg1 = 10; int Arg2 = 0; int Arg3 = 0; string Arg4 = "The oracle is a lie"; verify_case(0, Arg4, theTruth(Arg0, Arg1, Arg2, Arg3)); } void test_case_1() { int Arg0 = 60; int Arg1 = 40; int Arg2 = 0; int Arg3 = 30; string Arg4 = "The oracle is a lie"; verify_case(1, Arg4, theTruth(Arg0, Arg1, Arg2, Arg3)); } void test_case_2() { int Arg0 = 60; int Arg1 = 20; int Arg2 = 5; int Arg3 = 25; string Arg4 = "The chicken"; verify_case(2, Arg4, theTruth(Arg0, Arg1, Arg2, Arg3)); } void test_case_3() { int Arg0 = 933615; int Arg1 = 357697; int Arg2 = 739848; int Arg3 = 43938; string Arg4 = "Ambiguous"; verify_case(3, Arg4, theTruth(Arg0, Arg1, Arg2, Arg3)); } // END CUT HERE }; // BEGIN CUT HERE int main() { ChickenOracle ___test; ___test.run_test(-1); return 0; } // END CUT HERE

 

 #line 5 "BatchSystemRoulette.cpp" #include <cstdlib> #include <cctype> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <queue> #include <stack> #include <fstream> #include <numeric> #include <iomanip> #include <bitset> #include <list> #include <stdexcept> #include <functional> #include <utility> #include <ctime> using namespace std; #define PB push_back #define MP make_pair #define REP(i,n) for(int i=0;i<(n);++i) #define FOR(i,l,h) for(int i=(l);i<=(h);++i) #define FORD(i,h,l) for(int i=(h);i>=(l);--i) typedef vector<int> VI; typedef vector<string> VS; typedef vector<double> VD; typedef long long LL; typedef pair<int,int> PII; vector <string> s; vector <double> p; vector <double> res; double ans; int tot; class BatchSystemRoulette { public: vector <double> expectedFinishTimes(vector <int> ttme, vector <string> user) { int n=ttme.size(); REP(i,n) { bool t=false; REP(j,s.size()) if (s[j]==user[i]) { p[j] += ttme[i]; t=true; break; } if (!t) { s.push_back(user[i]); p.push_back(ttme[i]); } } int len=s.size(); REP(i,n) { REP(j,s.size()) if (s[j]==user[i]) tot=j; ans=0; REP(j,len) { if (p[tot]==p[j]) ans += p[j]/2; else if (p[tot] > p[j]) ans += p[j]; } ans += ((double) ttme[i])/2; res.PB(ans); } // system("pause"); return res; } // 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(); } 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 vector <double> &Expected, const vector <double> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "/tExpected: " << print_array(Expected) << endl; cerr << "/tReceived: " << print_array(Received) << endl; } } void test_case_0() { int Arr0[] = {3, 2, 4, 1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"Gil Grissom", "Sarah Sidle", "Warrick Brown", "Catherine Willows"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); double Arr2[] = {6.0, 3.0, 10.0, 1.0 }; vector <double> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(0, Arg2, expectedFinishTimes(Arg0, Arg1)); } void test_case_1() { int Arr0[] = {3, 2, 4, 1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"mac taylor", "Mac Taylor", "Mac Taylor", "Peyton Driscoll"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); double Arr2[] = {4.0, 8.0, 9.0, 1.0 }; vector <double> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(1, Arg2, expectedFinishTimes(Arg0, Arg1)); } void test_case_2() { int Arr0[] = {13, 14, 15, 56, 56}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"Tim Speedle", "Tim Speedle", "Tim Speedle", "Horatio Caine", "YEEEAAAAAAAAAAH"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); double Arr2[] = {27.5, 28.0, 28.5, 126.0, 126.0 }; vector <double> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(2, Arg2, expectedFinishTimes(Arg0, Arg1)); } // END CUT HERE }; // BEGIN CUT HERE int main() { BatchSystemRoulette ___test; ___test.run_test(-1); return 0; } // END CUT HERE

// BEGIN CUT HERE // END CUT HERE #line 5 "TicketPrinters.cpp" #include <cstdlib> #include <cctype> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <queue> #include <stack> #include <fstream> #include <numeric> #include <iomanip> #include <bitset> #include <list> #include <stdexcept> #include <functional> #include <utility> #include <ctime> using namespace std; #define PB push_back #define MP make_pair #define REP(i,n) for(i=0;i<(n);++i) #define FOR(i,l,h) for(i=(l);i<=(h);++i) #define FORD(i,h,l) for(i=(h);i>=(l);--i) typedef vector<int> VI; typedef vector<string> VS; typedef vector<double> VD; typedef long long LL; typedef pair<int,int> PII; #define rep(i,a,b) for (int i = a; i < b; ++i) #define inf 1000000000 int min (int a,int b) { return (a<b?a:b); } int max (int a,int b) { return (a<b?b:a); } int n,k,test,dis[16],ans,f[16][65536][2],want[16],start[16],pt[65536],len[65536]; void read() { dis[0] = 0; rep(i,1,n) { dis[i] += dis[i-1]; } } void predo() { rep (i,0,1 << 16) rep (j,0,16) if ((1<<j) & i) len[i]++; } int dfs(int l, int opt, int dir) { if ((opt ==( 1 << n)-1 )) return 0; int& res = f[l][opt][dir]; if (res != inf) return (res); int r = l + len[opt]-1; int now = dir?r:l; rep (i,0,n) { if (l) { if (!(opt & (1<<i))) res = min ( res, max( dfs(l-1,opt|(1<<i),0) ,abs(want[i]-start[l-1])+1)+dis[now]-dis[l-1]); } if (r<n-1) { if (!(opt & (1<<i))) res = min ( res, max( dfs(l,opt|(1<<i),1), abs(want[i]-start[r+1])+1)+dis[r+1]-dis[now]); } } return res; } void solve() { rep (i,0,n) rep(j,0,1<<n) f[i][j][0] = f[i][j][1] = inf; ans = inf; rep (i,0,n) ans = min ( ans , max(dfs(k,1 << i,0) , abs(want[i]-start[k])+1)); } class TicketPrinters { public: int minTime(int kk, vector <int> dist, vector <int> startt, vector <int> wantt) { k=kk; n=startt.size(); rep(i,1,n) dis[i]=dist[i-1]; rep(i,0,n) start[i]=startt[i]; rep(i,0,n) want[i]=wantt[i]; predo(); read(); solve(); 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(); } 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() { int Arg0 = 0; int Arr1[] = {100, 20, 50}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = {66, 78, 99, 5}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arr3[] = {99, 5, 78, 66}; vector <int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0]))); int Arg4 = 171; verify_case(0, Arg4, minTime(Arg0, Arg1, Arg2, Arg3)); } void test_case_1() { int Arg0 = 1; int Arr1[] = {50, 50}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = {100, 200, 300}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arr3[] = {101, 201, 302}; vector <int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0]))); int Arg4 = 152; verify_case(1, Arg4, minTime(Arg0, Arg1, Arg2, Arg3)); } void test_case_2() { int Arg0 = 2; int Arr1[] = {13, 26, 39, 13}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = {123, 12, 32, 67, 1015}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arr3[] = {1, 2, 3, 4, 5}; vector <int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0]))); int Arg4 = 1063; verify_case(2, Arg4, minTime(Arg0, Arg1, Arg2, Arg3)); } // END CUT HERE }; // BEGIN CUT HERE int main() { TicketPrinters ___test; ___test.run_test(-1); return 0; } // END CUT HERE