此题一开始就看了。。又把题意看错,我以为是随便选。感觉压力巨大就放了。。结果竟然是在i时间做第i个题目。
比赛时用DFS300多ms水过了,代码如下:
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<string.h>
#include<string>
#include<bitset>
using namespace std;
#define ll __int64
#define eps 1e-10
#define MOD 20071027
double a[15][1010];
int vis[15];
int timu;
double pp;
void dfs(int ti,int ren,double ans)
{
if(pp!=0&&ans+timu-ti<pp) return;
if(ti == timu)
{
pp = max(ans,pp);
return;
}
for(int i = 0; i < ren; i++) if(!vis[i])
{
vis[i] = 1;
dfs(ti+1,ren,ans+a[i][ti]);
vis[i] = 0;
}
}
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o4.txt","w",stdout);
#endif // GLQ
int tt,n,m,i,j,cas=1;
scanf("%d",&tt);
while(tt--)
{
scanf("%d%d",&n,&m);
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
scanf("%lf",&a[i][j]);
int t = 0,c = 0,bian;
double ans = 0;
while(t < m)
{
double anst = 0;
if(m-t >= n) bian = n;
else bian = m-t;
timu = t+bian;
pp = 0;
memset(vis,0,sizeof(vis));
dfs(t,n,anst);
t += bian;
ans += pp;
}
printf("Case #%d: %.5lf\n",cas++,ans);
}
return 0;
}
当时水过,赛后想了状压的方法又写了一遍,用dp[i][j]代表做第i个题所达到的状态的最大值,比如dp[2][0110]这种状态就是合法的,如果是dp[2][0001]这样就是不合法的状态,所以就枚举题数来递推。
AC代码:
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<string.h>
#include<string>
#include<bitset>
using namespace std;
#define ll __int64
#define eps 1e-7
#define MOD 20071027
template<class T>
inline void scan_d(T &ret)
{
char c;
int flag = 0;
ret=0;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c == '-')
{
flag = 1;
c = getchar();
}
while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
if(flag) ret = -ret;
}
double dp[12][1<<11];
double a[12][1005];
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o4.txt","w",stdout);
#endif // GLQ
int t,n,m,i,j,cas=1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i = 0; i < n; i++)
for(j = 0; j < m; j++) scanf("%lf",&a[i][j]);
int w = 0;
double ans = 0;
while(w < m)
{
int shi;
if(w+n <= m) shi = n;
else shi = m-w;
for(i = 0; i <= shi; i++)
for(j = 0; j <= (1<<n); j++) dp[i][j] = -100000;
dp[0][0] = 0;
for(i = 0; i < shi; i++)
{
for(j = 0; j < (1<<n); j++) if(dp[i][j]>=0)
{
for(int k = 0; k < n; k++) if(!(j&(1<<k)))
{
dp[i+1][j|(1<<k)] = max(dp[i+1][j|(1<<k)],dp[i][j]+a[k][w+i]);
// printf("dp[%d][%d]=%lf %lf\n",i+1,j|(1<<k),dp[i+1][j|(1<<k)],a[k][w+i]);
}
}
}
if(shi == n) ans += dp[n][(1<<n)-1];
else
{
double da = 0;
for(i = 0; i < (1<<n); i++)
{
int num=0;
for(j = 0; j < n; j++) if(i&(1<<j)) num++;
if(num == shi) da = max(da,dp[shi][i]);
}
ans += da;
}
w += shi;
}
printf("Case #%d: %.5lf\n",cas++,ans);
}
return 0;
}