# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58984 | red1108 | 요리 강좌 (KOI17_cook) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <stdio.h>
#include <deque>
using namespace std;
const int inf=2147483647;
vector<vector<int>> input,sum;
vector<int> dp[3010];
struct DATA{
int value;
int before;
}mindp[6010][3];
deque<pair<int,int>> dq[3010];
int n, m, row, limit, change, cant[3010];
int getmin(int i, int j)
{
if(i<row) return (-1)*change;
if(mindp[i][0].before!=cant[j]&&mindp[i][0].before!=j) return mindp[i][0].value;
else if(mindp[i][1].before!=cant[j]&&mindp[i][1].before!=j) return mindp[i][1].value;
else if(mindp[i][2].before!=cant[j]&&mindp[i][2].before!=j) return mindp[i][2].value;
}
void gang(int i, int j,int bac)
{
if(j<1) return;
if(mindp[i][0].value>=j)
{
mindp[i][2]=mindp[i][1];
mindp[i][1]=mindp[i][0];
mindp[i][0].value=j;
mindp[i][0].before=bac;
}
else if(mindp[i][1].value>=j)
{
mindp[i][2]=mindp[i][1];
mindp[i][1].value=j;
mindp[i][1].before=bac;
}
else if(mindp[i][2].value>=j)
{
mindp[i][2].value=j;
mindp[i][2].before=bac;
}
}
int main()
{
int i, j, ina;
scanf("%d %d %d %d %d", &n, &m, &row, &limit, &change);
input.push_back(vector<int>{0});
sum.push_back(vector<int>{0});
for(i=1;i<=n;i++)
{
input.push_back(vector<int>{0});
sum.push_back(vector<int>{0});
dp[i].push_back(0);
for(j=1;j<=m;j++)
{
scanf("%d",&ina);
input[i].push_back(ina);
sum[i].push_back(sum[i][j-1]+ina);
dp[i].push_back(0);
}
for(j=1;j<=m;j++) {sum[i].push_back(sum[i][sum[i].size()-1]);input[i].push_back(0);dp[i].push_back(0);}
}
for(i=1;i<=n;i++) scanf("%d", &cant[i]);
for(i=row;i<=m+row-1;i++)
{
for(j=0;j<3;j++) mindp[i][j]=inf*inf;
for(j=1;j<=n;j++)
{
while(!dq[j].empty()&&dq[j].front().second<i-limit+1) dq[j].pop_front();
pair<int,int> newput={getmin(i-row,j)+change,i-row+1};
if(i-row>=row||i<=limit){
if(i-row<row&&i<=limit) newput.second=1;
while(!dq[j].empty()&&(dq[j].back().first+sum[j][i]-sum[j][dq[j].back().second-1]>=newput.first+sum[j][i]-sum[j][i-row]||dq[j].back().second<i-limit+1)) dq[j].pop_back();
dq[j].push_back(newput);
}
dp[j][i]=dq[j].front().first+sum[j][i]-sum[j][dq[j].front().second-1];
gang(i,dp[j][i],j);
}
}
int ans=inf;
for(i=1;i<=n;i++)
{
for(j=m;j<=m+row-1;j++)
{
ans=dp[i][j]<ans&&dp[i][j]>0?dp[i][j]:ans;
}
}
printf("%d",ans);
}