oj.uz

Submission #130013

# Submission time Handle Problem Language Result Execution time Memory
130013 2019-07-13T18:52:59 Z qkxwsm Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 22852 KB 
#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 200013

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, M;
pll arr[MAXN];
ll ans = -LLINF;
ll sum = 0;
ordered_set<pll> ord;
multiset<ll> negative;
pii stor;

void ins(ll x)
{
	//if this will become among the top k, subtract kth and add this
	if (negative.find(x) != negative.end())
	{
		negative.erase(negative.find(x));
		return;
	}
	auto p = *ord.find_by_order(SZ(ord) - (M - 2));
	if (p.fi <= x)
	{
		sum -= p.fi;
		sum += x;
	}
	ord.insert({x, randomize(LLINF)});
}
void del(ll x)
{
	//if this is currently among the top k, subtract this and add the kth
	auto pp = ord.UB({x, -LLINF});
	if (pp -> fi != x)
	{
		negative.insert(x);
		return;
	}
	ord.erase(pp);
	auto p = *ord.find_by_order(SZ(ord) - (M - 2));
	if (p.fi <= x)
	{
		sum -= x;
		sum += p.fi;
	}
}
void move(pii p)
{
	while(stor.se < p.se)
	{
		stor.se++;
		ins(arr[stor.se - 1].se);
	}
	while(stor.se > p.se)
	{
		del(arr[stor.se - 1].se);
		stor.se--;
	}
	while(stor.fi < p.fi)
	{
		del(arr[stor.fi - 1].se);
		stor.fi++;
	}
	while(stor.fi > p.fi)
	{
		stor.fi--;
		ins(arr[stor.fi - 1].se);
	}
}

void solve(int L, int R, int optl, int optr)
{
	//it must start off containing L + 1..optl - 1
	if (L > R) return;
	int mid = (L + R) >> 1;
	ll best = -LLINF; int opt = -1;
	FOR(i, optl, optr + 1)
	{
		// cerr << "INS " << i - 1 << endl;
		move({mid + 2, i});
		if (i - mid + 1 >= M)
		{
			ll cur = arr[mid].se + 2 * arr[mid].fi + arr[i].se - 2 * arr[i].fi + sum;
			if (cur > best)
			{
				best = cur;
				opt = i;
			}
		}
	}
	ckmax(ans, best);
	solve(L, mid - 1, optl, opt);
	solve(mid + 1, R, opt, optr);
	//it must end off containing R...whatever
}

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 >> M;
	FOR(i, 0, N)
	{
		cin >> arr[i].se >> arr[i].fi;
	}
	sort(arr, arr + N);
	// FOR(i, 0, N)
	// {
	// 	cerr << arr[i].fi << ' ' << arr[i].se << endl;
	// }
	FOR(i, 0, M)
	{
		ord.insert({-LARGE, randomize(LLINF)});
	}
	sum = (-LARGE) * (M - 2);
	stor = {2, 1};
	solve(0, N - M, M - 1, N - 1);
	cout << ans << '\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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 3 ms 380 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 3 ms 380 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 11 ms 632 KB Output is correct
39 Correct 12 ms 632 KB Output is correct
40 Correct 9 ms 684 KB Output is correct
41 Correct 8 ms 632 KB Output is correct
42 Correct 7 ms 632 KB Output is correct
43 Correct 8 ms 632 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 11 ms 504 KB Output is correct
46 Correct 11 ms 508 KB Output is correct
47 Correct 13 ms 504 KB Output is correct
48 Correct 13 ms 504 KB Output is correct
49 Correct 10 ms 608 KB Output is correct
50 Correct 10 ms 632 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 9 ms 632 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 8 ms 632 KB Output is correct
55 Correct 6 ms 632 KB Output is correct
56 Correct 6 ms 632 KB Output is correct
57 Correct 7 ms 632 KB Output is correct
58 Correct 6 ms 632 KB Output is correct
59 Correct 9 ms 504 KB Output is correct
60 Correct 10 ms 504 KB Output is correct
61 Correct 9 ms 504 KB Output is correct
62 Correct 8 ms 504 KB Output is correct
63 Correct 8 ms 632 KB Output is correct
64 Correct 9 ms 632 KB Output is correct
65 Correct 11 ms 504 KB Output is correct
66 Correct 10 ms 504 KB Output is correct
67 Correct 11 ms 504 KB Output is correct
68 Correct 10 ms 632 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 632 KB Output is correct
71 Correct 11 ms 504 KB Output is correct
72 Correct 8 ms 504 KB Output is correct
73 Correct 10 ms 632 KB Output is correct
74 Correct 4 ms 632 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 3 ms 380 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 11 ms 632 KB Output is correct
39 Correct 12 ms 632 KB Output is correct
40 Correct 9 ms 684 KB Output is correct
41 Correct 8 ms 632 KB Output is correct
42 Correct 7 ms 632 KB Output is correct
43 Correct 8 ms 632 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 11 ms 504 KB Output is correct
46 Correct 11 ms 508 KB Output is correct
47 Correct 13 ms 504 KB Output is correct
48 Correct 13 ms 504 KB Output is correct
49 Correct 10 ms 608 KB Output is correct
50 Correct 10 ms 632 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 9 ms 632 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 8 ms 632 KB Output is correct
55 Correct 6 ms 632 KB Output is correct
56 Correct 6 ms 632 KB Output is correct
57 Correct 7 ms 632 KB Output is correct
58 Correct 6 ms 632 KB Output is correct
59 Correct 9 ms 504 KB Output is correct
60 Correct 10 ms 504 KB Output is correct
61 Correct 9 ms 504 KB Output is correct
62 Correct 8 ms 504 KB Output is correct
63 Correct 8 ms 632 KB Output is correct
64 Correct 9 ms 632 KB Output is correct
65 Correct 11 ms 504 KB Output is correct
66 Correct 10 ms 504 KB Output is correct
67 Correct 11 ms 504 KB Output is correct
68 Correct 10 ms 632 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 632 KB Output is correct
71 Correct 11 ms 504 KB Output is correct
72 Correct 8 ms 504 KB Output is correct
73 Correct 10 ms 632 KB Output is correct
74 Correct 4 ms 632 KB Output is correct
75 Correct 3791 ms 22852 KB Output is correct
76 Execution timed out 4010 ms 20796 KB Time limit exceeded
77 Halted 0 ms 0 KB -