oj.uz

Submission #471078

# Submission time Handle Problem Language Result Execution time Memory
471078 2021-09-07T02:43:49 Z jwvg0425 Cake 3 (JOI19_cake3) C++17
100 / 100
 959 ms 114264 KB 
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

template<typename T>
class PST
{
	struct Node
	{
		int lidx, ridx;
		T value;

		Node() :value(T()), lidx(-1), ridx(-1) {}
	};

public:
	class iterator
	{
	public:
		iterator(PST<T>& p, int n)
			: pst(p), node(n) {}

		iterator& operator=(const iterator& other)
		{
			assert(&pst == &other.pst);
			node = other.node;
			return *this;
		}

		T get() const
		{
			return pst.node[node].value;
		}

		iterator left() const
		{
			return iterator(pst, pst.node[node].lidx);
		}

		iterator right() const
		{
			return iterator(pst, pst.node[node].ridx);
		}

	private:
		PST<T>& pst;
		int node;
	};

	template<typename M>
	PST(int n_, const M& m) : n(n_), merge(m) {}

	iterator it(int r)
	{
		return iterator(*this, root[r]);
	}

	int rmost() const
	{
		return n;
	}

	int update(int idx, const T& value)
	{
		return update((int)root.size() - 1, idx, value);
	}

	int update(int pre, int idx, const T& value)
	{
		root.emplace_back(_update(root[pre], idx, value, 0, n));
		return (int)root.size() - 1;
	}

	T query(int k, int start, int end)
	{
		return _query(root[k], start, end, 0, n);
	}

	void init()
	{
		root.push_back(init(0, n));
	}

private:
	int init(int start, int end)
	{
		int idx = node.size();
		node.emplace_back();

		if (start != end)
		{
			int mid = (start + end) / 2;

			node[idx].lidx = init(start, mid);
			node[idx].ridx = init(mid + 1, end);
		}
		return idx;
	}

	int _update(int prev, int idx, const T& value, int start, int end)
	{
		if (idx < start || idx > end)
			return prev;

		int nidx = node.size();
		node.emplace_back();

		if (start == end)
			node[nidx].value = value;
		else
		{
			int mid = (start + end) / 2;
			node[nidx].lidx = _update(node[prev].lidx, idx, value, start, mid);
			node[nidx].ridx = _update(node[prev].ridx, idx, value, mid + 1, end);
			node[nidx].value = merge(node[node[nidx].lidx].value, node[node[nidx].ridx].value);
		}

		return nidx;
	}

	T _query(int idx, int start, int end, int left, int right)
	{
		if (start <= left && right <= end)
			return node[idx].value;

		int mid = (left + right) / 2;

		if (mid + 1 > end)
			return _query(node[idx].lidx, start, end, left, mid);

		if (mid < start)
			return _query(node[idx].ridx, start, end, mid + 1, right);

		return merge(_query(node[idx].lidx, start, end, left, mid),
			_query(node[idx].ridx, start, end, mid + 1, right));
	}

	using Merge = function<T(const T&, const T&)>;
	Merge merge;
	vector<int> root;
	vector<Node> node;
	int n;
};

int n, m;
auto tree = PST<ii64>(200005, [](const ii64& l, const ii64& r) { return ii64(l.xx + r.xx, l.yy + r.yy); });
vector<ii64> cakes;

i64 get(int l, int r)
{
	if (r - l < m - 1)
		return  -(1ll << 60) + r + 1;

	i64 res = cakes[l].xx + cakes[r].xx - 2 * (cakes[r].yy - cakes[l].yy);
	auto lx = tree.it(l + 1);
	auto rx = tree.it(r);

	int s = 0, e = 200005;
	int need = m - 2;

	while (need > 0)
	{
		if (s == e)
		{
			res += rx.get().xx - lx.get().xx;
			break;
		}

		int m = (s + e) / 2;
		auto lr = lx.right();
		auto rr = rx.right();

		if (rr.get().yy - lr.get().yy >= need)
		{
			lx = lr;
			rx = rr;
			s = m + 1;
			continue;
		}

		need -= rr.get().yy - lr.get().yy;
		res += rr.get().xx - lr.get().xx;
		lx = lx.left();
		rx = rx.left();
		e = m;
	}

	return res;
}

