oj.uz

Submission #395222

# Submission time Handle Problem Language Result Execution time Memory
395222 2021-04-28T03:10:16 Z ChrisT Bulldozer (JOI17_bulldozer) C++17
80 / 100
 2000 ms 81996 KB 
#include <bits/stdc++.h>
using namespace std;
const int MN = 2e3 + 5;
#define lc ind<<1
#define rc ind<<1|1
struct Node {
	long long mn,mx;
} tree[MN<<1];
void update (int i, long long v) {
	i+=MN-1;
	for (tree[i].mn=tree[i].mx=v;i>1;i>>=1) {
		tree[i>>1].mn = min(tree[i].mn,tree[i^1].mn);
		tree[i>>1].mx = max(tree[i].mx,tree[i^1].mx);
	}
}
long long queryMin (int l, int r) {
	long long ret = LLONG_MAX;
	for (l += MN-1, r += MN; l < r; l >>= 1, r >>= 1) {
		if (l&1) ret = min(ret,tree[l++].mn);
		if (r&1) ret = min(ret,tree[--r].mn);
	}
	return ret;
}
long long queryMax (int l, int r) {
	long long ret = LLONG_MIN;
	for (l += MN-1, r += MN; l < r; l >>= 1, r >>= 1) {
		if (l&1) ret = max(ret,tree[l++].mx);
		if (r&1) ret = max(ret,tree[--r].mx);
	}
	return ret;
}
int main () {
	int n,c=0; scanf ("%d",&n);
	vector<array<int,4>> pts(n); vector<int> pos(n), ow(n);
	vector<long long> vAt(n+1); vector<int> pAt(n+1);
	for (auto &[x,y,w,id] : pts) scanf ("%d %d %d",&x,&y,&w), id=c++, ow[id] = w;
	vector<tuple<int,int,long long,int,int>> events;
	for (int i = 0; i < n; i++) {
		for (int j = i+1; j < n; j++) {
			int dx = pts[i][0] - pts[j][0], dy = pts[i][1] - pts[j][1];
			if (dx < 0) dx = -dx, dy = -dy;
			if (dx == 0 && dy < 0) dy = -dy;
			events.push_back({dx,dy,(long long)dx * pts[i][1] - (long long)dy * pts[i][0],i,j});
		}
	}
	sort(pts.begin(),pts.end());
	auto cmp = [&] (const auto &a, const auto &b) {
		long long getA = (long long)get<1>(a) * get<0>(b), getB = (long long)get<1>(b) * get<0>(a);
		return getA > getB || (getA == getB && get<2>(a) < get<2>(b));
	};
	sort(events.begin(),events.end(),[&](const auto &a, const auto &b) {return cmp(a,b);});
	long long ret = 0, pre = 0;
	for (int i = 0; i < n; i++) {
		pos[pts[i][3]] = i+1; ret = max(ret,(long long)pts[i][2]);
		pre += pts[i][2]; vAt[i+1] = pre; pAt[i+1] = pts[i][3];
		update(i+1,pre);
	}
	vector<vector<array<int,2>>> cur;
	auto solve = [&] () {
		for (auto &v : cur) {
			int mn = 1e9, mx = -1e9;
			for (auto &[i,j] : v) mn = min({mn,pos[i],pos[j]}), mx = max({mx,pos[i],pos[j]});
			reverse(pAt.begin()+mn,pAt.begin()+mx+1);
			for (int i = mn; i <= mx; i++) {
				pos[pAt[i]] = i;
				vAt[i] = vAt[i-1] + ow[pAt[i]];
				update(i,vAt[i]);
			}
		}
		for (auto &v : cur) {
			int mn = 1e9, mx = -1e9;
			for (auto &[i,j] : v) mn = min({mn,pos[i],pos[j]}), mx = max({mx,pos[i],pos[j]});
			//go right
			long long get = queryMax(mx,n);
			for (int i = mx; i >= mn-1; i--) ret = max(ret,get - vAt[i]);
			//go left
			get = min(0LL,queryMin(1,mn-1));
			for (int i = mn-1; i <= mx; i++) ret = max(ret,vAt[i] - get);
			//go middle?
			long long best = vAt[mn-1];
			for (int i = mn; i <= mx; i++) {
				best = min(best,vAt[i]);
				ret = max(ret,vAt[i] - best);
			}
		}
	};
	for (int idx = 0; idx < (int)events.size(); idx++) {
		if (idx > 0 && (long long)get<1>(events[idx]) * get<0>(events[idx-1]) != (long long)get<0>(events[idx]) * get<1>(events[idx-1])) {
			solve();
			cur.clear();
		}
		if (!cur.empty() && cmp(events[idx],events[idx-1]) == cmp(events[idx-1],events[idx])) cur.back().push_back({get<3>(events[idx]),get<4>(events[idx])});
		else cur.push_back({{get<3>(events[idx]),get<4>(events[idx])}});
	}
	if (!cur.empty()) solve();
	printf ("%lld\n",ret);
	return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:33:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |  int n,c=0; scanf ("%d",&n);
      |             ~~~~~~^~~~~~~~~
bulldozer.cpp:36:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |  for (auto &[x,y,w,id] : pts) scanf ("%d %d %d",&x,&y,&w), id=c++, ow[id] = w;
      |                               ~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 928 ms 49708 KB Output is correct
34 Correct 889 ms 49700 KB Output is correct
35 Correct 884 ms 49656 KB Output is correct
36 Correct 873 ms 49740 KB Output is correct
37 Correct 870 ms 49664 KB Output is correct
38 Correct 895 ms 49712 KB Output is correct
39 Correct 872 ms 49656 KB Output is correct
40 Correct 904 ms 49684 KB Output is correct
41 Correct 891 ms 49656 KB Output is correct
42 Correct 874 ms 49660 KB Output is correct
43 Correct 863 ms 49680 KB Output is correct
44 Correct 875 ms 49740 KB Output is correct
45 Correct 899 ms 49680 KB Output is correct
46 Correct 894 ms 49676 KB Output is correct
47 Correct 856 ms 49656 KB Output is correct
48 Correct 902 ms 49684 KB Output is correct
49 Correct 918 ms 49680 KB Output is correct
50 Correct 885 ms 49680 KB Output is correct
51 Correct 868 ms 49672 KB Output is correct
52 Correct 898 ms 49680 KB Output is correct
53 Correct 873 ms 49656 KB Output is correct
54 Correct 928 ms 49680 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 928 ms 49708 KB Output is correct
34 Correct 889 ms 49700 KB Output is correct
35 Correct 884 ms 49656 KB Output is correct
36 Correct 873 ms 49740 KB Output is correct
37 Correct 870 ms 49664 KB Output is correct
38 Correct 895 ms 49712 KB Output is correct
39 Correct 872 ms 49656 KB Output is correct
40 Correct 904 ms 49684 KB Output is correct
41 Correct 891 ms 49656 KB Output is correct
42 Correct 874 ms 49660 KB Output is correct
43 Correct 863 ms 49680 KB Output is correct
44 Correct 875 ms 49740 KB Output is correct
45 Correct 899 ms 49680 KB Output is correct
46 Correct 894 ms 49676 KB Output is correct
47 Correct 856 ms 49656 KB Output is correct
48 Correct 902 ms 49684 KB Output is correct
49 Correct 918 ms 49680 KB Output is correct
50 Correct 885 ms 49680 KB Output is correct
51 Correct 868 ms 49672 KB Output is correct
52 Correct 898 ms 49680 KB Output is correct
53 Correct 873 ms 49656 KB Output is correct
54 Correct 928 ms 49680 KB Output is correct
55 Correct 943 ms 49724 KB Output is correct
56 Correct 914 ms 49720 KB Output is correct
57 Correct 920 ms 49752 KB Output is correct
58 Correct 906 ms 49700 KB Output is correct
59 Correct 893 ms 49640 KB Output is correct
60 Correct 872 ms 49680 KB Output is correct
61 Correct 880 ms 49644 KB Output is correct
62 Correct 871 ms 49712 KB Output is correct
63 Correct 902 ms 49680 KB Output is correct
64 Correct 901 ms 49680 KB Output is correct
65 Correct 912 ms 49668 KB Output is correct
66 Correct 885 ms 49808 KB Output is correct
67 Correct 903 ms 49688 KB Output is correct
68 Correct 890 ms 49648 KB Output is correct
69 Correct 908 ms 49696 KB Output is correct
70 Correct 874 ms 49808 KB Output is correct
71 Correct 929 ms 49680 KB Output is correct
72 Correct 931 ms 49696 KB Output is correct
73 Correct 913 ms 49708 KB Output is correct
74 Correct 864 ms 49700 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 2 ms 588 KB Output is correct
37 Correct 3 ms 588 KB Output is correct
38 Correct 3 ms 588 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 2 ms 588 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 2 ms 588 KB Output is correct
44 Correct 2 ms 588 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 3 ms 588 KB Output is correct
47 Correct 2 ms 588 KB Output is correct
48 Correct 928 ms 49708 KB Output is correct
49 Correct 889 ms 49700 KB Output is correct
50 Correct 884 ms 49656 KB Output is correct
51 Correct 873 ms 49740 KB Output is correct
52 Correct 870 ms 49664 KB Output is correct
53 Correct 895 ms 49712 KB Output is correct
54 Correct 872 ms 49656 KB Output is correct
55 Correct 904 ms 49684 KB Output is correct
56 Correct 891 ms 49656 KB Output is correct
57 Correct 874 ms 49660 KB Output is correct
58 Correct 863 ms 49680 KB Output is correct
59 Correct 875 ms 49740 KB Output is correct
60 Correct 899 ms 49680 KB Output is correct
61 Correct 894 ms 49676 KB Output is correct
62 Correct 856 ms 49656 KB Output is correct
63 Correct 902 ms 49684 KB Output is correct
64 Correct 918 ms 49680 KB Output is correct
65 Correct 885 ms 49680 KB Output is correct
66 Correct 868 ms 49672 KB Output is correct
67 Correct 898 ms 49680 KB Output is correct
68 Correct 873 ms 49656 KB Output is correct
69 Correct 928 ms 49680 KB Output is correct
70 Correct 943 ms 49724 KB Output is correct
71 Correct 914 ms 49720 KB Output is correct
72 Correct 920 ms 49752 KB Output is correct
73 Correct 906 ms 49700 KB Output is correct
74 Correct 893 ms 49640 KB Output is correct
75 Correct 872 ms 49680 KB Output is correct
76 Correct 880 ms 49644 KB Output is correct
77 Correct 871 ms 49712 KB Output is correct
78 Correct 902 ms 49680 KB Output is correct
79 Correct 901 ms 49680 KB Output is correct
80 Correct 912 ms 49668 KB Output is correct
81 Correct 885 ms 49808 KB Output is correct
82 Correct 903 ms 49688 KB Output is correct
83 Correct 890 ms 49648 KB Output is correct
84 Correct 908 ms 49696 KB Output is correct
85 Correct 874 ms 49808 KB Output is correct
86 Correct 929 ms 49680 KB Output is correct
87 Correct 931 ms 49696 KB Output is correct
88 Correct 913 ms 49708 KB Output is correct
89 Correct 864 ms 49700 KB Output is correct
90 Correct 889 ms 49736 KB Output is correct
91 Correct 869 ms 49660 KB Output is correct
92 Correct 904 ms 49712 KB Output is correct
93 Correct 934 ms 49680 KB Output is correct
94 Correct 877 ms 49696 KB Output is correct
95 Correct 876 ms 49712 KB Output is correct
96 Correct 879 ms 49748 KB Output is correct
97 Correct 879 ms 49700 KB Output is correct
98 Correct 884 ms 49740 KB Output is correct
99 Correct 899 ms 49696 KB Output is correct
100 Execution timed out 2091 ms 81996 KB Time limit exceeded
101 Halted 0 ms 0 KB -