oj.uz

Submission #514566

# Submission time Handle Problem Language Result Execution time Memory
514566 2022-01-18T09:34:57 Z amunduzbaev Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1006 ms 66208 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);
	});
	
	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:86:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |    auto [i, j] = tt[k].second; k++;
      |         ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.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 3 ms 716 KB Output is correct
6 Correct 2 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 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 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 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 3 ms 716 KB Output is correct
23 Correct 3 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 2 ms 716 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 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 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 3 ms 716 KB Output is correct
6 Correct 2 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 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 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 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 3 ms 716 KB Output is correct
23 Correct 3 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 2 ms 716 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 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 1000 ms 66140 KB Output is correct
34 Correct 943 ms 66120 KB Output is correct
35 Correct 960 ms 66148 KB Output is correct
36 Correct 944 ms 66092 KB Output is correct
37 Correct 954 ms 66060 KB Output is correct
38 Correct 1000 ms 66068 KB Output is correct
39 Correct 964 ms 66184 KB Output is correct
40 Correct 960 ms 66208 KB Output is correct
41 Correct 988 ms 66188 KB Output is correct
42 Correct 950 ms 66160 KB Output is correct
43 Correct 949 ms 66140 KB Output is correct
44 Correct 962 ms 66180 KB Output is correct
45 Correct 948 ms 66156 KB Output is correct
46 Correct 929 ms 66180 KB Output is correct
47 Correct 936 ms 66140 KB Output is correct
48 Correct 949 ms 66124 KB Output is correct
49 Correct 956 ms 66120 KB Output is correct
50 Correct 939 ms 66180 KB Output is correct
51 Correct 939 ms 66136 KB Output is correct
52 Correct 945 ms 66172 KB Output is correct
53 Correct 977 ms 66180 KB Output is correct
54 Correct 956 ms 66032 KB Output is correct

Subtask #4
20.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 3 ms 716 KB Output is correct
6 Correct 2 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 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 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 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 3 ms 716 KB Output is correct
23 Correct 3 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 2 ms 716 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 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 1000 ms 66140 KB Output is correct
34 Correct 943 ms 66120 KB Output is correct
35 Correct 960 ms 66148 KB Output is correct
36 Correct 944 ms 66092 KB Output is correct
37 Correct 954 ms 66060 KB Output is correct
38 Correct 1000 ms 66068 KB Output is correct
39 Correct 964 ms 66184 KB Output is correct
40 Correct 960 ms 66208 KB Output is correct
41 Correct 988 ms 66188 KB Output is correct
42 Correct 950 ms 66160 KB Output is correct
43 Correct 949 ms 66140 KB Output is correct
44 Correct 962 ms 66180 KB Output is correct
45 Correct 948 ms 66156 KB Output is correct
46 Correct 929 ms 66180 KB Output is correct
47 Correct 936 ms 66140 KB Output is correct
48 Correct 949 ms 66124 KB Output is correct
49 Correct 956 ms 66120 KB Output is correct
50 Correct 939 ms 66180 KB Output is correct
51 Correct 939 ms 66136 KB Output is correct
52 Correct 945 ms 66172 KB Output is correct
53 Correct 977 ms 66180 KB Output is correct
54 Correct 956 ms 66032 KB Output is correct
55 Correct 949 ms 66128 KB Output is correct
56 Correct 958 ms 66200 KB Output is correct
57 Correct 945 ms 66136 KB Output is correct
58 Correct 965 ms 66152 KB Output is correct
59 Correct 971 ms 66100 KB Output is correct
60 Correct 998 ms 66092 KB Output is correct
61 Correct 936 ms 66108 KB Output is correct
62 Correct 969 ms 66108 KB Output is correct
63 Correct 987 ms 66164 KB Output is correct
64 Correct 956 ms 66120 KB Output is correct
65 Correct 943 ms 66112 KB Output is correct
66 Correct 1006 ms 66076 KB Output is correct
67 Correct 941 ms 66180 KB Output is correct
68 Correct 954 ms 66180 KB Output is correct
69 Correct 995 ms 66188 KB Output is correct
70 Correct 933 ms 66084 KB Output is correct
71 Correct 978 ms 66116 KB Output is correct
72 Correct 939 ms 66092 KB Output is correct
73 Correct 948 ms 66208 KB Output is correct
74 Correct 945 ms 66148 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -