oj.uz

Submission #514526

# Submission time Handle Problem Language Result Execution time Memory
514526 2022-01-18T08:47:21 Z amunduzbaev Bulldozer (JOI17_bulldozer) C++14
80 / 100
 2000 ms 66268 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

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

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]);
	}
}tree;

/*

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

6
2 2 10
4 1 10
5 2 10
2 5 10
4 4 -5
5 5 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];
	});
	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<int> pos(n), used(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;
		return a.second.second - a.second.first > b.second.second - b.second.first;
	});
	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[i] = used[j] = 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]);
	}
	
	for(auto& x : a) swap(x[0], x[1]);
	sort(a.begin(), a.end(), [&](auto& a, auto& b){
		if(a[0] != b[0]) return a[0] < b[0];
		return a[1] > b[1];
	}); tt.clear();
	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}});
		}
	} fill(used.begin(), used.end(), 0);
	for(int i=0;i<n;i++) pos[i] = i, tree.sett(i, a[i][2]);
	res = max(res, tree.tree[1][0]);
	sort(tt.begin(), tt.end(), [&](auto& a, auto& b){
		if(a.first != b.first) return a.first < b.first;
		return a.second.second - a.second.first > b.second.second - b.second.first;
	});
	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[i] = used[j] = 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:78:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   78 |    auto [i, j] = tt[k].second; k++;
      |         ^
bulldozer.cpp:108:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  108 |    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 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 588 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 588 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 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 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 4 ms 716 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 1 ms 260 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 0 ms 332 KB Output is correct
17 Correct 0 ms 204 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 204 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 4 ms 588 KB Output is correct
25 Correct 4 ms 716 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 4 ms 716 KB Output is correct
29 Correct 4 ms 716 KB Output is correct
30 Correct 4 ms 716 KB Output is correct
31 Correct 4 ms 716 KB Output is correct
32 Correct 4 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 4 ms 716 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 1 ms 260 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 0 ms 332 KB Output is correct
17 Correct 0 ms 204 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 204 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 4 ms 588 KB Output is correct
25 Correct 4 ms 716 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 4 ms 716 KB Output is correct
29 Correct 4 ms 716 KB Output is correct
30 Correct 4 ms 716 KB Output is correct
31 Correct 4 ms 716 KB Output is correct
32 Correct 4 ms 716 KB Output is correct
33 Correct 1814 ms 66128 KB Output is correct
34 Correct 1822 ms 66116 KB Output is correct
35 Correct 1827 ms 66148 KB Output is correct
36 Correct 1815 ms 66148 KB Output is correct
37 Correct 1867 ms 66184 KB Output is correct
38 Correct 1826 ms 66092 KB Output is correct
39 Correct 1811 ms 66144 KB Output is correct
40 Correct 1889 ms 66068 KB Output is correct
41 Correct 1911 ms 66080 KB Output is correct
42 Correct 1969 ms 66148 KB Output is correct
43 Correct 1897 ms 66108 KB Output is correct
44 Correct 1965 ms 66084 KB Output is correct
45 Correct 1815 ms 66160 KB Output is correct
46 Correct 1823 ms 66176 KB Output is correct
47 Correct 1807 ms 66080 KB Output is correct
48 Correct 1836 ms 66212 KB Output is correct
49 Correct 1814 ms 66160 KB Output is correct
50 Correct 1803 ms 66072 KB Output is correct
51 Correct 1847 ms 66160 KB Output is correct
52 Correct 1816 ms 66120 KB Output is correct
53 Correct 1825 ms 66044 KB Output is correct
54 Correct 1890 ms 66088 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 4 ms 716 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 1 ms 260 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 0 ms 332 KB Output is correct
17 Correct 0 ms 204 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 204 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 4 ms 588 KB Output is correct
25 Correct 4 ms 716 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 4 ms 716 KB Output is correct
29 Correct 4 ms 716 KB Output is correct
30 Correct 4 ms 716 KB Output is correct
31 Correct 4 ms 716 KB Output is correct
32 Correct 4 ms 716 KB Output is correct
33 Correct 1814 ms 66128 KB Output is correct
34 Correct 1822 ms 66116 KB Output is correct
35 Correct 1827 ms 66148 KB Output is correct
36 Correct 1815 ms 66148 KB Output is correct
37 Correct 1867 ms 66184 KB Output is correct
38 Correct 1826 ms 66092 KB Output is correct
39 Correct 1811 ms 66144 KB Output is correct
40 Correct 1889 ms 66068 KB Output is correct
41 Correct 1911 ms 66080 KB Output is correct
42 Correct 1969 ms 66148 KB Output is correct
43 Correct 1897 ms 66108 KB Output is correct
44 Correct 1965 ms 66084 KB Output is correct
45 Correct 1815 ms 66160 KB Output is correct
46 Correct 1823 ms 66176 KB Output is correct
47 Correct 1807 ms 66080 KB Output is correct
48 Correct 1836 ms 66212 KB Output is correct
49 Correct 1814 ms 66160 KB Output is correct
50 Correct 1803 ms 66072 KB Output is correct
51 Correct 1847 ms 66160 KB Output is correct
52 Correct 1816 ms 66120 KB Output is correct
53 Correct 1825 ms 66044 KB Output is correct
54 Correct 1890 ms 66088 KB Output is correct
55 Correct 1892 ms 66164 KB Output is correct
56 Correct 1835 ms 66068 KB Output is correct
57 Correct 1812 ms 66148 KB Output is correct
58 Correct 1883 ms 66180 KB Output is correct
59 Correct 1799 ms 66140 KB Output is correct
60 Correct 1866 ms 66144 KB Output is correct
61 Correct 1793 ms 66088 KB Output is correct
62 Correct 1893 ms 66068 KB Output is correct
63 Correct 1855 ms 66160 KB Output is correct
64 Correct 1859 ms 66080 KB Output is correct
65 Correct 1911 ms 66160 KB Output is correct
66 Correct 1847 ms 66176 KB Output is correct
67 Correct 1906 ms 66068 KB Output is correct
68 Correct 1826 ms 66152 KB Output is correct
69 Correct 1845 ms 66044 KB Output is correct
70 Correct 1806 ms 66064 KB Output is correct
71 Correct 1879 ms 66152 KB Output is correct
72 Correct 1847 ms 66268 KB Output is correct
73 Correct 1951 ms 66156 KB Output is correct
74 Correct 1975 ms 66096 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 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 588 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 588 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 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 0 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 4 ms 716 KB Output is correct
18 Correct 5 ms 716 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 5 ms 716 KB Output is correct
21 Correct 4 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 6 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 1 ms 260 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 0 ms 332 KB Output is correct
32 Correct 0 ms 204 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 204 KB Output is correct
36 Correct 4 ms 600 KB Output is correct
37 Correct 4 ms 716 KB Output is correct
38 Correct 4 ms 716 KB Output is correct
39 Correct 4 ms 588 KB Output is correct
40 Correct 4 ms 716 KB Output is correct
41 Correct 4 ms 716 KB Output is correct
42 Correct 4 ms 588 KB Output is correct
43 Correct 4 ms 716 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 4 ms 716 KB Output is correct
46 Correct 4 ms 716 KB Output is correct
47 Correct 4 ms 716 KB Output is correct
48 Correct 1814 ms 66128 KB Output is correct
49 Correct 1822 ms 66116 KB Output is correct
50 Correct 1827 ms 66148 KB Output is correct
51 Correct 1815 ms 66148 KB Output is correct
52 Correct 1867 ms 66184 KB Output is correct
53 Correct 1826 ms 66092 KB Output is correct
54 Correct 1811 ms 66144 KB Output is correct
55 Correct 1889 ms 66068 KB Output is correct
56 Correct 1911 ms 66080 KB Output is correct
57 Correct 1969 ms 66148 KB Output is correct
58 Correct 1897 ms 66108 KB Output is correct
59 Correct 1965 ms 66084 KB Output is correct
60 Correct 1815 ms 66160 KB Output is correct
61 Correct 1823 ms 66176 KB Output is correct
62 Correct 1807 ms 66080 KB Output is correct
63 Correct 1836 ms 66212 KB Output is correct
64 Correct 1814 ms 66160 KB Output is correct
65 Correct 1803 ms 66072 KB Output is correct
66 Correct 1847 ms 66160 KB Output is correct
67 Correct 1816 ms 66120 KB Output is correct
68 Correct 1825 ms 66044 KB Output is correct
69 Correct 1890 ms 66088 KB Output is correct
70 Correct 1892 ms 66164 KB Output is correct
71 Correct 1835 ms 66068 KB Output is correct
72 Correct 1812 ms 66148 KB Output is correct
73 Correct 1883 ms 66180 KB Output is correct
74 Correct 1799 ms 66140 KB Output is correct
75 Correct 1866 ms 66144 KB Output is correct
76 Correct 1793 ms 66088 KB Output is correct
77 Correct 1893 ms 66068 KB Output is correct
78 Correct 1855 ms 66160 KB Output is correct
79 Correct 1859 ms 66080 KB Output is correct
80 Correct 1911 ms 66160 KB Output is correct
81 Correct 1847 ms 66176 KB Output is correct
82 Correct 1906 ms 66068 KB Output is correct
83 Correct 1826 ms 66152 KB Output is correct
84 Correct 1845 ms 66044 KB Output is correct
85 Correct 1806 ms 66064 KB Output is correct
86 Correct 1879 ms 66152 KB Output is correct
87 Correct 1847 ms 66268 KB Output is correct
88 Correct 1951 ms 66156 KB Output is correct
89 Correct 1975 ms 66096 KB Output is correct
90 Execution timed out 2083 ms 66124 KB Time limit exceeded
91 Halted 0 ms 0 KB -