oj.uz

Submission #514406

# Submission time Handle Problem Language Result Execution time Memory
514406 2022-01-18T07:34:45 Z amunduzbaev Bulldozer (JOI17_bulldozer) C++14
80 / 100
 1170 ms 66248 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

const int N = 2005;
long double const eps = 1e-18;

struct ST{
	ar<int, 4> tree[N * 4];
	void merge(ar<int, 4>& x, ar<int, 4>& a, ar<int, 4>& b){
		x[0] = max({a[0], b[0], a[2] + b[1]});
		x[1] = max({a[1], a[3] + b[1]});
		x[2] = max({b[2], b[3] + a[2]});
		x[3] = a[3] + b[3];
	}
	
	void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
		if(lx == rx){ 
			tree[x] = {max(v, 0ll), max(v, 0ll), max(v, 0ll), v}; return;
		} int m = (lx + rx) >> 1;
		if(i <= m) sett(i, v, lx, m, x<<1);
		else sett(i, v, m+1, rx, x<<1|1);
		merge(tree[x], tree[x<<1], tree[x<<1|1]);
	}
	
	int get(int i, int lx = 0, int rx = N, int x = 1){
		if(lx == rx) return tree[x][3];
		int m = (lx + rx) >> 1;
		if(i <= m) return get(i, lx, m, x<<1);
		else return get(i, m+1, rx, x<<1|1);
	}
}tree;

