oj.uz

Submission #593987

# Submission time Handle Problem Language Result Execution time Memory
593987 2022-07-11T19:59:15 Z GusterGoose27 Bulldozer (JOI17_bulldozer) C++11
100 / 100
 1435 ms 94672 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

class Point {
public:
	int x;
	int y;
	int v;
	Point() {}
	Point(int xn, int yn, int vn) {
		x = xn;
		y = yn;
		v = vn;
	}
};

class Frac {
public:
	ll num;
	ll denom;
	Frac() {}
	Frac(ll n, ll d) {
		num = n;
		denom = d;
		reduce();
	}
	ll gcd(ll a, ll b) {
		if (a > b) return gcd(b, a);
		if (a == 0) return b;
		return gcd(b%a, a);
	}
	void reduce() {
		if (denom < 0) {
			num *= -1;
			denom *= -1;
		}
		ll g = gcd(abs(num), abs(denom));
		num /= g;
		denom /= g;
	}
	Frac mult(ll other) {
		Frac f(num, denom);
		f.num *= other;
		f.reduce();
		return f;
	}
	bool equals(ll other) {
		return (denom == 1) && (num == other);
	}
};

bool operator<(const Frac &a, const Frac &b) {
	return (a.num*b.denom < b.num*a.denom);
}

bool operator==(const Frac &a, const Frac &b) {
	return (a.num == b.num) && (a.denom == b.denom);
}

typedef pair<Frac, int> pfi;

bool operator<(const Point &a, const Point &b) {
	return (a.x == b.x) ? (a.y < b.y) : (a.x < b.x);
}

const int MAXN = 2000;
const ld ERROR = 2e-10;
Point points[MAXN];
int curpos[MAXN];
pfi updates[MAXN*(MAXN-1)];
int t = 0;
int n;

Frac get_ang(int i, int j) { // actually the slope but who cares
	return Frac(points[j].y-points[i].y, points[j].x-points[i].x);
}

class STree {
public:
	int n;
	ll *sum;
	ll *max_pre;
	ll *max_suf;
	ll *max_cont;
	STree(int nn) {
		n = pow(2, ceil(log2(nn)));
		sum = new ll[2*n];
		max_pre = new ll[2*n];
		max_suf = new ll[2*n];
		max_cont = new ll[2*n];
		for (int i = 0; i < n; i++) {
			if (i < nn) {
				sum[i+n] = points[i].v;
				max_pre[i+n] = max(0, points[i].v);
				max_suf[i+n] = max(0, points[i].v);
				max_cont[i+n] = max(0, points[i].v);
			}
			else {
				sum[i+n] = 0;
				max_pre[i+n] = 0;
				max_suf[i+n] = 0;
				max_cont[i+n] = 0;
			}
		}
		for (int i = n-1; i >= 0; i--) reset(i);
	}
	void reset(int i) {
		assert(i < n);
		sum[i] = sum[2*i]+sum[2*i+1];
		max_pre[i] = max(max_pre[2*i], sum[2*i]+max_pre[2*i+1]);
		max_suf[i] = max(max_suf[2*i+1], max_suf[2*i]+sum[2*i+1]);
		max_cont[i] = max(max(max_cont[2*i], max_cont[2*i+1]), max_suf[2*i]+max_pre[2*i+1]);
	}
	void update(int i) {
		sum[i+n] = points[i].v;
		max_pre[i+n] = max(0, points[i].v);
		max_suf[i+n] = max(0, points[i].v);
		max_cont[i+n] = max(0, points[i].v);
		i += n;
		while (i > 1) {
			i /= 2;
			reset(i);
		}
	}
	ll max_sum() {
		return max_cont[1];
	}
};

void make_upd(int i, int j) {
	if (points[i].x == points[j].x) return;
	Frac ang = get_ang(i, j);
	updates[t++] = pfi(ang, i);
	updates[t++] = pfi(ang, j);
}

void swap(int a, int b, STree &s) {
	int i = curpos[a];
	int j = curpos[b];
	Point temp = points[i];
	points[i] = points[j];
	points[j] = temp;
	s.update(i);
	s.update(j);
	curpos[a] = j;
	curpos[b] = i;
}

void swap(vector<int> &v, STree &s) {
	for (int j = 0; j < v.size()/2; j++) {
		swap(v[j], v[v.size()-1-j], s);
	}
}

bool on_line(Frac ang, int i, int j) {
	Frac f = ang.mult(points[j].x-points[i].x);
	return f.equals(points[j].y-points[i].y);
}

