oj.uz

Submission #108058

# Submission time Handle Problem Language Result Execution time Memory
108058 2019-04-27T04:35:35 Z qkxwsm K blocks (IZhO14_blocks) C++14
100 / 100
 329 ms 86416 KB 
//clever
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '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);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

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

#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 100013
#define MAXK 113

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, K;
int arr[MAXN];
int dp[MAXK][MAXN];
vector<pair<int, pii> > best[MAXK];
//smallest dp + sum, current cost, current dp

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> K;
	FOR(i, 0, N) cin >> arr[i];
	int mx = 0;
	FOR(i, 0, K + 1)
	{
		FOR(j, 0, N + 1)
		{
			dp[i][j] = INF;
		}
	}
	FOR(i, 0, N)
	{
		ckmax(mx, arr[i]);
		dp[1][i + 1] = mx;
	}
	FOR(i, 0, N)
	{
		FOR(j, 2, K + 1)
		{
			// cerr << "hi " << i << ' ' << j << endl;
			//insert the thing from j - 1
			int val = dp[j - 1][i];
			while(!best[j - 1].empty())
			{
				auto p = best[j - 1].back();
				if (p.se.fi > arr[i]) break;
				best[j - 1].pop_back();
				ckmin(val, p.se.se);
			}
			dp[j][i + 1] = val + arr[i];
			if (!best[j - 1].empty()) ckmin(dp[j][i + 1], best[j - 1].back().fi);
			best[j - 1].PB({dp[j][i + 1], {arr[i], val}});
			// cerr << "dp " << j << ' ' << i + 1 << " = " << dp[j][i + 1] << endl;
		}
	}
	cout << dp[K][N] << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 4 ms 964 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1536 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 12 ms 2304 KB Output is correct
4 Correct 83 ms 14564 KB Output is correct
5 Correct 229 ms 41080 KB Output is correct
6 Correct 25 ms 3072 KB Output is correct
7 Correct 110 ms 19536 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 15 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 30 ms 4992 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 8 ms 1664 KB Output is correct
17 Correct 9 ms 1152 KB Output is correct
18 Correct 11 ms 2304 KB Output is correct
19 Correct 80 ms 14680 KB Output is correct
20 Correct 234 ms 41124 KB Output is correct
21 Correct 21 ms 3072 KB Output is correct
22 Correct 117 ms 19448 KB Output is correct
23 Correct 20 ms 2304 KB Output is correct
24 Correct 32 ms 5760 KB Output is correct
25 Correct 238 ms 41080 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 33 ms 9592 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 11 ms 2796 KB Output is correct
31 Correct 8 ms 1152 KB Output is correct
32 Correct 16 ms 3712 KB Output is correct
33 Correct 108 ms 29432 KB Output is correct
34 Correct 329 ms 86416 KB Output is correct
35 Correct 21 ms 4540 KB Output is correct
36 Correct 154 ms 39748 KB Output is correct
37 Correct 4 ms 684 KB Output is correct
38 Correct 25 ms 4992 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 3 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 2 ms 384 KB Output is correct