oj.uz

Submission #265450

# Submission time Handle Problem Language Result Execution time Memory
265450 2020-08-14T20:58:56 Z islingr Bulldozer (JOI17_bulldozer) C++17
100 / 100
 1525 ms 108152 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = int64_t;
struct S {
	ll pref, suff, ans, sum;
	S(ll x = 0) : sum{x} { ans = pref = suff = x > 0 ? x : 0; }
	S(const S &l, const S &r) : ans{max(l.ans, r.ans)} {
		pref = max(l.pref, l.sum + r.pref);
		suff = max(l.suff + r.sum, r.suff);
		ans = max(ans, l.suff + r.pref);
		sum = l.sum + r.sum;
	}
} t[1 << 12];

int sz = 1;
void update(int p, ll x) { for (t[p += sz] = x; p >>= 1; ) t[p] = {t[p << 1], t[p << 1|1]}; }

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x...) begin(x), end(x)

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }

using point = complex<ll>;
ll cross(const point &a, const point &b) { return imag(conj(a) * b); }

const int N = 1 << 11;
int w[N], ord[N], pos[N];
point p[N];
vector<int> g[N], line;
bool vis[N];

void dfs(int u) {
	vis[u] = 1; line.push_back(u);
	for (int v : g[u]) if (!vis[v]) dfs(v);
}

pair<point, pair<int, int>> m[N * N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n; cin >> n; while (sz < n) sz <<= 1;
	rep(i, 0, n) { int x, y; cin >> x >> y >> w[i]; p[i] = {x, y}; ord[i] = i; }
	sort(ord, ord + n, [&](int a, int b) {
		return pair(imag(p[a]), -real(p[a])) < pair(imag(p[b]), -real(p[b]));
	});
	rep(i, 0, n) pos[ord[i]] = i;
	rep(i, 0, n) update(pos[i], w[i]);

	int c = 0;
	rep(i, 0, n) {
		rep(j, i + 1, n) {
			point z = p[i] - p[j];
			ll g = gcd(real(z), imag(z));
			z = {real(z) / g, imag(z) / g};
			if (imag(z) <= 0) z = -z;
			m[c++] = {z, {i, j}};
			m[c++] = {z, {j, i}};
		}
	}
	sort(m, m + c, [&](auto a, auto b) { return cross(a.first, b.first) > 0; });

	ll ans = t[1].ans;
	for (int i = 0, j = 0; i < c; i = j) {
		while (j < c && m[i].first == m[j].first) ++j;
		rep(k, i, j) g[m[k].second.first].push_back(m[k].second.second);
		rep(k, i, j) {
			if (vis[m[k].second.first]) continue;
			line.clear(); dfs(m[k].second.first);
			sort(all(line), [&](int x, int y) { return pos[x] < pos[y];});
			int s = line.size();
			for (int i = 0; i < s - i - 1; ++i)
				swap(pos[line[i]], pos[line[s - i - 1]]);
			for (int i : line) update(pos[i], w[i]);
		}
		ans = max(ans, t[1].ans);
		rep(k, i, j) g[m[k].second.first].clear(), vis[m[k].second.first] = 0;
	}

	cout << ans << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 3 ms 768 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 3 ms 768 KB Output is correct
26 Correct 4 ms 768 KB Output is correct
27 Correct 3 ms 768 KB Output is correct
28 Correct 3 ms 768 KB Output is correct
29 Correct 3 ms 768 KB Output is correct
30 Correct 3 ms 768 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 1453 ms 94632 KB Output is correct
34 Correct 1423 ms 94732 KB Output is correct
35 Correct 1426 ms 94632 KB Output is correct
36 Correct 1429 ms 94584 KB Output is correct
37 Correct 1438 ms 94584 KB Output is correct
38 Correct 1453 ms 94584 KB Output is correct
39 Correct 1525 ms 94584 KB Output is correct
40 Correct 1424 ms 94636 KB Output is correct
41 Correct 1430 ms 94804 KB Output is correct
42 Correct 1472 ms 94584 KB Output is correct
43 Correct 1430 ms 94644 KB Output is correct
44 Correct 1367 ms 94512 KB Output is correct
45 Correct 1367 ms 94636 KB Output is correct
46 Correct 1403 ms 94584 KB Output is correct
47 Correct 1400 ms 94584 KB Output is correct
48 Correct 1391 ms 94652 KB Output is correct
49 Correct 1381 ms 94668 KB Output is correct
50 Correct 1384 ms 94888 KB Output is correct
51 Correct 1382 ms 94608 KB Output is correct
52 Correct 1392 ms 94632 KB Output is correct
53 Correct 1370 ms 94636 KB Output is correct
54 Correct 1361 ms 94572 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 3 ms 768 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 3 ms 768 KB Output is correct
26 Correct 4 ms 768 KB Output is correct
27 Correct 3 ms 768 KB Output is correct
28 Correct 3 ms 768 KB Output is correct
29 Correct 3 ms 768 KB Output is correct
30 Correct 3 ms 768 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 1453 ms 94632 KB Output is correct
34 Correct 1423 ms 94732 KB Output is correct
35 Correct 1426 ms 94632 KB Output is correct
36 Correct 1429 ms 94584 KB Output is correct
37 Correct 1438 ms 94584 KB Output is correct
38 Correct 1453 ms 94584 KB Output is correct
39 Correct 1525 ms 94584 KB Output is correct
40 Correct 1424 ms 94636 KB Output is correct
41 Correct 1430 ms 94804 KB Output is correct
42 Correct 1472 ms 94584 KB Output is correct
43 Correct 1430 ms 94644 KB Output is correct
44 Correct 1367 ms 94512 KB Output is correct
45 Correct 1367 ms 94636 KB Output is correct
46 Correct 1403 ms 94584 KB Output is correct
47 Correct 1400 ms 94584 KB Output is correct
48 Correct 1391 ms 94652 KB Output is correct
49 Correct 1381 ms 94668 KB Output is correct
50 Correct 1384 ms 94888 KB Output is correct
51 Correct 1382 ms 94608 KB Output is correct
52 Correct 1392 ms 94632 KB Output is correct
53 Correct 1370 ms 94636 KB Output is correct
54 Correct 1361 ms 94572 KB Output is correct
55 Correct 1414 ms 94524 KB Output is correct
56 Correct 1454 ms 94712 KB Output is correct
57 Correct 1447 ms 94652 KB Output is correct
58 Correct 1452 ms 94504 KB Output is correct
59 Correct 1427 ms 94632 KB Output is correct
60 Correct 1484 ms 94712 KB Output is correct
61 Correct 1406 ms 94840 KB Output is correct
62 Correct 1452 ms 94584 KB Output is correct
63 Correct 1423 ms 94584 KB Output is correct
64 Correct 1421 ms 94652 KB Output is correct
65 Correct 1408 ms 94764 KB Output is correct
66 Correct 1497 ms 94676 KB Output is correct
67 Correct 1451 ms 94712 KB Output is correct
68 Correct 1427 ms 94456 KB Output is correct
69 Correct 1463 ms 94456 KB Output is correct
70 Correct 1435 ms 94576 KB Output is correct
71 Correct 1415 ms 94712 KB Output is correct
72 Correct 1455 ms 94584 KB Output is correct
73 Correct 1459 ms 94456 KB Output is correct
74 Correct 1431 ms 94584 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 0 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 4 ms 768 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 3 ms 768 KB Output is correct
22 Correct 4 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 3 ms 768 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 3 ms 768 KB Output is correct
37 Correct 3 ms 768 KB Output is correct
38 Correct 3 ms 768 KB Output is correct
39 Correct 3 ms 768 KB Output is correct
40 Correct 3 ms 768 KB Output is correct
41 Correct 4 ms 768 KB Output is correct
42 Correct 3 ms 768 KB Output is correct
43 Correct 3 ms 768 KB Output is correct
44 Correct 3 ms 768 KB Output is correct
45 Correct 3 ms 768 KB Output is correct
46 Correct 3 ms 768 KB Output is correct
47 Correct 3 ms 768 KB Output is correct
48 Correct 1453 ms 94632 KB Output is correct
49 Correct 1423 ms 94732 KB Output is correct
50 Correct 1426 ms 94632 KB Output is correct
51 Correct 1429 ms 94584 KB Output is correct
52 Correct 1438 ms 94584 KB Output is correct
53 Correct 1453 ms 94584 KB Output is correct
54 Correct 1525 ms 94584 KB Output is correct
55 Correct 1424 ms 94636 KB Output is correct
56 Correct 1430 ms 94804 KB Output is correct
57 Correct 1472 ms 94584 KB Output is correct
58 Correct 1430 ms 94644 KB Output is correct
59 Correct 1367 ms 94512 KB Output is correct
60 Correct 1367 ms 94636 KB Output is correct
61 Correct 1403 ms 94584 KB Output is correct
62 Correct 1400 ms 94584 KB Output is correct
63 Correct 1391 ms 94652 KB Output is correct
64 Correct 1381 ms 94668 KB Output is correct
65 Correct 1384 ms 94888 KB Output is correct
66 Correct 1382 ms 94608 KB Output is correct
67 Correct 1392 ms 94632 KB Output is correct
68 Correct 1370 ms 94636 KB Output is correct
69 Correct 1361 ms 94572 KB Output is correct
70 Correct 1414 ms 94524 KB Output is correct
71 Correct 1454 ms 94712 KB Output is correct
72 Correct 1447 ms 94652 KB Output is correct
73 Correct 1452 ms 94504 KB Output is correct
74 Correct 1427 ms 94632 KB Output is correct
75 Correct 1484 ms 94712 KB Output is correct
76 Correct 1406 ms 94840 KB Output is correct
77 Correct 1452 ms 94584 KB Output is correct
78 Correct 1423 ms 94584 KB Output is correct
79 Correct 1421 ms 94652 KB Output is correct
80 Correct 1408 ms 94764 KB Output is correct
81 Correct 1497 ms 94676 KB Output is correct
82 Correct 1451 ms 94712 KB Output is correct
83 Correct 1427 ms 94456 KB Output is correct
84 Correct 1463 ms 94456 KB Output is correct
85 Correct 1435 ms 94576 KB Output is correct
86 Correct 1415 ms 94712 KB Output is correct
87 Correct 1455 ms 94584 KB Output is correct
88 Correct 1459 ms 94456 KB Output is correct
89 Correct 1431 ms 94584 KB Output is correct
90 Correct 1427 ms 94712 KB Output is correct
91 Correct 1435 ms 94584 KB Output is correct
92 Correct 1434 ms 94700 KB Output is correct
93 Correct 1453 ms 94564 KB Output is correct
94 Correct 1452 ms 94600 KB Output is correct
95 Correct 1462 ms 94508 KB Output is correct
96 Correct 1455 ms 94636 KB Output is correct
97 Correct 1424 ms 94588 KB Output is correct
98 Correct 1436 ms 94584 KB Output is correct
99 Correct 1432 ms 94664 KB Output is correct
100 Correct 816 ms 103080 KB Output is correct
101 Correct 824 ms 103032 KB Output is correct
102 Correct 850 ms 108152 KB Output is correct
103 Correct 829 ms 103160 KB Output is correct
104 Correct 810 ms 103008 KB Output is correct
105 Correct 1062 ms 103288 KB Output is correct
106 Correct 965 ms 103132 KB Output is correct
107 Correct 965 ms 103160 KB Output is correct
108 Correct 980 ms 103032 KB Output is correct
109 Correct 970 ms 103160 KB Output is correct
110 Correct 980 ms 95232 KB Output is correct
111 Correct 968 ms 95000 KB Output is correct
112 Correct 958 ms 94892 KB Output is correct
113 Correct 978 ms 95004 KB Output is correct
114 Correct 951 ms 95028 KB Output is correct
115 Correct 968 ms 94968 KB Output is correct
116 Correct 950 ms 95096 KB Output is correct
117 Correct 949 ms 94944 KB Output is correct
118 Correct 970 ms 95192 KB Output is correct
119 Correct 1046 ms 95000 KB Output is correct
120 Correct 1 ms 512 KB Output is correct
121 Correct 1 ms 512 KB Output is correct
122 Correct 1327 ms 94580 KB Output is correct
123 Correct 1293 ms 94692 KB Output is correct
124 Correct 1304 ms 94652 KB Output is correct
125 Correct 1305 ms 94840 KB Output is correct
126 Correct 1308 ms 94564 KB Output is correct
127 Correct 1295 ms 94768 KB Output is correct
128 Correct 1337 ms 94584 KB Output is correct
129 Correct 1374 ms 94616 KB Output is correct
130 Correct 1399 ms 94584 KB Output is correct
131 Correct 1319 ms 94580 KB Output is correct
132 Correct 1386 ms 94580 KB Output is correct
133 Correct 1368 ms 94456 KB Output is correct