struct comp {
	bool operator()(const int &a, const int &b) {
		return (curpos[a] < curpos[b]);
	}
};

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	for (int i = 0; i < n; i++) {
		int x, y, w;
		cin >> x >> y >> w;
		points[i] = Point(x, y, w);
	}
	sort(points, points+n);
	for (int i = 0; i < n; i++) {
		for (int j = i+1; j < n; j++) {
			make_upd(i, j);
		}
	}
	iota(curpos, curpos+n, 0);
	STree s(n);
	ll best = s.max_sum();
	sort(updates, updates+t);
	for (int i = 0; i < t;) {
		Frac ang = updates[i].first;
		int orig = i;
		set<int, comp> cur_vals;
		while (i < t && updates[i].first == ang) {
			cur_vals.insert(updates[i].second);
			i++;
		}
		vector<int> cur_line;
		for (int v: cur_vals) {
			if (cur_line.empty() || on_line(ang, curpos[cur_line.back()], curpos[v])) cur_line.push_back(v);
			else {
				swap(cur_line, s);
				cur_line.clear();
				cur_line.push_back(v);
			}
		}
		assert(cur_line.size());
		swap(cur_line, s);
		best = max(best, s.max_sum());
	}
	cout << best << "\n";
}

Compilation message

bulldozer.cpp: In function 'void swap(std::vector<int>&, STree&)':
bulldozer.cpp:154:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |  for (int j = 0; j < v.size()/2; j++) {
      |                  ~~^~~~~~~~~~~~
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:190:7: warning: unused variable 'orig' [-Wunused-variable]
  190 |   int orig = i;
      |       ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94164 KB Output is correct
2 Correct 38 ms 94164 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 35 ms 94204 KB Output is correct
5 Correct 37 ms 94156 KB Output is correct
6 Correct 35 ms 94140 KB Output is correct
7 Correct 39 ms 94164 KB Output is correct
8 Correct 35 ms 94152 KB Output is correct
9 Correct 37 ms 94204 KB Output is correct
10 Correct 36 ms 94088 KB Output is correct
11 Correct 36 ms 94160 KB Output is correct
12 Correct 34 ms 94192 KB Output is correct
13 Correct 35 ms 94168 KB Output is correct
14 Correct 40 ms 94080 KB Output is correct
15 Correct 37 ms 94276 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 48 ms 94196 KB Output is correct
3 Correct 39 ms 94124 KB Output is correct
4 Correct 40 ms 94200 KB Output is correct
5 Correct 38 ms 94100 KB Output is correct
6 Correct 37 ms 94180 KB Output is correct
7 Correct 36 ms 94156 KB Output is correct
8 Correct 38 ms 94120 KB Output is correct
9 Correct 38 ms 94172 KB Output is correct
10 Correct 38 ms 94188 KB Output is correct
11 Correct 38 ms 94156 KB Output is correct
12 Correct 37 ms 94096 KB Output is correct
13 Correct 45 ms 94128 KB Output is correct
14 Correct 35 ms 94156 KB Output is correct
15 Correct 36 ms 94192 KB Output is correct
16 Correct 38 ms 94152 KB Output is correct
17 Correct 35 ms 94100 KB Output is correct
18 Correct 37 ms 94204 KB Output is correct
19 Correct 35 ms 94180 KB Output is correct
20 Correct 34 ms 94192 KB Output is correct
21 Correct 40 ms 94200 KB Output is correct
22 Correct 40 ms 94196 KB Output is correct
23 Correct 38 ms 94168 KB Output is correct
24 Correct 39 ms 94164 KB Output is correct
25 Correct 39 ms 94156 KB Output is correct
26 Correct 38 ms 94420 KB Output is correct
27 Correct 38 ms 94240 KB Output is correct
28 Correct 37 ms 94164 KB Output is correct
29 Correct 37 ms 94092 KB Output is correct
30 Correct 44 ms 94156 KB Output is correct
31 Correct 36 ms 94096 KB Output is correct
32 Correct 38 ms 94172 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 48 ms 94196 KB Output is correct
3 Correct 39 ms 94124 KB Output is correct
4 Correct 40 ms 94200 KB Output is correct
5 Correct 38 ms 94100 KB Output is correct
6 Correct 37 ms 94180 KB Output is correct
7 Correct 36 ms 94156 KB Output is correct
8 Correct 38 ms 94120 KB Output is correct
9 Correct 38 ms 94172 KB Output is correct
10 Correct 38 ms 94188 KB Output is correct
11 Correct 38 ms 94156 KB Output is correct
12 Correct 37 ms 94096 KB Output is correct
13 Correct 45 ms 94128 KB Output is correct
14 Correct 35 ms 94156 KB Output is correct
15 Correct 36 ms 94192 KB Output is correct
16 Correct 38 ms 94152 KB Output is correct
17 Correct 35 ms 94100 KB Output is correct
18 Correct 37 ms 94204 KB Output is correct
19 Correct 35 ms 94180 KB Output is correct
20 Correct 34 ms 94192 KB Output is correct
21 Correct 40 ms 94200 KB Output is correct
22 Correct 40 ms 94196 KB Output is correct
23 Correct 38 ms 94168 KB Output is correct
24 Correct 39 ms 94164 KB Output is correct
25 Correct 39 ms 94156 KB Output is correct
26 Correct 38 ms 94420 KB Output is correct
27 Correct 38 ms 94240 KB Output is correct
28 Correct 37 ms 94164 KB Output is correct
29 Correct 37 ms 94092 KB Output is correct
30 Correct 44 ms 94156 KB Output is correct
31 Correct 36 ms 94096 KB Output is correct
32 Correct 38 ms 94172 KB Output is correct
33 Correct 1393 ms 94536 KB Output is correct
34 Correct 1382 ms 94420 KB Output is correct
35 Correct 1414 ms 94412 KB Output is correct
36 Correct 1401 ms 94528 KB Output is correct
37 Correct 1396 ms 94416 KB Output is correct
38 Correct 1390 ms 94420 KB Output is correct
39 Correct 1435 ms 94412 KB Output is correct
40 Correct 1394 ms 94412 KB Output is correct
41 Correct 1378 ms 94412 KB Output is correct
42 Correct 1394 ms 94408 KB Output is correct
43 Correct 1292 ms 94412 KB Output is correct
44 Correct 1280 ms 94408 KB Output is correct
45 Correct 1290 ms 94408 KB Output is correct
46 Correct 1321 ms 94532 KB Output is correct
47 Correct 1349 ms 94456 KB Output is correct
48 Correct 1311 ms 94536 KB Output is correct
49 Correct 1323 ms 94412 KB Output is correct
50 Correct 1303 ms 94408 KB Output is correct
51 Correct 1326 ms 94532 KB Output is correct
52 Correct 1312 ms 94412 KB Output is correct
53 Correct 1313 ms 94416 KB Output is correct
54 Correct 1314 ms 94540 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 48 ms 94196 KB Output is correct
3 Correct 39 ms 94124 KB Output is correct
4 Correct 40 ms 94200 KB Output is correct
5 Correct 38 ms 94100 KB Output is correct
6 Correct 37 ms 94180 KB Output is correct
7 Correct 36 ms 94156 KB Output is correct
8 Correct 38 ms 94120 KB Output is correct
9 Correct 38 ms 94172 KB Output is correct
10 Correct 38 ms 94188 KB Output is correct
11 Correct 38 ms 94156 KB Output is correct
12 Correct 37 ms 94096 KB Output is correct
13 Correct 45 ms 94128 KB Output is correct
14 Correct 35 ms 94156 KB Output is correct
15 Correct 36 ms 94192 KB Output is correct
16 Correct 38 ms 94152 KB Output is correct
17 Correct 35 ms 94100 KB Output is correct
18 Correct 37 ms 94204 KB Output is correct
19 Correct 35 ms 94180 KB Output is correct
20 Correct 34 ms 94192 KB Output is correct
21 Correct 40 ms 94200 KB Output is correct
22 Correct 40 ms 94196 KB Output is correct
23 Correct 38 ms 94168 KB Output is correct
24 Correct 39 ms 94164 KB Output is correct
25 Correct 39 ms 94156 KB Output is correct
26 Correct 38 ms 94420 KB Output is correct
27 Correct 38 ms 94240 KB Output is correct
28 Correct 37 ms 94164 KB Output is correct
29 Correct 37 ms 94092 KB Output is correct
30 Correct 44 ms 94156 KB Output is correct
31 Correct 36 ms 94096 KB Output is correct
32 Correct 38 ms 94172 KB Output is correct
33 Correct 1393 ms 94536 KB Output is correct
34 Correct 1382 ms 94420 KB Output is correct
35 Correct 1414 ms 94412 KB Output is correct
36 Correct 1401 ms 94528 KB Output is correct
37 Correct 1396 ms 94416 KB Output is correct
38 Correct 1390 ms 94420 KB Output is correct
39 Correct 1435 ms 94412 KB Output is correct
40 Correct 1394 ms 94412 KB Output is correct
41 Correct 1378 ms 94412 KB Output is correct
42 Correct 1394 ms 94408 KB Output is correct
43 Correct 1292 ms 94412 KB Output is correct
44 Correct 1280 ms 94408 KB Output is correct
45 Correct 1290 ms 94408 KB Output is correct
46 Correct 1321 ms 94532 KB Output is correct
47 Correct 1349 ms 94456 KB Output is correct
48 Correct 1311 ms 94536 KB Output is correct
49 Correct 1323 ms 94412 KB Output is correct
50 Correct 1303 ms 94408 KB Output is correct
51 Correct 1326 ms 94532 KB Output is correct
52 Correct 1312 ms 94412 KB Output is correct
53 Correct 1313 ms 94416 KB Output is correct
54 Correct 1314 ms 94540 KB Output is correct
55 Correct 1374 ms 94412 KB Output is correct
56 Correct 1371 ms 94416 KB Output is correct
57 Correct 1387 ms 94536 KB Output is correct
58 Correct 1373 ms 94404 KB Output is correct
59 Correct 1381 ms 94412 KB Output is correct
60 Correct 1377 ms 94540 KB Output is correct
61 Correct 1378 ms 94488 KB Output is correct
62 Correct 1387 ms 94408 KB Output is correct
63 Correct 1369 ms 94412 KB Output is correct
64 Correct 1365 ms 94532 KB Output is correct
65 Correct 1376 ms 94408 KB Output is correct
66 Correct 1373 ms 94404 KB Output is correct
67 Correct 1363 ms 94412 KB Output is correct
68 Correct 1377 ms 94504 KB Output is correct
69 Correct 1410 ms 94504 KB Output is correct
70 Correct 1413 ms 94408 KB Output is correct
71 Correct 1395 ms 94504 KB Output is correct
72 Correct 1377 ms 94536 KB Output is correct
73 Correct 1423 ms 94536 KB Output is correct
74 Correct 1374 ms 94612 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94164 KB Output is correct
2 Correct 38 ms 94164 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 35 ms 94204 KB Output is correct
5 Correct 37 ms 94156 KB Output is correct
6 Correct 35 ms 94140 KB Output is correct
7 Correct 39 ms 94164 KB Output is correct
8 Correct 35 ms 94152 KB Output is correct
9 Correct 37 ms 94204 KB Output is correct
10 Correct 36 ms 94088 KB Output is correct
11 Correct 36 ms 94160 KB Output is correct
12 Correct 34 ms 94192 KB Output is correct
13 Correct 35 ms 94168 KB Output is correct
14 Correct 40 ms 94080 KB Output is correct
15 Correct 37 ms 94276 KB Output is correct
16 Correct 36 ms 94156 KB Output is correct
17 Correct 48 ms 94196 KB Output is correct
18 Correct 39 ms 94124 KB Output is correct
19 Correct 40 ms 94200 KB Output is correct
20 Correct 38 ms 94100 KB Output is correct
21 Correct 37 ms 94180 KB Output is correct
22 Correct 36 ms 94156 KB Output is correct
23 Correct 38 ms 94120 KB Output is correct
24 Correct 38 ms 94172 KB Output is correct
25 Correct 38 ms 94188 KB Output is correct
26 Correct 38 ms 94156 KB Output is correct
27 Correct 37 ms 94096 KB Output is correct
28 Correct 45 ms 94128 KB Output is correct
29 Correct 35 ms 94156 KB Output is correct
30 Correct 36 ms 94192 KB Output is correct
31 Correct 38 ms 94152 KB Output is correct
32 Correct 35 ms 94100 KB Output is correct
33 Correct 37 ms 94204 KB Output is correct
34 Correct 35 ms 94180 KB Output is correct
35 Correct 34 ms 94192 KB Output is correct
36 Correct 40 ms 94200 KB Output is correct
37 Correct 40 ms 94196 KB Output is correct
38 Correct 38 ms 94168 KB Output is correct
39 Correct 39 ms 94164 KB Output is correct
40 Correct 39 ms 94156 KB Output is correct
41 Correct 38 ms 94420 KB Output is correct
42 Correct 38 ms 94240 KB Output is correct
43 Correct 37 ms 94164 KB Output is correct
44 Correct 37 ms 94092 KB Output is correct
45 Correct 44 ms 94156 KB Output is correct
46 Correct 36 ms 94096 KB Output is correct
47 Correct 38 ms 94172 KB Output is correct
48 Correct 1393 ms 94536 KB Output is correct
49 Correct 1382 ms 94420 KB Output is correct
50 Correct 1414 ms 94412 KB Output is correct
51 Correct 1401 ms 94528 KB Output is correct
52 Correct 1396 ms 94416 KB Output is correct
53 Correct 1390 ms 94420 KB Output is correct
54 Correct 1435 ms 94412 KB Output is correct
55 Correct 1394 ms 94412 KB Output is correct
56 Correct 1378 ms 94412 KB Output is correct
57 Correct 1394 ms 94408 KB Output is correct
58 Correct 1292 ms 94412 KB Output is correct
59 Correct 1280 ms 94408 KB Output is correct
60 Correct 1290 ms 94408 KB Output is correct
61 Correct 1321 ms 94532 KB Output is correct
62 Correct 1349 ms 94456 KB Output is correct
63 Correct 1311 ms 94536 KB Output is correct
64 Correct 1323 ms 94412 KB Output is correct
65 Correct 1303 ms 94408 KB Output is correct
66 Correct 1326 ms 94532 KB Output is correct
67 Correct 1312 ms 94412 KB Output is correct
68 Correct 1313 ms 94416 KB Output is correct
69 Correct 1314 ms 94540 KB Output is correct
70 Correct 1374 ms 94412 KB Output is correct
71 Correct 1371 ms 94416 KB Output is correct
72 Correct 1387 ms 94536 KB Output is correct
73 Correct 1373 ms 94404 KB Output is correct
74 Correct 1381 ms 94412 KB Output is correct
75 Correct 1377 ms 94540 KB Output is correct
76 Correct 1378 ms 94488 KB Output is correct
77 Correct 1387 ms 94408 KB Output is correct
78 Correct 1369 ms 94412 KB Output is correct
79 Correct 1365 ms 94532 KB Output is correct
80 Correct 1376 ms 94408 KB Output is correct
81 Correct 1373 ms 94404 KB Output is correct
82 Correct 1363 ms 94412 KB Output is correct
83 Correct 1377 ms 94504 KB Output is correct
84 Correct 1410 ms 94504 KB Output is correct
85 Correct 1413 ms 94408 KB Output is correct
86 Correct 1395 ms 94504 KB Output is correct
87 Correct 1377 ms 94536 KB Output is correct
88 Correct 1423 ms 94536 KB Output is correct
89 Correct 1374 ms 94612 KB Output is correct
90 Correct 1362 ms 94428 KB Output is correct
91 Correct 1367 ms 94624 KB Output is correct
92 Correct 1365 ms 94536 KB Output is correct
93 Correct 1409 ms 94452 KB Output is correct
94 Correct 1378 ms 94416 KB Output is correct
95 Correct 1386 ms 94412 KB Output is correct
96 Correct 1370 ms 94468 KB Output is correct
97 Correct 1363 ms 94420 KB Output is correct
98 Correct 1374 ms 94456 KB Output is correct
99 Correct 1373 ms 94416 KB Output is correct
100 Correct 509 ms 94408 KB Output is correct
101 Correct 530 ms 94464 KB Output is correct
102 Correct 500 ms 94412 KB Output is correct
103 Correct 498 ms 94400 KB Output is correct
104 Correct 501 ms 94540 KB Output is correct
105 Correct 668 ms 94396 KB Output is correct
106 Correct 659 ms 94420 KB Output is correct
107 Correct 672 ms 94396 KB Output is correct
108 Correct 666 ms 94284 KB Output is correct
109 Correct 668 ms 94392 KB Output is correct
110 Correct 1076 ms 94468 KB Output is correct
111 Correct 1107 ms 94412 KB Output is correct
112 Correct 1084 ms 94524 KB Output is correct
113 Correct 1095 ms 94560 KB Output is correct
114 Correct 1122 ms 94468 KB Output is correct
115 Correct 1106 ms 94464 KB Output is correct
116 Correct 1120 ms 94512 KB Output is correct
117 Correct 1109 ms 94540 KB Output is correct
118 Correct 1093 ms 94524 KB Output is correct
119 Correct 1095 ms 94540 KB Output is correct
120 Correct 35 ms 94156 KB Output is correct
121 Correct 37 ms 94156 KB Output is correct
122 Correct 1225 ms 94516 KB Output is correct
123 Correct 1209 ms 94544 KB Output is correct
124 Correct 1206 ms 94456 KB Output is correct
125 Correct 1195 ms 94568 KB Output is correct
126 Correct 1192 ms 94544 KB Output is correct
127 Correct 1197 ms 94444 KB Output is correct
128 Correct 1214 ms 94440 KB Output is correct
129 Correct 1201 ms 94672 KB Output is correct
130 Correct 1201 ms 94536 KB Output is correct
131 Correct 1242 ms 94536 KB Output is correct
132 Correct 1188 ms 94416 KB Output is correct
133 Correct 1200 ms 94532 KB Output is correct