Codeforces Round #565 DIV3 F問題
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N, K, C, D;
int d[3][2d5], ds[3];
ll dp[10], nx[10];
{
int i, j, k, x, y, z;
ll res, tmp, mx;
rd(N);
rep(i,1,10) dp[i] = -ll_inf;
rep(N){
rep(i,10) nx[i] = dp[i];
rd(K);
rep(i,3) ds[i] = 0;
rep(K){
rd(C--,D);
d[C][ds[C]++] = D;
}
rep(i,3) sort(d[i], d[i]+ds[i]);
rep(x,4) rep(y,3) rep(z,2){
if(x+2y+3z > 3) continue;
if(x > ds[0] || y > ds[1] || z > ds[2]) continue;
tmp = mx = 0;
k = x + y + z;
rep(i,x) tmp += d[0][ds[0]-1-i], mx >?= d[0][ds[0]-1-i];
rep(i,y) tmp += d[1][ds[1]-1-i], mx >?= d[1][ds[1]-1-i];
rep(i,z) tmp += d[2][ds[2]-1-i], mx >?= d[2][ds[2]-1-i];
rep(i,10) nx[(i+k)%10] >?= dp[i] + if[i+k>=10, mx + ] tmp;
}
rep(i,10) dp[i] = nx[i];
}
res = max(dp(10));
wt(res);
}
Current time: 2024年03月28日22時13分41秒
Last modified: 2019年08月22日00時50分00秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF565 CF_Div3_F
トップページに戻る
Logged in as: unknown user (not login)