[USACO15JAN]电影移动Moovie Mooving

[USACO15JAN]电影移动Moovie Mooving

时间限制: 2 Sec  内存限制: 128 MB

题目描述

Bessie is out at the movies. Being mischievous as always, she has decided to hide from Farmer John for L (1 <= L <= 100,000,000) minutes, during which time she wants to watch movies continuously. She has N (1 <= N <= 20) movies to choose from, each of which has a certain duration and a set of showtimes during the day. Bessie may enter and exit a movie at any time during one if its showtimes, but she does not want to ever visit the same movie twice, and she cannot switch to another showtime of the same movie that overlaps the current showtime.

Help Bessie by determining if it is possible for her to achieve her goal of watching movies continuously from time 0 through time L. If it is, determine the minimum number of movies she needs to see to achieve this goal (Bessie gets confused with plot lines if she watches too many movies).

奶牛贝西想连续看L (1 <= L <= 100,000,000)分钟的电影，有 N (1 <= N <= 20)部电影可供选择，每部电影会在一天的不同时段放映。

贝西可以在一部电影播放过程中的任何时间进入或退出放映厅。但她不愿意重复看到一部电影，所以每部电影她最多看到一次。她也不能在看一部电影的过程中，换到另一个正在播放相同电影的放映厅。

请帮贝西计算她能够做到从0到L分钟连续不断地观看电影，如果能，请计算她最少看几部电影就行了。

输入

The first line of input contains N and L.

The next N lines each describe a movie. They begin with its integer duration, D (1 <= D <= L) and the number of showtimes, C (1 <= C <= 1000). The remaining C integers on the same line are each in the range 0..L, and give the starting time of one of the showings of the movie. Showtimes are distinct, in the range 0..L, and given in increasing order.

输出

A single integer indicating the minimum number of movies that Bessie

needs to see to achieve her goal. If this is impossible output -1

instead.

样例输入

4 100
50 3 15 30 55
40 2 0 65
30 2 20 90
20 1 0

样例输出

3

提示

Bessie should attend the first showing of the fourth movie from time 0 to time 20. Then she watches the first showing of the first movie

from time 20 to time 65. Finally she watches the last showing of the second movie from time 65 to time 100.

题解：
因为每个电影都只能看一次，再看n的范围，果断状压dp。

f[i]表示当前i状态下所能够达到的最大时间点。

每次找到一个不在i状态下的电影，然后找到在f[i]时刻看第j部电影可以达到的最大时间。

判断一下f[i|t[j]]是否达到了t，如果是，就更新一下答案就可以了。

具体看代码：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<stack>
 #include<ctime>
 #include<vector>
 using namespace std;
 int n,m,cnt,ans=;
 int f[<<],t[],d[],a[][],c[];
 int find(int x,int t)
 {
     int l=,r=c[x],s=;
     while(l<=r)
     {
         int mid=(l+r)>>;
         if(a[x][mid]>t)
         {
             r=mid-;
         }
         else
         {
             s=mid;
             l=mid+;
         }
     }
     if(s==)return ;
     if(a[x][s]+d[x]>=t)return a[x][s]+d[x];
     else return ;
 }
 int lowbit(int x)
 {
     return x&(-x);
 }
 void judge(int x)
 {
     int i,p=;
     for(i=x;i;i-=lowbit(i))p++;
     ans=min(ans,p);
     return;
 }
 int main()
 {
     int i,j;
     scanf("%d%d",&n,&m);
     cnt=(<<n)-;
     for(i=; i<=n; i++)t[i]=<<(i-);
     for(i=; i<=n; i++)
     {
         scanf("%d%d",&d[i],&c[i]);
         for(j=; j<=c[i]; j++)
             scanf("%d",&a[i][j]);
     }
     for(i=; i<=cnt; i++)
     {
         for(j=; j<=n; j++)
         {
             if(!(i&t[j]))
             {
                 f[i|t[j]]=max(f[i|t[j]],find(j,f[i]));
                 if(f[i|t[j]]>=m)
                 {
                     judge(i|t[j]);
                 }
             }
         }
     }
     if(ans==)cout<<-;
     else cout<<ans;
     return ;
 }