Submission #65489

#	Time	Username	Problem	Language	Result	Execution time	Memory
65489		qkxwsm	Popeala (CEOI16_popeala)	C++17	17 / 100	2065 ms	2388 KiB

popeala

/*
PROG: source
LANG: C++11
_____
.'     '.
/  0   0  \
|     ^     |
|  \     /  |
\  '---'  /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
        T input = 0;
        bool negative = false;
        char c = ' ';
        while (c < '-')
        {
                c = getchar();
        }
        if (c == '-')
        {
                negative = true;
                c = getchar();
        }
        while (c >= '0')
        {
                input = input * 10 + (c - '0');
                c = getchar();
        }
        if (negative)
        {
                input = -input;
        }
        x = input;
}
template<class T>
void printi(T output)
{
        if (output == 0)
        {
                putchar('0');
                return;
        }
        if (output < 0)
        {
                putchar('-');
                output = -output;
        }
        int aout[20];
        int ilen = 0;
        while(output)
        {
                aout[ilen] = ((output % 10));
                output /= 10;
                ilen++;
        }
        for (int i = ilen - 1; i >= 0; i--)
        {
                putchar(aout[i] + '0');
        }
        return;
}
template<class T>
void ckmin(T &a, T b)
{
        a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
        a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
        return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
        return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
        return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 51
#define MAXM 20013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, M, S;
ll arr[MAXM];
ll pref[MAXM];
int ok[MAXN][MAXM];
ll dp[MAXN][MAXM];
int pt[MAXN];
ll seg[2 * MAXM];
ll lazy[2 * MAXM];
ll DNE = LLINF;

void init()
{
        int sz = (1 << (33 - __builtin_clz(M)));
        for (int i = 0; i <= sz; i++)
        {
                seg[i] = 0;
                lazy[i] = 0;
        }
}
ll comb(ll a, ll b)
{
        return min(a, b);
}
void down(int w, int L, int R)
{
        seg[w] += lazy[w];
        if (L != R)
        {
                lazy[2 * w] += lazy[w];
                lazy[2 * w + 1] += lazy[w];
        }
        lazy[w] = 0;
        return;
}
void update(int w, int L, int R, int a, int b, ll val)
{
        down(w, L, R);
        if (b < L || R < a)
        {
                return;
        }
        if (R <= b && a <= L)
        {
                seg[w] += val;
                if (L != R)
                {
                        lazy[2 * w] += val;
                        lazy[2 * w + 1] += val;
                }
                return;
        }
        int mid = (L + R)/2;
        update(2 * w, L, mid, a, b, val);
        update(2 * w + 1, mid + 1, R, a, b, val);
        seg[w] = comb(seg[2 * w] + lazy[2 * w], seg[2 * w + 1] + lazy[2 * w + 1]);
        return;
}
ll query(int w, int L, int R, int a, int b)
{
        down(w, L, R);
        if (b < L || R < a)
        {
                return DNE;
        }
        if (a <= L && R <= b)
        {
                return seg[w];
        }
        int mid = (L + R)/2;
        return comb(query(2 * w, L, mid, a, b), query(2 * w + 1, mid + 1, R, a, b));
}

int32_t main()
{
        ios_base::sync_with_stdio(0);
        srand(time(0));
        //	cout << fixed << setprecision(10);
        //	cerr << fixed << setprecision(10);
        if (fopen("input.in", "r"))
        {
                freopen ("input.in", "r", stdin);
                freopen ("output.out", "w", stdout);
        }
        cin >> N >> M >> S;
        for (int i = 0; i < M; i++)
        {
                cin >> arr[i];
                pref[i + 1] = pref[i] + arr[i];
        }
        for (int i = 0; i < N; i++)
        {
                string temps;
                cin >> temps;
                for (int j = 0; j < M; j++)
                {
                        ok[i][j] = temps[j] - '0';
                }
        }
        for (int i = 0; i < M; i++)
        {
                dp[0][i] = LARGE;
        }
        dp[0][0] = 0;
        for (int i = 1; i <= S; i++)
        {
                for (int j = 0; j < N; j++)
                {
                        pt[j] = 0;
                }
                init();
                for (int j = 0; j <= M; j++)
                {
                        update(1, 0, M, j, j, dp[i - 1][j]);
                }
                dp[i][0] = LARGE;
                for (int j = 1; j <= M; j++)
                {
                        dp[i][j] = LARGE;
                        // for (int k = 0; k < j; k++)
                        // {
                        //         ckmin(dp[i][j], dp[i - 1][k] + cost(k, j));
                        // }
                        for (int k = 0; k < N; k++)
                        {
                                update(1, 0, M, pt[k], j - 1, arr[j - 1]);
                                // cerr << "update " << pt[k] << ' ' << j - 1 << ' ' << arr[j - 1] << endl;
                                if (!ok[k][j - 1])
                                {
                                        for (; pt[k] < j; pt[k]++)
                                        {
                                                update(1, 0, M, pt[k], pt[k], -(pref[j] - pref[pt[k]]));
                                        }
                                }
                        }
                        dp[i][j] = query(1, 0, M, 0, j - 1);
                        // cerr << dp[i][j] << ' ';
                }
                // cerr << endl;
                cout << dp[i][M] << '\n';
        }
        //	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
        return 0;
}

Compilation message (stderr)

popeala.cpp: In function 'int32_t main()':
popeala.cpp:224:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("input.in", "r", stdin);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
popeala.cpp:225:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("output.out", "w", stdout);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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