oj.uz

Submission #963720

# Submission time Handle Problem Language Result Execution time Memory
963720 2024-04-15T14:13:20 Z LucaIlie Popeala (CEOI16_popeala) C++17
26 / 100
 2000 ms 10660 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 50;
const int MAX_T = 50000;
const int MAX_S = 50;
const long long INF = 1e15;

bool solved[MAX_N][MAX_T + 1];
int points[MAX_T + 1], last0[MAX_N][MAX_T + 1];
long long dp[MAX_T + 1][MAX_S + 1], solvers[MAX_T + 1];

int main() {
    int n, t, s;

    cin >> n >> t >> s;
    for ( int i = 1; i <= t; i++ ) {
        cin >> points[i];
        points[i] += points[i - 1];
    }
    for ( int j = 0; j < n; j++ ) {
        for ( int i = 1; i <= t; i++ ) {
            char ch;
            cin >> ch;
            solved[j][i] = ch - '0';
            last0[j][i] = (!solved[j][i] ? i : last0[j][i]);
            solvers[i] += ((long long)solved[j][i] << j);
        }
    }

    for ( int i = 0; i <= t; i++ ) {
        for ( int k = 0; k <= s; k++ )
            dp[i][k] = INF;
    }
    dp[0][0] = 0;
    for ( int i = 1; i <= t; i++ ) {
        vector<int> pos;
        for ( int j = 0; j < n; j++ )
            pos.push_back( last0[j][i] );
        sort( pos.begin(), pos.end() );
        reverse( pos.begin(), pos.end() );

        long long mask = (1LL << n) - 1;
        for ( int j = i - 1; j >= 0; j-- ) {
            mask &= solvers[j + 1];

            int c = 0;
            for ( int i = 0; i < n; i++ )
                c += ((mask >> i) & 1);
            for ( int k = 1; k <= s; k++ )
                dp[i][k] = min( dp[i][k], dp[j][k - 1] + (long long)c * (points[i] - points[j]) );
        }
    }

    for ( int k = 1; k <= s; k++ )
        cout << dp[t][k] << "\n";

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7004 KB Output is correct
2 Correct 11 ms 4956 KB Output is correct
3 Correct 11 ms 5012 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 7228 KB Output is correct
2 Correct 355 ms 5468 KB Output is correct
3 Correct 663 ms 5936 KB Output is correct

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 11 ms 7004 KB Output is correct
4 Correct 11 ms 4956 KB Output is correct
5 Correct 11 ms 5012 KB Output is correct
6 Correct 217 ms 7228 KB Output is correct
7 Correct 355 ms 5468 KB Output is correct
8 Correct 663 ms 5936 KB Output is correct
9 Correct 1734 ms 10660 KB Output is correct
10 Execution timed out 2048 ms 9052 KB Time limit exceeded
11 Halted 0 ms 0 KB -