SRM 443

 

D2 500p： CirclesCountry

 

简单题，枚举每两个点是否在同一圆内。

 

D2 1000p：  Polygons2

 

首先将数组segments排序。对于segments[i]而言，它能组成的N边形个数=总长度大于segments[i]的前面N-1边形的个数。设状态表示为F[i][k][sum]，k表示边数，则F[i][k][sum] = F[i - 1][k - 1][sum - segments[i]] + F[i - 1][k][sum]。最后对每一个i做统计得和。

 

class Polygons2 { long long int f[2][51][50100]; public: long long number(vector <int> segments, int K) { memset ( f, 0, sizeof ( f ) ); sort ( segments.begin (), segments.end () ); int n = segments.size (); if ( n < K ) return 0; int i, k, p; long long sum; long long max = segments[n - 1] + 1; long long cnt = 0; f[0][0][0] = 1; for ( i = 0, p = 0; i < n - 1; i ++, p = 1 - p ) { for ( sum = 0; sum <= max; sum ++ ) f[1 - p][0][sum] = f[p][0][sum]; for ( k = 1; k < K; k ++ ) { for ( sum = 0; sum < segments[i]; sum ++ ) f[1 - p][k][sum] = f[p][k][sum]; for ( sum = segments[i]; sum <= max; sum ++ ) f[1 - p][k][sum] += f[p][k - 1][sum - segments[i]]; for ( sum = max - segments[i] + 1; sum <= max; sum ++ ) f[1 - p][k][max] += f[p][k - 1][sum]; } for ( sum = segments[i + 1] + 1; sum <= max; sum ++ ) cnt += f[1 - p][K - 1][sum]; memcpy ( f[p], f[1 - p], sizeof ( f[p] ) ); } //print ( K, max ); return cnt; } }

 

D1 500p : BinaryFlips

 

很好的一个题目，BFS+压缩路径优化。

 

假如单纯用BFS，该题的复杂度是O(N*M)，M代表了当前所有能到达的状态。由于在M其中许多状态都是相关联的，考虑对其作优化。

 

设A[a]代表了走到a状态时最少需要的步数。再建立一个双向链表维护尚未到达的状态。

 

当在a状态下翻K个硬币，得到的是一串新状态：l, l + 2, l + 4,...h - 2, h，那么此时就可以把l到h的序列从链表里脱链。有新序列时先寻找未到达状态序列的首地址，然后遍历一下就行了。

 

class BinaryFlips { void insert ( int index, int value ) { a[index] = value; if ( prev[index] != -1 ) next[prev[index]] = next[index]; if ( next[index] != -1 ) prev[next[index]] = prev[index]; } int findFirst ( int index ) { if ( index == -1 || a[index] == -1 ) return index; return next[index] = findFirst ( next[index] ); } public: int minimalMoves(int A, int B, int K) { int i, high, low; int N = A + B; for ( i = 0; i <= N; i ++ ) a[i] = -1; for ( i = 0; i <= N; i ++ ) { next[i] = i + 2; if ( next[i] > N ) next[i] = -1; } for ( i = 0; i <= N; i ++ ) { prev[i] = i - 2; if ( prev[i] < 0 ) prev[i] = -1; } insert ( A, 0 ); queue < int > q; q.push ( A ); while ( !q.empty () ) { int cur = q.front (); q.pop (); if ( K > N ) low = -1; else if ( K < cur ) low = cur - K; else low = K - cur; if ( K > N ) high = -1; else if ( K + cur < N ) high = K + cur; else high = N - ( K + cur - N ); low = findFirst ( low ); int j; for ( j = low; j <= high && j != -1; j = next[j] ) { insert ( j, a[cur] + 1 ); q.push ( j ); } } return a[0]; } }