답안 #224604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
224604	2020-04-18T13:39:47 Z	dolphingarlic	Bulldozer (JOI17_bulldozer)	C++14	100 / 100	1060 ms	47612 KB

bulldozer

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Node {
	ll l, r, tot, best;

	Node operator+(Node B) {
		return {max(l, tot + B.l), max(B.r, r + B.tot), tot + B.tot, max(max(best, B.best), r + B.l)};
	}
} segtree[8001];

struct Point {
	ll x, y, v;

	bool operator<(Point B) {
		if (x == B.x) return y < B.y;
		return x < B.x;
	}
} points[2001];

struct Line {
	ll dx, dy;
	int u, v;

	bool operator<(Line B) {
		if (dy * B.dx == B.dy * dx) return tie(u, v) < tie(B.u, B.v);
		return dy * B.dx < B.dy * dx;
	}
} swaps[2000001];

int n, curr[2001];

void build(int node = 1, int l = 1, int r = n) {
	if (l == r) {
		ll v = max(points[l].v, 0ll);
		segtree[node] = {v, v, points[l].v, v};
	} else {
		int mid = (l + r) / 2;
		build(node * 2, l, mid);
		build(node * 2 + 1, mid + 1, r);
		segtree[node] = segtree[node * 2] + segtree[node * 2 + 1];
	}
}

