oj.uz

Submission #126255

# Submission time Handle Problem Language Result Execution time Memory
126255 2019-07-07T10:30:40 Z johutha Popeala (CEOI16_popeala) C++14
17 / 100
 2000 ms 2424 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

#define int int64_t

using namespace std;

struct dpstruct
{
    vector<vector<int>> table;
    vector<vector<int>> contprefsum;
    vector<int> tasks;

    int cont, tcs, stsks;

    int getscore(int from, int end)
    {
        int tms = 0;
        for (int i = 0; i < cont; i++)
        {
            if ((contprefsum[i][end] - contprefsum[i][from]) == 0) tms++;
        }
        int pts = (tasks[end] - tasks[from]);
        return tms * pts;
    }

    void init(const vector<int> &p, const vector<string> &ip)
    {
        contprefsum.resize(cont, vector<int>(tcs + 1, 0));
        for (int i = 0; i < cont; i++)
        {
            int curr = 0;
            for (int j = 1; j <= tcs; j++)
            {
                curr += (ip[i][j - 1] == '0');
                contprefsum[i][j] = curr;
            }
        }
        tasks.resize(tcs + 1, 0);
        int curr = 0;
        for (int i = 1; i <= tcs; i++)
        {
            curr += p[i - 1];
            tasks[i] = curr;
        }
    }

    void calculate()
    {
        table.resize(tcs + 1, vector<int>(stsks + 1, (int)1e12));
        table[0][0] = 0;

        for (int i = 1; i <= tcs; i++)
        {
            for (int j = 1; j <= stsks; j++)
            {
                int mmin = 1e12;
                for (int c = 0; c < i; c++)
                {
                    mmin = min(mmin, table[c][j - 1] + getscore(c, i));
                }
                table[i][j] = mmin;
            }
        }

        //print();

        for (int i = 1; i <= stsks; i++)
        {
            cout << table[tcs][i] << "\n";
        }
    }

    void print()
    {
        cout << "\n";
        for (auto a : table) {for (auto g : a) cout << g << " "; cout << "\n";}
        cout << "\n";
        for (auto a : contprefsum) {for (auto g : a) cout << g << " "; cout << "\n";}
        cout << "\n";
        for (auto a : tasks) cout << a << " ";
        cout << "\n";
    }
};

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    dpstruct dps;

    cin >> dps.cont >> dps.tcs >> dps.stsks;

    vector<int> pnts(dps.tcs);
    for (int i = 0; i < dps.tcs; i++)
    {
        cin >> pnts[i];
    }

    vector<string> s(dps.cont);
    for (int i = 0; i < dps.cont; i++)
    {
        cin >> s[i];
    }
    dps.init(pnts, s);
    dps.calculate();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 896 KB Output is correct
2 Correct 451 ms 860 KB Output is correct
3 Correct 449 ms 888 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2047 ms 2424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 472 ms 896 KB Output is correct
4 Correct 451 ms 860 KB Output is correct
5 Correct 449 ms 888 KB Output is correct
6 Execution timed out 2047 ms 2424 KB Time limit exceeded
7 Halted 0 ms 0 KB -