i64 big[200005];

void f(int y1, int y2, int x1, int x2)
{
    if (y1 > y2 || x1 > x2)
        return;

    i64 ans = -(1ll << 60);
    i64 ansp = x1;

    int y = (y1 + y2) / 2;

    for (int i = x1; i <= x2; i++)
    {
		i64 v = get(y, i);
        if (v > ans)
        {
            ans = v;
            ansp = i;
        }
    }

    big[y] = ans;

    f(y1, y - 1, x1, ansp);
    f(y + 1, y2, ansp, x2);
}

int main()
{
    scanf("%d %d", &n, &m);

	cakes.resize(n);
    for (int i = 0; i < n; i++)
        scanf("%lld %lld", &cakes[i].xx, &cakes[i].yy);

    for (int i = 0; i < n; i++)
        big[i] = -(1ll << 60);

    sort(all(cakes), [](const ii64& l, const ii64& r)
    {
        return l.yy < r.yy;
    });

	vector<ii64> byVal;
	for (int i = 0; i < n; i++)
		byVal.emplace_back(cakes[i].xx, i);

	sort(all(byVal));

	vector<int> order(n);
	for (int i = 0; i < n; i++)
		order[byVal[i].yy] = i;

	tree.init();

	for (int i = 0; i < n; i++)
		tree.update(order[i], ii64(cakes[i].xx, 1));

    f(0, n - 1, 0, n - 1);

    i64 ans = big[0];

    for (int i = 1; i < n; i++)
        ans = max(ans, big[i]);

    printf("%lld\n", ans);

    return 0;
}

Compilation message

cake3.cpp: In instantiation of 'PST<T>::PST(int, const M&) [with M = <lambda(const ii64&, const ii64&)>; T = std::pair<long long int, long long int>]':
cake3.cpp:168:106:   required from here
cake3.cpp:164:6: warning: 'PST<std::pair<long long int, long long int> >::n' will be initialized after [-Wreorder]
  164 |  int n;
      |      ^
cake3.cpp:161:8: warning:   'PST<std::pair<long long int, long long int> >::Merge PST<std::pair<long long int, long long int> >::merge' [-Wreorder]
  161 |  Merge merge;
      |        ^~~~~
cake3.cpp:73:2: warning:   when initialized here [-Wreorder]
   73 |  PST(int n_, const M& m) : n(n_), merge(m) {}
      |  ^~~
cake3.cpp: In instantiation of 'PST<T>::Node::Node() [with T = std::pair<long long int, long long int>]':
/usr/include/c++/10/ext/new_allocator.h:150:4:   required from 'void __gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = PST<std::pair<long long int, long long int> >::Node; _Args = {}; _Tp = PST<std::pair<long long int, long long int> >::Node]'
/usr/include/c++/10/bits/alloc_traits.h:512:17:   required from 'static void std::allocator_traits<std::allocator<_Tp1> >::construct(std::allocator_traits<std::allocator<_Tp1> >::allocator_type&, _Up*, _Args&& ...) [with _Up = PST<std::pair<long long int, long long int> >::Node; _Args = {}; _Tp = PST<std::pair<long long int, long long int> >::Node; std::allocator_traits<std::allocator<_Tp1> >::allocator_type = std::allocator<PST<std::pair<long long int, long long int> >::Node>]'
/usr/include/c++/10/bits/vector.tcc:115:30:   required from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = PST<std::pair<long long int, long long int> >::Node; _Alloc = std::allocator<PST<std::pair<long long int, long long int> >::Node>; std::vector<_Tp, _Alloc>::reference = PST<std::pair<long long int, long long int> >::Node&]'
cake3.cpp:110:20:   required from 'int PST<T>::init(int, int) [with T = std::pair<long long int, long long int>]'
cake3.cpp:103:22:   required from 'void PST<T>::init() [with T = std::pair<long long int, long long int>]'
cake3.cpp:267:12:   required from here
cake3.cpp:33:5: warning: 'PST<std::pair<long long int, long long int> >::Node::value' will be initialized after [-Wreorder]
   33 |   T value;
      |     ^~~~~
cake3.cpp:32:7: warning:   'int PST<std::pair<long long int, long long int> >::Node::lidx' [-Wreorder]
   32 |   int lidx, ridx;
      |       ^~~~