void update(int pos, ll val, int node = 1, int l = 1, int r = n) {
	if (l == r) segtree[node] = {max(val, 0ll), max(val, 0ll), val, max(val, 0ll)};
	else {
		int mid = (l + r) / 2;
		if (pos > mid) update(pos, val, node * 2 + 1, mid + 1, r);
		else update(pos, val, node * 2, l, mid);
		segtree[node] = segtree[node * 2] + segtree[node * 2 + 1];
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	FOR(i, 1, n + 1) {
		cin >> points[i].x >> points[i].y >> points[i].v;
		curr[i] = i;
	}
	sort(points + 1, points + n + 1);
	int cnt = 0;
	FOR(i, 1, n + 1) FOR(j, i + 1, n + 1)
		swaps[cnt++] = {points[j].x - points[i].x, points[j].y - points[i].y, i, j};
	sort(swaps, swaps + cnt);

	build();
	ll ans = segtree[1].best;
	FOR(i, 0, cnt) {
		update(curr[swaps[i].u], points[swaps[i].v].v);
		update(curr[swaps[i].v], points[swaps[i].u].v);
		swap(curr[swaps[i].u], curr[swaps[i].v]);

		if (i == cnt - 1) ans = max(ans, segtree[1].best);
		else if (swaps[i].dy * swaps[i + 1].dx != swaps[i + 1].dy * swaps[i].dx) ans = max(ans, segtree[1].best);
	}
	cout << ans;
	return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	6 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	7 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	6 ms	512 KB	Output is correct
22	Correct	6 ms	512 KB	Output is correct
23	Correct	6 ms	512 KB	Output is correct
24	Correct	6 ms	512 KB	Output is correct
25	Correct	6 ms	512 KB	Output is correct
26	Correct	6 ms	512 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	6 ms	512 KB	Output is correct
29	Correct	6 ms	512 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	6 ms	512 KB	Output is correct
32	Correct	6 ms	512 KB	Output is correct

Subtask #3
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	7 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	6 ms	512 KB	Output is correct
22	Correct	6 ms	512 KB	Output is correct
23	Correct	6 ms	512 KB	Output is correct
24	Correct	6 ms	512 KB	Output is correct
25	Correct	6 ms	512 KB	Output is correct
26	Correct	6 ms	512 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	6 ms	512 KB	Output is correct
29	Correct	6 ms	512 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	6 ms	512 KB	Output is correct
32	Correct	6 ms	512 KB	Output is correct
33	Correct	1022 ms	47608 KB	Output is correct
34	Correct	1006 ms	47608 KB	Output is correct
35	Correct	1002 ms	47608 KB	Output is correct
36	Correct	1000 ms	47608 KB	Output is correct
37	Correct	1010 ms	47608 KB	Output is correct
38	Correct	998 ms	47608 KB	Output is correct
39	Correct	1012 ms	47608 KB	Output is correct
40	Correct	1022 ms	47516 KB	Output is correct
41	Correct	1018 ms	47608 KB	Output is correct
42	Correct	1000 ms	47612 KB	Output is correct
43	Correct	1022 ms	47516 KB	Output is correct
44	Correct	990 ms	47480 KB	Output is correct
45	Correct	989 ms	47520 KB	Output is correct
46	Correct	1016 ms	47480 KB	Output is correct
47	Correct	991 ms	47608 KB	Output is correct
48	Correct	986 ms	47608 KB	Output is correct
49	Correct	1000 ms	47524 KB	Output is correct
50	Correct	1004 ms	47608 KB	Output is correct
51	Correct	998 ms	47608 KB	Output is correct
52	Correct	1010 ms	47480 KB	Output is correct
53	Correct	1008 ms	47392 KB	Output is correct
54	Correct	997 ms	47612 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	7 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	6 ms	512 KB	Output is correct
22	Correct	6 ms	512 KB	Output is correct
23	Correct	6 ms	512 KB	Output is correct
24	Correct	6 ms	512 KB	Output is correct
25	Correct	6 ms	512 KB	Output is correct
26	Correct	6 ms	512 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	6 ms	512 KB	Output is correct
29	Correct	6 ms	512 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	6 ms	512 KB	Output is correct
32	Correct	6 ms	512 KB	Output is correct
33	Correct	1022 ms	47608 KB	Output is correct
34	Correct	1006 ms	47608 KB	Output is correct
35	Correct	1002 ms	47608 KB	Output is correct
36	Correct	1000 ms	47608 KB	Output is correct
37	Correct	1010 ms	47608 KB	Output is correct
38	Correct	998 ms	47608 KB	Output is correct
39	Correct	1012 ms	47608 KB	Output is correct
40	Correct	1022 ms	47516 KB	Output is correct
41	Correct	1018 ms	47608 KB	Output is correct
42	Correct	1000 ms	47612 KB	Output is correct
43	Correct	1022 ms	47516 KB	Output is correct
44	Correct	990 ms	47480 KB	Output is correct
45	Correct	989 ms	47520 KB	Output is correct
46	Correct	1016 ms	47480 KB	Output is correct
47	Correct	991 ms	47608 KB	Output is correct
48	Correct	986 ms	47608 KB	Output is correct
49	Correct	1000 ms	47524 KB	Output is correct
50	Correct	1004 ms	47608 KB	Output is correct
51	Correct	998 ms	47608 KB	Output is correct
52	Correct	1010 ms	47480 KB	Output is correct
53	Correct	1008 ms	47392 KB	Output is correct
54	Correct	997 ms	47612 KB	Output is correct
55	Correct	992 ms	47608 KB	Output is correct
56	Correct	995 ms	47480 KB	Output is correct
57	Correct	996 ms	47608 KB	Output is correct
58	Correct	994 ms	47456 KB	Output is correct
59	Correct	1022 ms	47480 KB	Output is correct
60	Correct	1006 ms	47608 KB	Output is correct
61	Correct	1008 ms	47520 KB	Output is correct
62	Correct	1027 ms	47608 KB	Output is correct
63	Correct	1018 ms	47608 KB	Output is correct
64	Correct	1022 ms	47612 KB	Output is correct
65	Correct	997 ms	47480 KB	Output is correct
66	Correct	1024 ms	47608 KB	Output is correct
67	Correct	1016 ms	47608 KB	Output is correct
68	Correct	1016 ms	47584 KB	Output is correct
69	Correct	1060 ms	47608 KB	Output is correct
70	Correct	1031 ms	47608 KB	Output is correct
71	Correct	1022 ms	47608 KB	Output is correct
72	Correct	1035 ms	47480 KB	Output is correct
73	Correct	1024 ms	47608 KB	Output is correct
74	Correct	1036 ms	47608 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	6 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	6 ms	512 KB	Output is correct
17	Correct	6 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	6 ms	512 KB	Output is correct
20	Correct	6 ms	512 KB	Output is correct
21	Correct	6 ms	512 KB	Output is correct
22	Correct	7 ms	512 KB	Output is correct
23	Correct	6 ms	512 KB	Output is correct
24	Correct	6 ms	512 KB	Output is correct
25	Correct	6 ms	512 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	4 ms	384 KB	Output is correct
29	Correct	4 ms	384 KB	Output is correct
30	Correct	4 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	4 ms	384 KB	Output is correct
36	Correct	6 ms	512 KB	Output is correct
37	Correct	6 ms	512 KB	Output is correct
38	Correct	6 ms	512 KB	Output is correct
39	Correct	6 ms	512 KB	Output is correct
40	Correct	6 ms	512 KB	Output is correct
41	Correct	6 ms	512 KB	Output is correct
42	Correct	6 ms	512 KB	Output is correct
43	Correct	6 ms	512 KB	Output is correct
44	Correct	6 ms	512 KB	Output is correct
45	Correct	6 ms	512 KB	Output is correct
46	Correct	6 ms	512 KB	Output is correct
47	Correct	6 ms	512 KB	Output is correct
48	Correct	1022 ms	47608 KB	Output is correct
49	Correct	1006 ms	47608 KB	Output is correct
50	Correct	1002 ms	47608 KB	Output is correct
51	Correct	1000 ms	47608 KB	Output is correct
52	Correct	1010 ms	47608 KB	Output is correct
53	Correct	998 ms	47608 KB	Output is correct
54	Correct	1012 ms	47608 KB	Output is correct
55	Correct	1022 ms	47516 KB	Output is correct
56	Correct	1018 ms	47608 KB	Output is correct
57	Correct	1000 ms	47612 KB	Output is correct
58	Correct	1022 ms	47516 KB	Output is correct
59	Correct	990 ms	47480 KB	Output is correct
60	Correct	989 ms	47520 KB	Output is correct
61	Correct	1016 ms	47480 KB	Output is correct
62	Correct	991 ms	47608 KB	Output is correct
63	Correct	986 ms	47608 KB	Output is correct
64	Correct	1000 ms	47524 KB	Output is correct
65	Correct	1004 ms	47608 KB	Output is correct
66	Correct	998 ms	47608 KB	Output is correct
67	Correct	1010 ms	47480 KB	Output is correct
68	Correct	1008 ms	47392 KB	Output is correct
69	Correct	997 ms	47612 KB	Output is correct
70	Correct	992 ms	47608 KB	Output is correct
71	Correct	995 ms	47480 KB	Output is correct
72	Correct	996 ms	47608 KB	Output is correct
73	Correct	994 ms	47456 KB	Output is correct
74	Correct	1022 ms	47480 KB	Output is correct
75	Correct	1006 ms	47608 KB	Output is correct
76	Correct	1008 ms	47520 KB	Output is correct
77	Correct	1027 ms	47608 KB	Output is correct
78	Correct	1018 ms	47608 KB	Output is correct
79	Correct	1022 ms	47612 KB	Output is correct
80	Correct	997 ms	47480 KB	Output is correct
81	Correct	1024 ms	47608 KB	Output is correct
82	Correct	1016 ms	47608 KB	Output is correct
83	Correct	1016 ms	47584 KB	Output is correct
84	Correct	1060 ms	47608 KB	Output is correct
85	Correct	1031 ms	47608 KB	Output is correct
86	Correct	1022 ms	47608 KB	Output is correct
87	Correct	1035 ms	47480 KB	Output is correct
88	Correct	1024 ms	47608 KB	Output is correct
89	Correct	1036 ms	47608 KB	Output is correct
90	Correct	1037 ms	47608 KB	Output is correct
91	Correct	1050 ms	47608 KB	Output is correct
92	Correct	1050 ms	47608 KB	Output is correct
93	Correct	1022 ms	47608 KB	Output is correct
94	Correct	1025 ms	47608 KB	Output is correct
95	Correct	1018 ms	47480 KB	Output is correct
96	Correct	994 ms	47608 KB	Output is correct
97	Correct	1020 ms	47480 KB	Output is correct
98	Correct	1051 ms	47608 KB	Output is correct
99	Correct	1037 ms	47480 KB	Output is correct
100	Correct	847 ms	47608 KB	Output is correct
101	Correct	835 ms	47612 KB	Output is correct
102	Correct	819 ms	47608 KB	Output is correct
103	Correct	817 ms	47608 KB	Output is correct
104	Correct	831 ms	47608 KB	Output is correct
105	Correct	901 ms	47608 KB	Output is correct
106	Correct	883 ms	47520 KB	Output is correct
107	Correct	881 ms	47608 KB	Output is correct
108	Correct	885 ms	47520 KB	Output is correct
109	Correct	882 ms	47480 KB	Output is correct
110	Correct	932 ms	47608 KB	Output is correct
111	Correct	918 ms	47608 KB	Output is correct
112	Correct	914 ms	47520 KB	Output is correct
113	Correct	911 ms	47520 KB	Output is correct
114	Correct	912 ms	47608 KB	Output is correct
115	Correct	911 ms	47608 KB	Output is correct
116	Correct	950 ms	47516 KB	Output is correct
117	Correct	922 ms	47516 KB	Output is correct
118	Correct	927 ms	47528 KB	Output is correct
119	Correct	917 ms	47584 KB	Output is correct
120	Correct	5 ms	384 KB	Output is correct
121	Correct	5 ms	384 KB	Output is correct
122	Correct	1041 ms	47608 KB	Output is correct
123	Correct	1008 ms	47608 KB	Output is correct
124	Correct	1016 ms	47608 KB	Output is correct
125	Correct	1029 ms	47612 KB	Output is correct
126	Correct	1016 ms	47612 KB	Output is correct
127	Correct	1029 ms	47480 KB	Output is correct
128	Correct	997 ms	47480 KB	Output is correct
129	Correct	999 ms	47480 KB	Output is correct
130	Correct	1002 ms	47608 KB	Output is correct
131	Correct	1008 ms	47608 KB	Output is correct
132	Correct	1016 ms	47608 KB	Output is correct
133	Correct	992 ms	47528 KB	Output is correct

답안 #224604

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 20.0 / 20.0

Subtask #3 35.0 / 35.0

Subtask #4 20.0 / 20.0

Subtask #5 20.0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
20.0 / 20.0

Subtask #3
35.0 / 35.0

Subtask #4
20.0 / 20.0

Subtask #5
20.0 / 20.0