Submission #536869

#	Time	Username	Problem	Language	Result	Execution time	Memory
536869		maomao90	Popeala (CEOI16_popeala)	C++17	17 / 100	2092 ms	716 KiB

popeala

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

#define INF 2000000005
#define LINF 1000000000000000005ll
#define MAXT 20005
#define MAXN 55

int n, t, s;
int p[MAXT];
string g[MAXN];
int dp[MAXN][MAXT];
bool blk[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> t >> s;
    REP (i, 0, t) {
        cin >> p[i];
    }
    REP (i, 0, n) {
        cin >> g[i];
    }
    REP (i, 1, s + 1) {
        REP (j, 0, t) {
            int ac = n, sm = 0;
            dp[i][j] = INF;
            memset(blk, 0, sizeof blk);
            RREP (k, j, i - 1) {
                sm += p[k];
                REP (l, 0, n) {
                    if (blk[l]) continue;
                    if (g[l][k] == '0') {
                        blk[l] = 1;
                        ac--;
                    }
                }
                if (i != 1) {
                    mnto(dp[i][j], dp[i - 1][k - 1] + ac * sm);
                } else if (k == 0) {
                    mnto(dp[i][j], ac * sm);
                }
            }
            cerr << i << ' ' << j << ": " << dp[i][j] << '\n';
        }
        cout << dp[i][t - 1] << '\n';
    }
    return 0;
}

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