Submission #65223

#	Time	Username	Problem	Language	Result	Execution time	Memory
65223		qkxwsm	Popeala (CEOI16_popeala)	C++17	0 / 100	10 ms	4248 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];
int pre[MAXN][MAXM];
ll dp[MAXN][MAXM];
vector<int> zeroes[MAXN];
vector<int> pos[MAXM];

ll cost(int L, int R)
{
        R--;
        ll res = 0;
        for (int i = 0; i < N; i++)
        {
                if (pre[i][R + 1] - pre[i][L] == (R - L + 1))
                {
                        res += (pref[R + 1] - pref[L]);
                }
        }
        return res;
}

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';
                        pre[i][j + 1] = pre[i][j] + ok[i][j];
                        if (!ok[i][j]) zeroes[i].PB(j);
                }
        }
        for (int i = 0; i <= M; i++)
        {
                for (int j = 0; j < N; j++)
                {
                        if (zeroes[j].empty() || zeroes[j][0] >= i)
                        {
                                continue;
                        }
                        //cost(x - 1, j) != cost(x, j)
                        int idx = LB(zeroes[j].begin(), zeroes[j].end(), i) - zeroes[j].begin() - 1;
                        for (int k = zeroes[j][idx] + 1; k < i; k++) assert(pre[j][i + 1] - pre[j][k] == (i + 1 - k));
                        pos[i].PB(zeroes[j][idx] + 1);
                        //u want an index <i
                }
                pos[i].PB(0); pos[i].PB(1);
                pos[i].PB(i);
                sort(pos[i].begin(), pos[i].end());
                pos[i].erase(unique(pos[i].begin(), pos[i].end()), pos[i].end());
        }
        for (int i = 0; i < M; i++)
        {
                dp[0][i] = LLINF;
        }
        dp[0][0] = 0;
        for (int i = 1; i <= S; i++)
        {
                for (int j = 0; j <= M; j++)
                {
                        dp[i][j] = LLINF;
                        //there's actually only 50 possible costs so you want to find the locations!
                        // for (int k : pos[j])
                        // {
                        //         if (k >= j) break;
                        //         // if (k >= j) cerr << k << ' ' << j << endl;
                        //         // assert(0 <= k && k < j);
                        //         ckmin(dp[i][j], dp[i - 1][k] + cost(k, j));
                        // }
                        // for (int k = 0; k < j; k++)
                        // {
                        //         ckmin(dp[i][j], dp[i - 1][k] + cost(k, j));
                        // }
                        for (int k = 0; k < pos[j].size(); k++)
                        {
                                if (pos[j][k] >= j) continue;
                                for (int m = pos[j][k]; m < pos[j][k + 1]; m++)
                                {
                                        ckmin(dp[i][j], dp[i - 1][m] + cost(m, j));
                                        // if (m != pos[j][k]) assert(cost(m, j) == cost(m - 1, j));
                                }
                                // int v = pos[j][k];
                                // ckmin(dp[i][j], dp[i - 1][v] + cost(v, j));
                        }
                }
                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:236:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int k = 0; k < pos[j].size(); k++)
                                         ~~^~~~~~~~~~~~~~~
popeala.cpp:175:11: 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:176:11: 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: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 74