oj.uz

Submission #619386

# Submission time Handle Problem Language Result Execution time Memory
619386 2022-08-02T11:34:58 Z drdilyor Popeala (CEOI16_popeala) C++17
0 / 100
 1216 ms 4436 KB 
#include <bits/stdc++.h>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define sz(a) ((int)(a).size())
using namespace std;
using ll = long long;
const int INF = 2e9+1;
const ll INFL = 1e18;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }
const int N = 2e4, LOGN = 17, K = 50, MOD = 1e9+7;

int solve() {
    int n, t, s;
    cin >> n >> t >> s;
    if (!cin) return 1;

    vector<int> pts(t);
    for (auto& i : pts) {cin >> i;}
    vector<string> table(n);
    for (auto& i : table) {cin >> i;}
    vector<ll> res(t);
    for (int tc = 0; tc < t; tc++) {
        for (int c = 0; c < n; c++) {
            res[tc] |= (ll)(table[c][tc] != '0') << c;
        }
    }

    int memo[N][K+1];
    memset(memo, -1, sizeof(memo));
    function<int(int,int)> dp = [&](int i, int g) {
        if (!g) return i == t ? 0 : INF;
        if (i >= t) return INF;
        if (memo[i][g] != -1) return memo[i][g];

        int mn = INF;
        int score = 0;
        ll solved = (1LL << n) - 1;
        for (int j = i; j < t; j++) {
            score += pts[j];
            solved &= res[j];
            int count = __builtin_popcount(solved);
            mn = min(mn, score * count + dp(j+1, g-1));
        }
        return memo[i][g] = mn;
    };
    for (int k = 1; k <= s; k++) {
        cout << dp(0, k) << '\n';
    }
    
    return 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    #ifdef ONPC
    t = 10000;
    #endif
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }
    return 0;
}

/*
     █████               █████  ███  ████                               
    ▒▒███               ▒▒███  ▒▒▒  ▒▒███                               
  ███████  ████████   ███████  ████  ▒███  █████ ████  ██████  ████████ 
 ███▒▒███ ▒▒███▒▒███ ███▒▒███ ▒▒███  ▒███ ▒▒███ ▒███  ███▒▒███▒▒███▒▒███
▒███ ▒███  ▒███ ▒▒▒ ▒███ ▒███  ▒███  ▒███  ▒███ ▒███ ▒███ ▒███ ▒███ ▒▒▒ 
▒███ ▒███  ▒███     ▒███ ▒███  ▒███  ▒███  ▒███ ▒███ ▒███ ▒███ ▒███     
▒▒████████ █████    ▒▒████████ █████ █████ ▒▒███████ ▒▒██████  █████    
 ▒▒▒▒▒▒▒▒ ▒▒▒▒▒      ▒▒▒▒▒▒▒▒ ▒▒▒▒▒ ▒▒▒▒▒   ▒▒▒▒▒███  ▒▒▒▒▒▒  ▒▒▒▒▒     
                                            ███ ▒███                    
                                           ▒▒██████                     
                                            ▒▒▒▒▒▒
*/

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Incorrect 2 ms 4308 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 4308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1216 ms 4436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Incorrect 2 ms 4308 KB Output isn't correct
3 Halted 0 ms 0 KB -