oj.uz

Submission #946953

# Submission time Handle Problem Language Result Execution time Memory
946953 2024-03-15T08:20:31 Z vjudge1 Bulldozer (JOI17_bulldozer) C++17
60 / 100
 2000 ms 75484 KB 
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
	template <typename T1, typename T2>
	std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
	{
		in >> x.first >> x.second;
		return in;
	}

	template <typename T1, typename T2>
	std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
	{
		out << x.first << " " << x.second;
		return out;
	}

	template <typename T1>
	std::istream &operator>>(std::istream &in, std::vector<T1> &x)
	{
		for (auto &i : x)
			in >> i;
		return in;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
	ios_base ::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

#define int ll

struct segTree
{
	struct Node
	{
		int mxSum = 0, mxPref = 0, mxSuff = 0, sum = 0;
	};
	vector<Node> tree;
	int sz = 0;

	Node merge(Node a, Node b)
	{
		Node res;
		res.sum = a.sum + b.sum;
		res.mxSum = max({a.mxSum, b.mxSum, res.mxSum, a.mxSuff + b.mxPref});
		res.mxPref = max(a.mxPref, a.sum + b.mxPref);
		res.mxSuff = max(b.mxSuff, b.sum + a.mxSuff);
		return res;
	}

	void init(int n)
	{
		sz = 1;
		while (sz < n)
			sz *= 2;
		tree.resize(2 * sz);
	}

	void set(int pos, int val, int v, int lv, int rv)
	{
		if (rv - lv == 1)
		{
			tree[v].mxPref = tree[v].mxSum = tree[v].mxSuff = max(val, 0LL);
			tree[v].sum = val;
			return;
		}
		int m = (lv + rv) >> 1;
		if (pos < m)
			set(pos, val, v * 2 + 1, lv, m);
		else
			set(pos, val, v * 2 + 2, m, rv);
		tree[v] = merge(tree[v * 2 + 1], tree[v * 2 + 2]);
	}

	void set(int pos, int val)
	{
		set(pos, val, 0, 0, sz);
	}
};

struct test
{
	void solve(int testcase)
	{
		boost();

		int n;
		cin >> n;
		vector<pair<pii, int>> els(n);
		cin >> els;

		sort(all(els), [](pair<pii, int> a, pair<pii, int> b)
			 {if(a.f.f != b.f.f) return a.f.f < b.f.f; return a.f.s > b.f.s; });

		vector<pair<double, pii>> ks;
		for (int i = 0; i < n; ++i)
			for (int j = i + 1; j < n; ++j)
			{
				double cur = (els[j].f.f - els[i].f.f) ? ((double)els[j].f.s - els[i].f.s) / (els[j].f.f - els[i].f.f) : -BIG;
				ks.pb({cur, {i, j}});
			}
		sort(all(ks));

		// vector<pair<pii, int>> bf;
		// for (int i = 0; i < n; ++i)
		// 	bf.pb({{els[i].f.s, els[i].f.f}, i});
		// sort(all(bf));

		vector<int> pos(n);
		vector<int> cur(n), val(n);
		segTree tree;
		tree.init(n);
		for (int i = 0; i < n; ++i)
		{
			pos[i] = i;
			cur[i] = els[i].s;
			val[i] = i;

			// poses[bf[i].s] = i;
			// cur[i] = els[bf[i].s].s;
			tree.set(i, cur[i]);
		}

		int res = tree.tree[0].mxSum;
		vector<vector<int>> bck(n);
		vector<pii> HELP;
		for (int i = 0; i <= ks.size(); ++i)
		{
			if (i == ks.size() or (i != 0 and ks[i].f != ks[i - 1].f))
			{
				vector<int> vals;
				for (auto [a, b] : HELP)
				{
					if (pos[a] > pos[b])
						swap(a, b);
					bck[pos[a]].pb(pos[b]);
					vals.pb(pos[a]);
				}
				sort(all(vals));
				vals.erase(unique(all(vals)), vals.end());

				int mx = -1;
				for (int el : vals)
				{
					if (el <= mx)
						continue;
					for (int el : bck[el])
						mx = max(el, mx);

					int mn = el;
					for (int i = 0; mn + i < mx - i; ++i)
					{
						tree.set(mn + i, cur[mx - i]);
						tree.set(mx - i, cur[mn + i]);

						swap(cur[mn + i], cur[mx - i]);
						swap(val[mn + i], val[mx - i]);
						swap(pos[val[mn + i]], pos[val[mx - i]]);
					}
				}
				// cout << cur << ": " << tree.tree[0].mxSum << "\n";
				res = max(res, tree.tree[0].mxSum);
				HELP.clear();
				for (auto [a, b] : HELP)
				{
					if (pos[a] > pos[b])
						swap(a, b);
					bck[pos[a]].clear();
				}
			}
			if (i != ks.size())
			{
				HELP.pb(ks[i].s);
			}
		}
		cout << res << '\n';
	}
};

main()
{
	boost();
	int q = 1;
	// cin >> q;
	for (int i = 0; i < q; i++)
	{
		test t;
		t.solve(i);
	}
	return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message

bulldozer.cpp: In member function 'void test::solve(long long int)':
bulldozer.cpp:190:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |   for (int i = 0; i <= ks.size(); ++i)
      |                   ~~^~~~~~~~~~~~
bulldozer.cpp:192:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  192 |    if (i == ks.size() or (i != 0 and ks[i].f != ks[i - 1].f))
      |        ~~^~~~~~~~~~~~
bulldozer.cpp:234:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  234 |    if (i != ks.size())
      |        ~~^~~~~~~~~~~~
bulldozer.cpp: At global scope:
bulldozer.cpp:243:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  243 | main()
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 796 KB Output is correct
2 Correct 1 ms 796 KB Output is correct
3 Correct 1 ms 796 KB Output is correct
4 Correct 1 ms 796 KB Output is correct
5 Correct 1 ms 796 KB Output is correct
6 Correct 1 ms 796 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 796 KB Output is correct
9 Correct 1 ms 796 KB Output is correct
10 Correct 2 ms 796 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1892 ms 73352 KB Output is correct
34 Correct 1923 ms 74676 KB Output is correct
35 Correct 1909 ms 73972 KB Output is correct
36 Correct 1954 ms 73656 KB Output is correct
37 Correct 1980 ms 73952 KB Output is correct
38 Correct 1897 ms 74152 KB Output is correct
39 Correct 1929 ms 73600 KB Output is correct
40 Correct 1936 ms 74408 KB Output is correct
41 Correct 1908 ms 73000 KB Output is correct
42 Correct 1916 ms 73664 KB Output is correct
43 Correct 1872 ms 74400 KB Output is correct
44 Correct 1927 ms 74168 KB Output is correct
45 Correct 1906 ms 74784 KB Output is correct
46 Correct 1887 ms 75484 KB Output is correct
47 Correct 1881 ms 74804 KB Output is correct
48 Correct 1924 ms 74160 KB Output is correct
49 Correct 1885 ms 73716 KB Output is correct
50 Correct 1881 ms 73904 KB Output is correct
51 Correct 1907 ms 74868 KB Output is correct
52 Correct 1888 ms 73740 KB Output is correct
53 Correct 1888 ms 73364 KB Output is correct
54 Correct 1918 ms 74904 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1892 ms 73352 KB Output is correct
34 Correct 1923 ms 74676 KB Output is correct
35 Correct 1909 ms 73972 KB Output is correct
36 Correct 1954 ms 73656 KB Output is correct
37 Correct 1980 ms 73952 KB Output is correct
38 Correct 1897 ms 74152 KB Output is correct
39 Correct 1929 ms 73600 KB Output is correct
40 Correct 1936 ms 74408 KB Output is correct
41 Correct 1908 ms 73000 KB Output is correct
42 Correct 1916 ms 73664 KB Output is correct
43 Correct 1872 ms 74400 KB Output is correct
44 Correct 1927 ms 74168 KB Output is correct
45 Correct 1906 ms 74784 KB Output is correct
46 Correct 1887 ms 75484 KB Output is correct
47 Correct 1881 ms 74804 KB Output is correct
48 Correct 1924 ms 74160 KB Output is correct
49 Correct 1885 ms 73716 KB Output is correct
50 Correct 1881 ms 73904 KB Output is correct
51 Correct 1907 ms 74868 KB Output is correct
52 Correct 1888 ms 73740 KB Output is correct
53 Correct 1888 ms 73364 KB Output is correct
54 Correct 1918 ms 74904 KB Output is correct
55 Correct 1953 ms 73168 KB Output is correct
56 Correct 1892 ms 73804 KB Output is correct
57 Correct 1893 ms 74064 KB Output is correct
58 Correct 1905 ms 74900 KB Output is correct
59 Correct 1883 ms 74368 KB Output is correct
60 Correct 1899 ms 75108 KB Output is correct
61 Correct 1904 ms 73788 KB Output is correct
62 Correct 1961 ms 74724 KB Output is correct
63 Correct 1930 ms 74764 KB Output is correct
64 Correct 1899 ms 73824 KB Output is correct
65 Correct 1935 ms 73368 KB Output is correct
66 Correct 1966 ms 74104 KB Output is correct
67 Correct 1926 ms 74316 KB Output is correct
68 Correct 1984 ms 73268 KB Output is correct
69 Correct 1947 ms 73300 KB Output is correct
70 Correct 1896 ms 73420 KB Output is correct
71 Correct 1917 ms 73528 KB Output is correct
72 Correct 1951 ms 73516 KB Output is correct
73 Execution timed out 2017 ms 74252 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 796 KB Output is correct
2 Correct 1 ms 796 KB Output is correct
3 Correct 1 ms 796 KB Output is correct
4 Correct 1 ms 796 KB Output is correct
5 Correct 1 ms 796 KB Output is correct
6 Correct 1 ms 796 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 796 KB Output is correct
9 Correct 1 ms 796 KB Output is correct
10 Correct 2 ms 796 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 1892 ms 73352 KB Output is correct
49 Correct 1923 ms 74676 KB Output is correct
50 Correct 1909 ms 73972 KB Output is correct
51 Correct 1954 ms 73656 KB Output is correct
52 Correct 1980 ms 73952 KB Output is correct
53 Correct 1897 ms 74152 KB Output is correct
54 Correct 1929 ms 73600 KB Output is correct
55 Correct 1936 ms 74408 KB Output is correct
56 Correct 1908 ms 73000 KB Output is correct
57 Correct 1916 ms 73664 KB Output is correct
58 Correct 1872 ms 74400 KB Output is correct
59 Correct 1927 ms 74168 KB Output is correct
60 Correct 1906 ms 74784 KB Output is correct
61 Correct 1887 ms 75484 KB Output is correct
62 Correct 1881 ms 74804 KB Output is correct
63 Correct 1924 ms 74160 KB Output is correct
64 Correct 1885 ms 73716 KB Output is correct
65 Correct 1881 ms 73904 KB Output is correct
66 Correct 1907 ms 74868 KB Output is correct
67 Correct 1888 ms 73740 KB Output is correct
68 Correct 1888 ms 73364 KB Output is correct
69 Correct 1918 ms 74904 KB Output is correct
70 Correct 1953 ms 73168 KB Output is correct
71 Correct 1892 ms 73804 KB Output is correct
72 Correct 1893 ms 74064 KB Output is correct
73 Correct 1905 ms 74900 KB Output is correct
74 Correct 1883 ms 74368 KB Output is correct
75 Correct 1899 ms 75108 KB Output is correct
76 Correct 1904 ms 73788 KB Output is correct
77 Correct 1961 ms 74724 KB Output is correct
78 Correct 1930 ms 74764 KB Output is correct
79 Correct 1899 ms 73824 KB Output is correct
80 Correct 1935 ms 73368 KB Output is correct
81 Correct 1966 ms 74104 KB Output is correct
82 Correct 1926 ms 74316 KB Output is correct
83 Correct 1984 ms 73268 KB Output is correct
84 Correct 1947 ms 73300 KB Output is correct
85 Correct 1896 ms 73420 KB Output is correct
86 Correct 1917 ms 73528 KB Output is correct
87 Correct 1951 ms 73516 KB Output is correct
88 Execution timed out 2017 ms 74252 KB Time limit exceeded
89 Halted 0 ms 0 KB -