/*

5
5 1 5
4 2 2
3 3 -2
2 4 3
1 5 -1

*/

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	vector<ar<int, 3>> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i][0]>>a[i][1]>>a[i][2];
	} sort(a.begin(), a.end(), [&](auto& a, auto& b){
		if(a[0] != b[0]) return a[0] < b[0];
		return a[1] > b[1];
	});

	vector<pair<long double, pair<int, int>>> tt;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(a[i][0] == a[j][0]) continue;
			double slop = (a[j][1] - a[i][1]) * 1. / (a[i][0] - a[j][0]);
			tt.push_back({slop, {i, j}});
		}
	}
	
	vector<long double> b(n);
	vector<int> pos(n);
	for(int i=0;i<n;i++) pos[i] = i, tree.sett(i, a[i][2]);
	
	int res = tree.tree[1][0];
	sort(tt.begin(), tt.end(), [&](auto& a, auto& b){
		if(a.first != b.first) return a.first < b.first;
		if(a.second.second != b.second.second) return a.second.second > b.second.second;
		return a.second.first < b.second.first;
	});
	
	vector<int> used(n);
	
	for(int l=0;l<(int)tt.size();){
		int k = l;
		while(k < (int)tt.size() && abs(tt[l].first - tt[k].first) < eps){
			auto [i, j] = tt[k].second; k++;
			if(used[j] || used[i]) continue;
			used[j] = used[i] = 1;
			swap(pos[i], pos[j]);
			tree.sett(pos[i], a[i][2]), tree.sett(pos[j], a[j][2]);
		} while(l < k) used[tt[l].second.first] = used[tt[l].second.second] = 0, l++;

		res = max(res, tree.tree[1][0]);
	}
	
	cout<<res<<"\n";
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:84:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |    auto [i, j] = tt[k].second; k++;
      |         ^

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 232 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 3 ms 716 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 2 ms 716 KB Output is correct
33 Correct 1141 ms 66096 KB Output is correct
34 Correct 1105 ms 66180 KB Output is correct
35 Correct 1131 ms 66088 KB Output is correct
36 Correct 1119 ms 66060 KB Output is correct
37 Correct 1016 ms 66144 KB Output is correct
38 Correct 1038 ms 66148 KB Output is correct
39 Correct 1083 ms 66164 KB Output is correct
40 Correct 1039 ms 66156 KB Output is correct
41 Correct 1071 ms 66036 KB Output is correct
42 Correct 1083 ms 66068 KB Output is correct
43 Correct 1018 ms 66100 KB Output is correct
44 Correct 1008 ms 66140 KB Output is correct
45 Correct 1097 ms 66052 KB Output is correct
46 Correct 1120 ms 66084 KB Output is correct
47 Correct 1106 ms 66164 KB Output is correct
48 Correct 1114 ms 66056 KB Output is correct
49 Correct 980 ms 66060 KB Output is correct
50 Correct 1048 ms 66072 KB Output is correct
51 Correct 1056 ms 66112 KB Output is correct
52 Correct 985 ms 66044 KB Output is correct
53 Correct 983 ms 66088 KB Output is correct
54 Correct 1054 ms 66128 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 232 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 3 ms 716 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 2 ms 716 KB Output is correct
33 Correct 1141 ms 66096 KB Output is correct
34 Correct 1105 ms 66180 KB Output is correct
35 Correct 1131 ms 66088 KB Output is correct
36 Correct 1119 ms 66060 KB Output is correct
37 Correct 1016 ms 66144 KB Output is correct
38 Correct 1038 ms 66148 KB Output is correct
39 Correct 1083 ms 66164 KB Output is correct
40 Correct 1039 ms 66156 KB Output is correct
41 Correct 1071 ms 66036 KB Output is correct
42 Correct 1083 ms 66068 KB Output is correct
43 Correct 1018 ms 66100 KB Output is correct
44 Correct 1008 ms 66140 KB Output is correct
45 Correct 1097 ms 66052 KB Output is correct
46 Correct 1120 ms 66084 KB Output is correct
47 Correct 1106 ms 66164 KB Output is correct
48 Correct 1114 ms 66056 KB Output is correct
49 Correct 980 ms 66060 KB Output is correct
50 Correct 1048 ms 66072 KB Output is correct
51 Correct 1056 ms 66112 KB Output is correct
52 Correct 985 ms 66044 KB Output is correct
53 Correct 983 ms 66088 KB Output is correct
54 Correct 1054 ms 66128 KB Output is correct
55 Correct 1055 ms 66136 KB Output is correct
56 Correct 1108 ms 66196 KB Output is correct
57 Correct 1073 ms 66184 KB Output is correct
58 Correct 1036 ms 66116 KB Output is correct
59 Correct 1050 ms 66172 KB Output is correct
60 Correct 1016 ms 66132 KB Output is correct
61 Correct 1057 ms 66048 KB Output is correct
62 Correct 1145 ms 66044 KB Output is correct
63 Correct 1035 ms 66152 KB Output is correct
64 Correct 1080 ms 66144 KB Output is correct
65 Correct 1093 ms 66088 KB Output is correct
66 Correct 1059 ms 66148 KB Output is correct
67 Correct 1045 ms 66108 KB Output is correct
68 Correct 1169 ms 66192 KB Output is correct
69 Correct 1170 ms 66080 KB Output is correct
70 Correct 1049 ms 66084 KB Output is correct
71 Correct 1081 ms 66068 KB Output is correct
72 Correct 1054 ms 66104 KB Output is correct
73 Correct 1042 ms 66092 KB Output is correct
74 Correct 1031 ms 66248 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 3 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 3 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 232 KB Output is correct
36 Correct 3 ms 716 KB Output is correct
37 Correct 4 ms 716 KB Output is correct
38 Correct 4 ms 716 KB Output is correct
39 Correct 3 ms 716 KB Output is correct
40 Correct 3 ms 716 KB Output is correct
41 Correct 4 ms 716 KB Output is correct
42 Correct 2 ms 716 KB Output is correct
43 Correct 3 ms 716 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 3 ms 716 KB Output is correct
46 Correct 2 ms 716 KB Output is correct
47 Correct 2 ms 716 KB Output is correct
48 Correct 1141 ms 66096 KB Output is correct
49 Correct 1105 ms 66180 KB Output is correct
50 Correct 1131 ms 66088 KB Output is correct
51 Correct 1119 ms 66060 KB Output is correct
52 Correct 1016 ms 66144 KB Output is correct
53 Correct 1038 ms 66148 KB Output is correct
54 Correct 1083 ms 66164 KB Output is correct
55 Correct 1039 ms 66156 KB Output is correct
56 Correct 1071 ms 66036 KB Output is correct
57 Correct 1083 ms 66068 KB Output is correct
58 Correct 1018 ms 66100 KB Output is correct
59 Correct 1008 ms 66140 KB Output is correct
60 Correct 1097 ms 66052 KB Output is correct
61 Correct 1120 ms 66084 KB Output is correct
62 Correct 1106 ms 66164 KB Output is correct
63 Correct 1114 ms 66056 KB Output is correct
64 Correct 980 ms 66060 KB Output is correct
65 Correct 1048 ms 66072 KB Output is correct
66 Correct 1056 ms 66112 KB Output is correct
67 Correct 985 ms 66044 KB Output is correct
68 Correct 983 ms 66088 KB Output is correct
69 Correct 1054 ms 66128 KB Output is correct
70 Correct 1055 ms 66136 KB Output is correct
71 Correct 1108 ms 66196 KB Output is correct
72 Correct 1073 ms 66184 KB Output is correct
73 Correct 1036 ms 66116 KB Output is correct
74 Correct 1050 ms 66172 KB Output is correct
75 Correct 1016 ms 66132 KB Output is correct
76 Correct 1057 ms 66048 KB Output is correct
77 Correct 1145 ms 66044 KB Output is correct
78 Correct 1035 ms 66152 KB Output is correct
79 Correct 1080 ms 66144 KB Output is correct
80 Correct 1093 ms 66088 KB Output is correct
81 Correct 1059 ms 66148 KB Output is correct
82 Correct 1045 ms 66108 KB Output is correct
83 Correct 1169 ms 66192 KB Output is correct
84 Correct 1170 ms 66080 KB Output is correct
85 Correct 1049 ms 66084 KB Output is correct
86 Correct 1081 ms 66068 KB Output is correct
87 Correct 1054 ms 66104 KB Output is correct
88 Correct 1042 ms 66092 KB Output is correct
89 Correct 1031 ms 66248 KB Output is correct
90 Correct 1057 ms 66036 KB Output is correct
91 Correct 1012 ms 66136 KB Output is correct
92 Correct 1054 ms 66128 KB Output is correct
93 Correct 1038 ms 66040 KB Output is correct
94 Correct 1028 ms 66128 KB Output is correct
95 Correct 1075 ms 66148 KB Output is correct
96 Correct 1128 ms 66148 KB Output is correct
97 Correct 1026 ms 66072 KB Output is correct
98 Correct 1081 ms 66096 KB Output is correct
99 Correct 1041 ms 66060 KB Output is correct
100 Correct 487 ms 33252 KB Output is correct
101 Correct 469 ms 33336 KB Output is correct
102 Correct 450 ms 33316 KB Output is correct
103 Correct 497 ms 33300 KB Output is correct
104 Correct 456 ms 33328 KB Output is correct
105 Correct 649 ms 66100 KB Output is correct
106 Correct 631 ms 66176 KB Output is correct
107 Correct 628 ms 66148 KB Output is correct
108 Correct 670 ms 66148 KB Output is correct
109 Correct 724 ms 66212 KB Output is correct
110 Correct 807 ms 66148 KB Output is correct
111 Correct 831 ms 66120 KB Output is correct
112 Correct 804 ms 66040 KB Output is correct
113 Correct 777 ms 66052 KB Output is correct
114 Correct 804 ms 66104 KB Output is correct
115 Correct 895 ms 66148 KB Output is correct
116 Correct 911 ms 66148 KB Output is correct
117 Correct 808 ms 66180 KB Output is correct
118 Correct 828 ms 66092 KB Output is correct
119 Correct 782 ms 66132 KB Output is correct
120 Incorrect 1 ms 332 KB Output isn't correct
121 Halted 0 ms 0 KB -