oj.uz

답안 #946913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946913 2024-03-15T07:28:38 Z vjudge1 Bulldozer (JOI17_bulldozer) C++17
60 / 100
 718 ms 51904 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));


		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);
		segTree tree;
		tree.init(n);
		for (int i = 0; i < n; ++i)
		{
			pos[i] = i;
			cur[i] = els[i].s;

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

		int res = tree.tree[0].mxSum;
		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))
			{
				for (auto [a, b] : HELP)
				{
					int pa = pos[a];
					int pb = pos[b];

					tree.set(pa, cur[pb]);
					tree.set(pb, cur[pa]);

					swap(cur[pa], cur[pb]);
					pos[a] = pb;
					pos[b] = pa;
				}
				// cout << cur << ": " << tree.tree[0].mxSum << "\n";
				res = max(res, tree.tree[0].mxSum);
				HELP.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:188: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]
  188 |   for (int i = 0; i <= ks.size(); ++i)
      |                   ~~^~~~~~~~~~~~
bulldozer.cpp:190: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]
  190 |    if (i == ks.size() or (i != 0 and ks[i].f != ks[i - 1].f))
      |        ~~^~~~~~~~~~~~
bulldozer.cpp:208: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]
  208 |    if (i != ks.size())
      |        ~~^~~~~~~~~~~~
bulldozer.cpp: At global scope:
bulldozer.cpp:215:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  215 | main()
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 796 KB Output is correct
2 Correct 2 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 2 ms 792 KB Output is correct
7 Correct 1 ms 796 KB Output is correct
8 Correct 1 ms 792 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 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 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 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 608 KB Output is correct
25 Correct 1 ms 608 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 708 KB Output is correct
30 Correct 1 ms 600 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 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 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 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 608 KB Output is correct
25 Correct 1 ms 608 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 708 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 685 ms 51472 KB Output is correct
34 Correct 662 ms 50880 KB Output is correct
35 Correct 657 ms 50420 KB Output is correct
36 Correct 652 ms 50864 KB Output is correct
37 Correct 660 ms 49852 KB Output is correct
38 Correct 688 ms 50368 KB Output is correct
39 Correct 668 ms 51632 KB Output is correct
40 Correct 664 ms 50612 KB Output is correct
41 Correct 671 ms 51124 KB Output is correct
42 Correct 674 ms 51384 KB Output is correct
43 Correct 679 ms 51904 KB Output is correct
44 Correct 655 ms 51896 KB Output is correct
45 Correct 654 ms 51392 KB Output is correct
46 Correct 667 ms 49856 KB Output is correct
47 Correct 684 ms 51392 KB Output is correct
48 Correct 653 ms 51112 KB Output is correct
49 Correct 692 ms 51644 KB Output is correct
50 Correct 718 ms 50368 KB Output is correct
51 Correct 674 ms 50100 KB Output is correct
52 Correct 665 ms 51784 KB Output is correct
53 Correct 702 ms 49844 KB Output is correct
54 Correct 647 ms 51904 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 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 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 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 608 KB Output is correct
25 Correct 1 ms 608 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 708 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 685 ms 51472 KB Output is correct
34 Correct 662 ms 50880 KB Output is correct
35 Correct 657 ms 50420 KB Output is correct
36 Correct 652 ms 50864 KB Output is correct
37 Correct 660 ms 49852 KB Output is correct
38 Correct 688 ms 50368 KB Output is correct
39 Correct 668 ms 51632 KB Output is correct
40 Correct 664 ms 50612 KB Output is correct
41 Correct 671 ms 51124 KB Output is correct
42 Correct 674 ms 51384 KB Output is correct
43 Correct 679 ms 51904 KB Output is correct
44 Correct 655 ms 51896 KB Output is correct
45 Correct 654 ms 51392 KB Output is correct
46 Correct 667 ms 49856 KB Output is correct
47 Correct 684 ms 51392 KB Output is correct
48 Correct 653 ms 51112 KB Output is correct
49 Correct 692 ms 51644 KB Output is correct
50 Correct 718 ms 50368 KB Output is correct
51 Correct 674 ms 50100 KB Output is correct
52 Correct 665 ms 51784 KB Output is correct
53 Correct 702 ms 49844 KB Output is correct
54 Correct 647 ms 51904 KB Output is correct
55 Correct 693 ms 51300 KB Output is correct
56 Correct 651 ms 50828 KB Output is correct
57 Correct 684 ms 51232 KB Output is correct
58 Correct 710 ms 51136 KB Output is correct
59 Correct 655 ms 50356 KB Output is correct
60 Correct 664 ms 51640 KB Output is correct
61 Correct 692 ms 51892 KB Output is correct
62 Correct 683 ms 51648 KB Output is correct
63 Correct 702 ms 50420 KB Output is correct
64 Correct 676 ms 50240 KB Output is correct
65 Incorrect 656 ms 51896 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 796 KB Output is correct
2 Correct 2 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 2 ms 792 KB Output is correct
7 Correct 1 ms 796 KB Output is correct
8 Correct 1 ms 792 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 1 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 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 2 ms 604 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 608 KB Output is correct
40 Correct 1 ms 608 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 2 ms 708 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 685 ms 51472 KB Output is correct
49 Correct 662 ms 50880 KB Output is correct
50 Correct 657 ms 50420 KB Output is correct
51 Correct 652 ms 50864 KB Output is correct
52 Correct 660 ms 49852 KB Output is correct
53 Correct 688 ms 50368 KB Output is correct
54 Correct 668 ms 51632 KB Output is correct
55 Correct 664 ms 50612 KB Output is correct
56 Correct 671 ms 51124 KB Output is correct
57 Correct 674 ms 51384 KB Output is correct
58 Correct 679 ms 51904 KB Output is correct
59 Correct 655 ms 51896 KB Output is correct
60 Correct 654 ms 51392 KB Output is correct
61 Correct 667 ms 49856 KB Output is correct
62 Correct 684 ms 51392 KB Output is correct
63 Correct 653 ms 51112 KB Output is correct
64 Correct 692 ms 51644 KB Output is correct
65 Correct 718 ms 50368 KB Output is correct
66 Correct 674 ms 50100 KB Output is correct
67 Correct 665 ms 51784 KB Output is correct
68 Correct 702 ms 49844 KB Output is correct
69 Correct 647 ms 51904 KB Output is correct
70 Correct 693 ms 51300 KB Output is correct
71 Correct 651 ms 50828 KB Output is correct
72 Correct 684 ms 51232 KB Output is correct
73 Correct 710 ms 51136 KB Output is correct
74 Correct 655 ms 50356 KB Output is correct
75 Correct 664 ms 51640 KB Output is correct
76 Correct 692 ms 51892 KB Output is correct
77 Correct 683 ms 51648 KB Output is correct
78 Correct 702 ms 50420 KB Output is correct
79 Correct 676 ms 50240 KB Output is correct
80 Incorrect 656 ms 51896 KB Output isn't correct
81 Halted 0 ms 0 KB -