原题链接:https://ac.nowcoder.com/acm/contest/9986/G
题意
分析
数据只有20,马上想到状压dp,用dp[state]来表示状态为state时最大的返回值,state压缩的二进制中1代表已经选过的点,0代表没有选过的点,直接转移就可以。
题目有一个坑点,最大可以达到2020 ,比赛中被坑了好多次,用__int128就可以。
Code
#include <bits/stdc++.h>
using namespace std;
//#define ACM_LOCAL
#define fi first
#define se second
#define il inline
#define re register
typedef long long ll;
typedef pair<int, int> PII;
typedef unsigned long long ull;
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int INF = 1e9 + 5;
const double eps = 1e-5;
const int MOD = 998244353;
__int128 a[N], b[N];
__int128 dp[1 << 21];
inline __int128 read()
{
int X=0,w=0; char ch=0;
while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
return w?-X:X;
}
inline void print(__int128 x)
{
if(x<0){putchar('-');x=-x;}
if(x>9) print(x/10);
putchar(x%10+'0');
}
void solve() {
__int128 n, m;
n = read(), m = read();
for (int i = 0; i < n; i++) {
a[i] = read(), b[i] = read();
}
for (int i = 0; i < n; i++) dp[1 << i] = a[i] * m + b[i];
for (int i = 0; i < 1 << n; i++) {
for (int j = 0; j < n; j++) {
if (!(i >> j & 1)) {
dp[i | (1 << j)] = max(dp[i | (1 << j)], dp[i] * a[j] + b[j]);
}
}
}
__int128 ans = dp[(1 << n) - 1];
print(ans);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ACM_LOCAL
freopen("input", "r", stdin);
freopen("output", "w", stdout);
#endif
solve();
}