RCC 2014 Warmup (Div. 1)

A

暴力

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<cmath>
 #include<queue>
 #include<set>
 using namespace std;
 #define N 1010
 #define LL long long
 #define INF 0xfffffff
 const double eps = 1e-;
 const double pi = acos(-1.0);
 const double inf = ~0u>>;
 vector<int>ed[N];
 bool w[N][N];
 int main()
 {
     int i,j,n,m;
     int flag = ;
     cin>>n>>m;
     for(i = ; i <=  n;i++)
     {
         int k = ;
         w[i][i] = ;
         for(j =  ; j <= n ; j++)
         {
             if(!w[i][j])
             {
                 w[i][j] = ;
                 w[j][i] = ;
                 ed[i].push_back(j);
                 k++;
             }
             if(k==m) break;
         }
         if(k<m)
         {
             flag = ;
             break;
         }
     }
     if(!flag) {puts("-1");return ;}
     printf("%d\n",n*m);
     for(i = ; i <= n ;i++)
     {
         for(j = ; j < ed[i].size(); j++)
         printf("%d %d\n",i,ed[i][j]);
     }
     return ;
 }

B 状压

这个需要排下序，不然不能保证压的正确。

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<cmath>
 #include<queue>
 #include<set>
 using namespace std;
 #define N 1010
 #define LL long long
 //#define INF 1e18+1e12
 const double eps = 1e-;
 const double pi = acos(-1.0);
 const double inf = ~0u>>;
 const LL INF = (1ll<<);
 LL dp[<<];
 struct node
 {
     int x,k,m;
     int a[];
     int s;
 }p[];
 bool cmp(node a,node b)
 {
     return a.k<b.k;
 }
 int main()
 {
     int i,j,n,m;
     LL b;
     cin>>n>>m>>b;
     for(i =  ; i < (<<m) ; i++)
     dp[i] = INF;
     for(i = ; i <= n ;i++)
     {
         p[i].s =  ;
         scanf("%d%d%d",&p[i].x,&p[i].k,&p[i].m);
         for(j = ; j < p[i].m ; j++)
         {
             scanf("%d",&p[i].a[j]);
             p[i].s|=(<<(p[i].a[j]-));
         }
     }
     sort(p+,p+n+,cmp);
     dp[] = ;
     LL ans= INF;
     for(i = ; i <= n ;i++)
     {
         for(j =  ;j < (<<m) ; j++)
         {
             if(dp[j]==INF) continue;
             dp[j|p[i].s] = min(dp[j|p[i].s],dp[j]+p[i].x);
         }
         ans = min(ans,dp[(<<m)-]+p[i].k*b);
     }
     if(ans==INF)
     puts("-1");
     else
     cout<<ans<<endl;
     return ;
 }