传送门
题意
m u r o n g l i n muronglin muronglin是个学渣,考试的时候,她一道题也不会做
她的左右桌分别是学霸 c h h o k m a h chhokmah chhokmah和学霸 l u k e l i n lukelin lukelin,虽然学霸并不是题题都会做,但他们做了的题一定都对
现在 m u r o n g l i n muronglin muronglin想要作弊,但是为了不被监考员抓住,她最多偷看 p p p次,一次能看连续的 k k k道题
给定 n n n和 l a la la和 l b lb lb,分别为题目总数, c h h o k m a h chhokmah chhokmah做出题目数和 l u k e l i n lukelin lukelin做出题目数,再给出两位学霸做出题目序列,问 m u r o n g l i n muronglin muronglin最多能偷看到几道题的答案
分析
我们用 f [ i ] [ j ] [ x ] [ y ] f[i][j][x][y] f[i][j][x][y]表示到第 i i i题,用了 j j j次机会的情况下, A A A同学还能再看 x x x题, y y y同学还能再看 y y y题的情况,然后就可以愉快的进行状态转移了
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int f[2][N][60][60];
int n,p,k;
int sta[N],stb[N];
void upd(int &x,int y){
x = max(x,y);
}
int main() {
read(n),read(p),read(k);
int num;
read(num);
while(num--){
int x;
read(x);
sta[x] = 1;
}
read(num);
while(num--){
int x;
read(x);
stb[x] = 1;
}
if(p >= 2 * (n + k - 1) / k){
int res = 0;
for(int i = 1;i <= n;i++) res += sta[i] | stb[i];
di(res);
return 0;
}
memset(f[0],-1,sizeof f[0]);
f[0][0][0][0] = 0;
int ans = 0;
for(int i = 1;i <= n;i++){
int now = i & 1,pre = (i - 1) & 1;
memset(f[now],-1,sizeof f[now]);
for(int j = 0;j <= p;j++)
for(int x = 0;x <= k;x++)
for(int y = 0;y <= k;y++){
if(j < p){
int t = f[pre][j][x][y];
if(x && t != -1){
upd(f[now][j + 1][x - 1][k - 1],max(t,0) + (sta[i] | stb[i]));
ans = max(ans,f[now][j + 1][x - 1][k - 1]);
}
else{
upd(f[now][j + 1][0][k - 1],max(t,0) + stb[i]);
ans = max(ans,f[now][j + 1][0][k - 1]);
}
if(y && t != -1){
upd(f[now][j + 1][k - 1][y - 1],max(t,0) + (sta[i] | stb[i]));
ans = max(ans,f[now][j + 1][k - 1][y - 1]);
}
else{
upd(f[now][j + 1][k - 1][0],max(t,0) + sta[i]);
ans = max(ans,f[now][j + 1][k - 1][0]);
}
}
if(f[pre][j][x][y] != -1){
int res = 0;
if(x) res |= sta[i];
if(y) res |= stb[i];
upd(f[now][j][max(x - 1,0)][max(y - 1,0)],f[pre][j][x][y] + res);
ans = max(f[now][j][max(x - 1,0)][max(y - 1,0)],ans);
}
}
}
di(ans);
return 0;
}