# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154496 | arnold518 | Popeala (CEOI16_popeala) | C++14 | 1215 ms | 19400 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 50;
const int MAXT = 20000;
const ll INF = 1e15;
int N, T, S, P[MAXT+10], R[MAXN+10][MAXT+10];
vector<int> V[MAXT+10];
int cnt[MAXN+10];
ll dp[MAXN+10][MAXT+10], A[MAXT+10];
int main()
{
int i, j, k, p;
scanf("%d%d%d", &N, &T, &S);
for(i=1; i<=T; i++) scanf("%d", &P[i]), P[i]+=P[i-1];
for(i=1; i<=N; i++) for(j=1; j<=T; j++) scanf("%1d", &R[i][j]);
for(i=1; i<=T; i++)
{
for(j=1; j<=N; j++) if(R[j][i]==0) cnt[j]=i;
for(j=1; j<=N; j++) V[i].push_back(cnt[j]);
V[i].push_back(i); V[i].push_back(0);
sort(V[i].begin(), V[i].end());
}
for(i=0; i<=S; i++) for(j=0; j<=T; j++) dp[i][j]=INF; dp[0][0]=0;
for(i=1; i<=S; i++)
{
for(k=0; k<=N; k++)
{
for(j=0; j<=T; j++) A[j]=dp[i-1][j]-k*P[j];
deque<int> DQ;
for(j=1; j<=T; j++)
{
if(V[j][k]==V[j][k+1]) continue;
while(!DQ.empty() && DQ.front()<V[j][k]) DQ.pop_front();
if(DQ.empty()) p=V[j][k];
else p=DQ.back()+1;
for(; p<V[j][k+1]; p++)
{
while(!DQ.empty() && A[DQ.back()]>=A[p]) DQ.pop_back();
DQ.push_back(p);
}
dp[i][j]=min(dp[i][j], A[DQ.front()]+k*P[j]);
}
}
}
for(i=1; i<=S; i++) printf("%lld\n", dp[i][T]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |