机器人(状压dp/贪心)

https://ac.nowcoder.com/acm/contest/9986/G

---

思路:范围很小，爆搜超时，于是状压dp。当然如果范围大了是个贪心的操作

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e7;
typedef long long LL;

inline __int128 read()
{
    __int128 x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}

inline void write(__int128 x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
        write(x/10);
    putchar(x%10+'0');
}

struct P{
   LL a,b;
}w[25];
LL p[30];
__int128 dp[1<<21];

int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  p[0]=1;
  for(LL i=1;i<=25;i++) p[i]=p[i-1]*2;
  LL n,x;cin>>n>>x;
  for(LL i=1;i<=n;i++){
    LL a,b;cin>>a>>b;
    w[i].a=a;w[i].b=b;
  }
  dp[0]=x;
  for(LL j=0;j<=(1<<n);j++){
    for(LL i=1;i<=n;i++){
        if(j&(p[i-1])){
            dp[j]=max(dp[j],dp[j^(p[i-1])]*w[i].a+w[i].b);
        }
    }
  }
  LL sum=0;
  for(LL i=0;i<n;i++) sum+=p[i];
  write(dp[sum]);
return 0;
}