oj.uz

Submission #514567

# Submission time Handle Problem Language Result Execution time Memory
514567 2022-01-18T09:36:46 Z amunduzbaev Bulldozer (JOI17_bulldozer) C++14
80 / 100
 1045 ms 66252 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long
 
const int N = 2005;
long double const eps = 1e-14;
 
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;
 
/*
 
6
0 1 10
0 5 10
3 0 10
3 3 -5
4 5 10
4 1 10
 
*/
 
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];
	});
	//~ cout<<"\n";
	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]);
			//~ cout<<i<<" "<<j<<" "<<slop<<"\n";
			tt.push_back({slop, {i, j}});
		}
	}
	
	vector<long double> b(n);
	vector<int> p(n); iota(p.begin(), p.end(), 0);
	
	vector<int> pos(n);
	for(int i=0;i<n;i++) pos[p[i]] = i, tree.sett(i, a[p[i]][2]);
	int res = tree.tree[1][0];
	//~ sort(tt.begin(), tt.end(), [&](auto& a, auto& b){
		//~ return (eps < b.first - a.first);
	//~ });
	sort(tt.begin(), tt.end());
	
	vector<int> used(n);
	
	for(int l=0;l<(int)tt.size();){
		int k = l;
		//~ cout<<tt[l].first<<"\n";
		while(k < (int)tt.size() && abs(tt[l].first - tt[k].first) < eps){
			auto [i, j] = tt[k].second; k++;
			//~ if(used[j]) continue;
			//~ used[j] = 1;
			//~ cout<<i<<" "<<j<<" "<<pos[i]<<" "<<pos[j]<<"\n";
			swap(p[pos[i]], p[pos[j]]);
			swap(pos[i], pos[j]);
			tree.sett(pos[i], a[i][2]), tree.sett(pos[j], a[j][2]);
			//~ k++;
		} //while(l < k) used[tt[l].second.second] = 0, l++;
		l = k;
		//~ for(int i=0;i<n;i++){
			//~ cout<<p[i]<<" ";
		//~ } cout<<"\n";
		
		res = max(res, tree.tree[1][0]);
	}
	
	cout<<res<<"\n";
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 668 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 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 1 ms 332 KB Output is correct
14 Correct 0 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 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 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 3 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 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 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 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 3 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 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 902 ms 66072 KB Output is correct
34 Correct 916 ms 66068 KB Output is correct
35 Correct 924 ms 66148 KB Output is correct
36 Correct 896 ms 66144 KB Output is correct
37 Correct 914 ms 66176 KB Output is correct
38 Correct 919 ms 66036 KB Output is correct
39 Correct 934 ms 66152 KB Output is correct
40 Correct 913 ms 66048 KB Output is correct
41 Correct 936 ms 66188 KB Output is correct
42 Correct 904 ms 66072 KB Output is correct
43 Correct 1034 ms 66132 KB Output is correct
44 Correct 1045 ms 66156 KB Output is correct
45 Correct 939 ms 66072 KB Output is correct
46 Correct 916 ms 66148 KB Output is correct
47 Correct 909 ms 66144 KB Output is correct
48 Correct 917 ms 66108 KB Output is correct
49 Correct 890 ms 66044 KB Output is correct
50 Correct 934 ms 66148 KB Output is correct
51 Correct 905 ms 66056 KB Output is correct
52 Correct 931 ms 66136 KB Output is correct
53 Correct 928 ms 66160 KB Output is correct
54 Correct 905 ms 66156 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 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 3 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 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 902 ms 66072 KB Output is correct
34 Correct 916 ms 66068 KB Output is correct
35 Correct 924 ms 66148 KB Output is correct
36 Correct 896 ms 66144 KB Output is correct
37 Correct 914 ms 66176 KB Output is correct
38 Correct 919 ms 66036 KB Output is correct
39 Correct 934 ms 66152 KB Output is correct
40 Correct 913 ms 66048 KB Output is correct
41 Correct 936 ms 66188 KB Output is correct
42 Correct 904 ms 66072 KB Output is correct
43 Correct 1034 ms 66132 KB Output is correct
44 Correct 1045 ms 66156 KB Output is correct
45 Correct 939 ms 66072 KB Output is correct
46 Correct 916 ms 66148 KB Output is correct
47 Correct 909 ms 66144 KB Output is correct
48 Correct 917 ms 66108 KB Output is correct
49 Correct 890 ms 66044 KB Output is correct
50 Correct 934 ms 66148 KB Output is correct
51 Correct 905 ms 66056 KB Output is correct
52 Correct 931 ms 66136 KB Output is correct
53 Correct 928 ms 66160 KB Output is correct
54 Correct 905 ms 66156 KB Output is correct
55 Correct 946 ms 66088 KB Output is correct
56 Correct 916 ms 66148 KB Output is correct
57 Correct 942 ms 66108 KB Output is correct
58 Correct 950 ms 66184 KB Output is correct
59 Correct 940 ms 66080 KB Output is correct
60 Correct 937 ms 66096 KB Output is correct
61 Correct 907 ms 66180 KB Output is correct
62 Correct 926 ms 66144 KB Output is correct
63 Correct 949 ms 66108 KB Output is correct
64 Correct 921 ms 66148 KB Output is correct
65 Correct 912 ms 66104 KB Output is correct
66 Correct 927 ms 66096 KB Output is correct
67 Correct 939 ms 66084 KB Output is correct
68 Correct 933 ms 66076 KB Output is correct
69 Correct 965 ms 66180 KB Output is correct
70 Correct 970 ms 66180 KB Output is correct
71 Correct 973 ms 66252 KB Output is correct
72 Correct 920 ms 66180 KB Output is correct
73 Correct 1045 ms 66128 KB Output is correct
74 Correct 997 ms 66048 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 668 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 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 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 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 3 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 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 332 KB Output is correct
36 Correct 3 ms 716 KB Output is correct
37 Correct 2 ms 716 KB Output is correct
38 Correct 2 ms 716 KB Output is correct
39 Correct 2 ms 716 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 716 KB Output is correct
43 Correct 3 ms 716 KB Output is correct
44 Correct 2 ms 716 KB Output is correct
45 Correct 2 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 902 ms 66072 KB Output is correct
49 Correct 916 ms 66068 KB Output is correct
50 Correct 924 ms 66148 KB Output is correct
51 Correct 896 ms 66144 KB Output is correct
52 Correct 914 ms 66176 KB Output is correct
53 Correct 919 ms 66036 KB Output is correct
54 Correct 934 ms 66152 KB Output is correct
55 Correct 913 ms 66048 KB Output is correct
56 Correct 936 ms 66188 KB Output is correct
57 Correct 904 ms 66072 KB Output is correct
58 Correct 1034 ms 66132 KB Output is correct
59 Correct 1045 ms 66156 KB Output is correct
60 Correct 939 ms 66072 KB Output is correct
61 Correct 916 ms 66148 KB Output is correct
62 Correct 909 ms 66144 KB Output is correct
63 Correct 917 ms 66108 KB Output is correct
64 Correct 890 ms 66044 KB Output is correct
65 Correct 934 ms 66148 KB Output is correct
66 Correct 905 ms 66056 KB Output is correct
67 Correct 931 ms 66136 KB Output is correct
68 Correct 928 ms 66160 KB Output is correct
69 Correct 905 ms 66156 KB Output is correct
70 Correct 946 ms 66088 KB Output is correct
71 Correct 916 ms 66148 KB Output is correct
72 Correct 942 ms 66108 KB Output is correct
73 Correct 950 ms 66184 KB Output is correct
74 Correct 940 ms 66080 KB Output is correct
75 Correct 937 ms 66096 KB Output is correct
76 Correct 907 ms 66180 KB Output is correct
77 Correct 926 ms 66144 KB Output is correct
78 Correct 949 ms 66108 KB Output is correct
79 Correct 921 ms 66148 KB Output is correct
80 Correct 912 ms 66104 KB Output is correct
81 Correct 927 ms 66096 KB Output is correct
82 Correct 939 ms 66084 KB Output is correct
83 Correct 933 ms 66076 KB Output is correct
84 Correct 965 ms 66180 KB Output is correct
85 Correct 970 ms 66180 KB Output is correct
86 Correct 973 ms 66252 KB Output is correct
87 Correct 920 ms 66180 KB Output is correct
88 Correct 1045 ms 66128 KB Output is correct
89 Correct 997 ms 66048 KB Output is correct
90 Correct 925 ms 66184 KB Output is correct
91 Correct 958 ms 66148 KB Output is correct
92 Correct 1010 ms 66132 KB Output is correct
93 Correct 946 ms 66144 KB Output is correct
94 Correct 919 ms 66064 KB Output is correct
95 Correct 911 ms 66220 KB Output is correct
96 Correct 925 ms 66180 KB Output is correct
97 Correct 906 ms 66148 KB Output is correct
98 Correct 893 ms 66076 KB Output is correct
99 Correct 905 ms 66124 KB Output is correct
100 Correct 407 ms 33328 KB Output is correct
101 Correct 403 ms 33260 KB Output is correct
102 Correct 417 ms 33240 KB Output is correct
103 Correct 410 ms 33376 KB Output is correct
104 Correct 410 ms 33328 KB Output is correct
105 Correct 559 ms 66152 KB Output is correct
106 Correct 574 ms 66148 KB Output is correct
107 Correct 562 ms 66148 KB Output is correct
108 Correct 549 ms 66116 KB Output is correct
109 Correct 566 ms 66176 KB Output is correct
110 Correct 831 ms 66100 KB Output is correct
111 Correct 838 ms 66072 KB Output is correct
112 Correct 830 ms 66120 KB Output is correct
113 Correct 830 ms 66180 KB Output is correct
114 Correct 853 ms 66096 KB Output is correct
115 Correct 830 ms 66132 KB Output is correct
116 Correct 823 ms 66104 KB Output is correct
117 Correct 826 ms 66180 KB Output is correct
118 Correct 819 ms 66132 KB Output is correct
119 Correct 865 ms 66148 KB Output is correct
120 Incorrect 0 ms 332 KB Output isn't correct
121 Halted 0 ms 0 KB -