Submission #341702

#	Time	Username	Problem	Language	Result	Execution time	Memory
341702		phathnv	Popeala (CEOI16_popeala)	C++11	8 / 100	4 ms	492 KiB

popeala

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int T = 4001;
const int N = 51;
const int S = 51;
const int INF = 2e9 + 10;

int n, t, s, p[N], cost[N][N], dp[S][T];
string a[N];

void ReadInput(){
    cin >> n >> t >> s;
    for(int i = 1; i <= t; i++)
        cin >> p[i];
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] = '*' + a[i];
    }
}

int Cost(int l, int r){
    int sum = 0, cnt = 0;
    for(int i = l; i <= r; i++)
        sum += p[i];
    for(int i = 1; i <= n; i++){
        bool flag = 0;
        for(int j = l; j <= r; j++)
            if (a[i][j] == '0'){
                flag = 1;
                break;
            }
        if (!flag)
            cnt++;
    }
    return sum * cnt;
}

void Solve(){
    for(int i = 1; i <= t; i++)
        dp[1][i] = Cost(1, i);
    for(int i = 2; i <= s; i++)
        for(int j = i; j <= t; j++){
            dp[i][j] = INF;
            for(int k = i; k <= j; k++)
                dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] + Cost(k, j));
        }

    for(int i = 1; i <= s; i++)
        cout << dp[i][t] << '\n';
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ReadInput();
    Solve();
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 74