cake3.cpp:35:3: warning:   when initialized here [-Wreorder]
   35 |   Node() :value(T()), lidx(-1), ridx(-1) {}
      |   ^~~~
cake3.cpp: In function 'int main()':
cake3.cpp:243:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  243 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:247:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  247 |         scanf("%lld %lld", &cakes[i].xx, &cakes[i].yy);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12728 KB Output is correct
2 Correct 13 ms 12700 KB Output is correct
3 Correct 12 ms 12728 KB Output is correct
4 Correct 12 ms 12728 KB Output is correct
5 Correct 12 ms 12728 KB Output is correct
6 Correct 12 ms 12728 KB Output is correct
7 Correct 15 ms 12704 KB Output is correct
8 Correct 12 ms 12732 KB Output is correct
9 Correct 13 ms 12728 KB Output is correct
10 Correct 12 ms 12680 KB Output is correct
11 Correct 12 ms 12728 KB Output is correct
12 Correct 12 ms 12728 KB Output is correct
13 Correct 14 ms 12700 KB Output is correct
14 Correct 12 ms 12728 KB Output is correct
15 Correct 13 ms 12728 KB Output is correct
16 Correct 12 ms 12708 KB Output is correct
17 Correct 11 ms 12728 KB Output is correct
18 Correct 13 ms 12756 KB Output is correct
19 Correct 12 ms 12728 KB Output is correct
20 Correct 13 ms 12704 KB Output is correct
21 Correct 14 ms 12772 KB Output is correct
22 Correct 12 ms 12728 KB Output is correct
23 Correct 14 ms 12728 KB Output is correct
24 Correct 13 ms 12700 KB Output is correct
25 Correct 12 ms 12728 KB Output is correct
26 Correct 12 ms 12728 KB Output is correct
27 Correct 13 ms 12768 KB Output is correct
28 Correct 12 ms 12728 KB Output is correct
29 Correct 13 ms 12704 KB Output is correct
30 Correct 12 ms 12728 KB Output is correct
31 Correct 12 ms 12728 KB Output is correct
32 Correct 12 ms 12784 KB Output is correct
33 Correct 13 ms 12724 KB Output is correct
34 Correct 13 ms 12684 KB Output is correct
35 Correct 12 ms 12732 KB Output is correct
36 Correct 13 ms 12792 KB Output is correct
37 Correct 12 ms 12728 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12728 KB Output is correct
2 Correct 13 ms 12700 KB Output is correct
3 Correct 12 ms 12728 KB Output is correct
4 Correct 12 ms 12728 KB Output is correct
5 Correct 12 ms 12728 KB Output is correct
6 Correct 12 ms 12728 KB Output is correct
7 Correct 15 ms 12704 KB Output is correct
8 Correct 12 ms 12732 KB Output is correct
9 Correct 13 ms 12728 KB Output is correct
10 Correct 12 ms 12680 KB Output is correct
11 Correct 12 ms 12728 KB Output is correct
12 Correct 12 ms 12728 KB Output is correct
13 Correct 14 ms 12700 KB Output is correct
14 Correct 12 ms 12728 KB Output is correct
15 Correct 13 ms 12728 KB Output is correct
16 Correct 12 ms 12708 KB Output is correct
17 Correct 11 ms 12728 KB Output is correct
18 Correct 13 ms 12756 KB Output is correct
19 Correct 12 ms 12728 KB Output is correct
20 Correct 13 ms 12704 KB Output is correct
21 Correct 14 ms 12772 KB Output is correct
22 Correct 12 ms 12728 KB Output is correct
23 Correct 14 ms 12728 KB Output is correct
24 Correct 13 ms 12700 KB Output is correct
25 Correct 12 ms 12728 KB Output is correct
26 Correct 12 ms 12728 KB Output is correct
27 Correct 13 ms 12768 KB Output is correct
28 Correct 12 ms 12728 KB Output is correct
29 Correct 13 ms 12704 KB Output is correct
30 Correct 12 ms 12728 KB Output is correct
31 Correct 12 ms 12728 KB Output is correct
32 Correct 12 ms 12784 KB Output is correct
33 Correct 13 ms 12724 KB Output is correct
34 Correct 13 ms 12684 KB Output is correct
35 Correct 12 ms 12732 KB Output is correct
36 Correct 13 ms 12792 KB Output is correct
37 Correct 12 ms 12728 KB Output is correct
38 Correct 15 ms 12868 KB Output is correct
39 Correct 15 ms 12816 KB Output is correct
40 Correct 15 ms 12868 KB Output is correct
41 Correct 16 ms 12876 KB Output is correct
42 Correct 18 ms 12868 KB Output is correct
43 Correct 16 ms 12868 KB Output is correct
44 Correct 16 ms 12896 KB Output is correct
45 Correct 17 ms 12848 KB Output is correct
46 Correct 18 ms 12868 KB Output is correct
47 Correct 15 ms 12868 KB Output is correct
48 Correct 18 ms 12868 KB Output is correct
49 Correct 16 ms 12868 KB Output is correct
50 Correct 19 ms 12872 KB Output is correct
51 Correct 14 ms 12868 KB Output is correct
52 Correct 14 ms 12860 KB Output is correct
53 Correct 16 ms 12808 KB Output is correct
54 Correct 15 ms 12868 KB Output is correct
55 Correct 15 ms 12840 KB Output is correct
56 Correct 15 ms 12872 KB Output is correct
57 Correct 15 ms 12868 KB Output is correct
58 Correct 15 ms 12868 KB Output is correct
59 Correct 17 ms 12868 KB Output is correct
60 Correct 16 ms 12868 KB Output is correct
61 Correct 15 ms 12852 KB Output is correct
62 Correct 15 ms 12880 KB Output is correct
63 Correct 16 ms 12888 KB Output is correct
64 Correct 15 ms 12868 KB Output is correct
65 Correct 16 ms 12848 KB Output is correct
66 Correct 16 ms 12852 KB Output is correct
67 Correct 16 ms 12868 KB Output is correct
68 Correct 15 ms 12868 KB Output is correct
69 Correct 15 ms 12852 KB Output is correct
70 Correct 15 ms 12868 KB Output is correct
71 Correct 15 ms 12820 KB Output is correct
72 Correct 15 ms 12792 KB Output is correct
73 Correct 16 ms 12828 KB Output is correct
74 Correct 15 ms 12868 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12728 KB Output is correct
2 Correct 13 ms 12700 KB Output is correct
3 Correct 12 ms 12728 KB Output is correct
4 Correct 12 ms 12728 KB Output is correct
5 Correct 12 ms 12728 KB Output is correct
6 Correct 12 ms 12728 KB Output is correct
7 Correct 15 ms 12704 KB Output is correct
8 Correct 12 ms 12732 KB Output is correct
9 Correct 13 ms 12728 KB Output is correct
10 Correct 12 ms 12680 KB Output is correct
11 Correct 12 ms 12728 KB Output is correct
12 Correct 12 ms 12728 KB Output is correct
13 Correct 14 ms 12700 KB Output is correct
14 Correct 12 ms 12728 KB Output is correct
15 Correct 13 ms 12728 KB Output is correct
16 Correct 12 ms 12708 KB Output is correct
17 Correct 11 ms 12728 KB Output is correct
18 Correct 13 ms 12756 KB Output is correct
19 Correct 12 ms 12728 KB Output is correct
20 Correct 13 ms 12704 KB Output is correct
21 Correct 14 ms 12772 KB Output is correct
22 Correct 12 ms 12728 KB Output is correct
23 Correct 14 ms 12728 KB Output is correct
24 Correct 13 ms 12700 KB Output is correct
25 Correct 12 ms 12728 KB Output is correct
26 Correct 12 ms 12728 KB Output is correct
27 Correct 13 ms 12768 KB Output is correct
28 Correct 12 ms 12728 KB Output is correct
29 Correct 13 ms 12704 KB Output is correct
30 Correct 12 ms 12728 KB Output is correct
31 Correct 12 ms 12728 KB Output is correct
32 Correct 12 ms 12784 KB Output is correct
33 Correct 13 ms 12724 KB Output is correct
34 Correct 13 ms 12684 KB Output is correct
35 Correct 12 ms 12732 KB Output is correct
36 Correct 13 ms 12792 KB Output is correct
37 Correct 12 ms 12728 KB Output is correct
38 Correct 15 ms 12868 KB Output is correct
39 Correct 15 ms 12816 KB Output is correct
40 Correct 15 ms 12868 KB Output is correct
41 Correct 16 ms 12876 KB Output is correct
42 Correct 18 ms 12868 KB Output is correct
43 Correct 16 ms 12868 KB Output is correct
44 Correct 16 ms 12896 KB Output is correct
45 Correct 17 ms 12848 KB Output is correct
46 Correct 18 ms 12868 KB Output is correct
47 Correct 15 ms 12868 KB Output is correct
48 Correct 18 ms 12868 KB Output is correct
49 Correct 16 ms 12868 KB Output is correct
50 Correct 19 ms 12872 KB Output is correct
51 Correct 14 ms 12868 KB Output is correct
52 Correct 14 ms 12860 KB Output is correct
53 Correct 16 ms 12808 KB Output is correct
54 Correct 15 ms 12868 KB Output is correct
55 Correct 15 ms 12840 KB Output is correct
56 Correct 15 ms 12872 KB Output is correct
57 Correct 15 ms 12868 KB Output is correct
58 Correct 15 ms 12868 KB Output is correct
59 Correct 17 ms 12868 KB Output is correct
60 Correct 16 ms 12868 KB Output is correct
61 Correct 15 ms 12852 KB Output is correct
62 Correct 15 ms 12880 KB Output is correct
63 Correct 16 ms 12888 KB Output is correct
64 Correct 15 ms 12868 KB Output is correct
65 Correct 16 ms 12848 KB Output is correct
66 Correct 16 ms 12852 KB Output is correct
67 Correct 16 ms 12868 KB Output is correct
68 Correct 15 ms 12868 KB Output is correct
69 Correct 15 ms 12852 KB Output is correct
70 Correct 15 ms 12868 KB Output is correct
71 Correct 15 ms 12820 KB Output is correct
72 Correct 15 ms 12792 KB Output is correct
73 Correct 16 ms 12828 KB Output is correct
74 Correct 15 ms 12868 KB Output is correct
75 Correct 859 ms 109940 KB Output is correct
76 Correct 959 ms 113196 KB Output is correct
77 Correct 778 ms 113488 KB Output is correct
78 Correct 830 ms 113712 KB Output is correct
79 Correct 348 ms 113732 KB Output is correct
80 Correct 447 ms 113424 KB Output is correct
81 Correct 727 ms 112840 KB Output is correct
82 Correct 859 ms 112968 KB Output is correct
83 Correct 816 ms 113360 KB Output is correct
84 Correct 860 ms 113352 KB Output is correct
85 Correct 778 ms 112956 KB Output is correct
86 Correct 525 ms 112564 KB Output is correct
87 Correct 524 ms 112328 KB Output is correct
88 Correct 689 ms 112360 KB Output is correct
89 Correct 646 ms 112872 KB Output is correct
90 Correct 515 ms 113476 KB Output is correct
91 Correct 401 ms 112488 KB Output is correct
92 Correct 443 ms 112552 KB Output is correct
93 Correct 496 ms 112832 KB Output is correct
94 Correct 397 ms 113352 KB Output is correct
95 Correct 487 ms 113352 KB Output is correct
96 Correct 461 ms 112456 KB Output is correct
97 Correct 460 ms 113368 KB Output is correct
98 Correct 473 ms 113224 KB Output is correct
99 Correct 467 ms 113224 KB Output is correct
100 Correct 405 ms 112600 KB Output is correct
101 Correct 407 ms 112564 KB Output is correct
102 Correct 814 ms 112584 KB Output is correct
103 Correct 754 ms 112380 KB Output is correct
104 Correct 834 ms 112972 KB Output is correct
105 Correct 670 ms 112968 KB Output is correct
106 Correct 692 ms 113352 KB Output is correct
107 Correct 581 ms 112852 KB Output is correct
108 Correct 779 ms 113452 KB Output is correct
109 Correct 703 ms 114104 KB Output is correct
110 Correct 389 ms 112052 KB Output is correct
111 Correct 495 ms 112288 KB Output is correct
112 Correct 822 ms 111744 KB Output is correct
113 Correct 362 ms 114264 KB Output is correct