oj.uz

Submission #108498

# Submission time Handle Problem Language Result Execution time Memory
108498 2019-04-30T05:45:38 Z E869120 Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1146 ms 49920 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <cmath>
#include <algorithm>
using namespace std;

class SegmentTree {
public:
	vector<long long>dat1, dat2, dat3; int size_ = 1;

	void init(int sz) {
		while (size_ <= sz) size_ *= 2;
		dat1.resize(size_ * 2, 0);
		dat2.resize(size_ * 2, 0);
		dat3.resize(size_ * 2, 0);
	}

	void update(int pos, long long x) {
		pos += size_;
		dat1[pos] = x; dat2[pos] = x;
		while (pos >= 2) {
			pos >>= 1;
			dat1[pos] = min(dat1[pos * 2], dat1[pos * 2 + 1]);
			dat2[pos] = max(dat2[pos * 2], dat2[pos * 2 + 1]);
			dat3[pos] = max({ dat3[pos * 2], dat3[pos * 2 + 1], dat2[pos * 2 + 1] - dat1[pos * 2] });
		}
	}

	long long get_val() {
		return dat3[1];
	}
};

struct Fraction {
public:
	long long cx, cy;
};

bool operator<(const Fraction &a1, const Fraction &a2) {
	// a1 < a2
	if (a1.cx * a2.cy > a1.cy * a2.cx) return true;
	return false;
}

bool operator==(const Fraction &a1, const Fraction &a2) {
	// a1 == a2
	if (a1.cx * a2.cy == a1.cy * a2.cx) return true;
	return false;
}

long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

Fraction teisei(Fraction A) {
	if (A.cx < 0) { A.cx *= -1; A.cy *= -1; }
	long long E = gcd(A.cx, A.cy); E = abs(E);
	A.cx /= E; A.cy /= E;
	return A;
}

long long N, X[2009], Y[2009], W[2009], order[2009], ichi[2009], ruiseki[2009], ans;
vector<tuple<Fraction, int, int>>E;
SegmentTree Z;

int main() {
	// 入力部分・偏角ソート
	cin >> N;
	for (int i = 0; i < N; i++) { cin >> X[i] >> Y[i] >> W[i]; }
	for (int i = 0; i < N; i++) {
		for (int j = i + 1; j < N; j++) E.push_back(make_tuple(teisei(Fraction{ X[j] - X[i],Y[j] - Y[i] }), i, j));
	}
	sort(E.begin(), E.end());

	// 初期値を計算
	vector<pair<long long, long long>>vec;
	for (int i = 0; i < N; i++) vec.push_back(make_pair(X[i], i));
	sort(vec.begin(), vec.end());
	for (int i = 0; i < vec.size(); i++) { ichi[vec[i].second] = i; order[i] = vec[i].second; }
	
	Z.init(N + 2);
	for (int i = 0; i < N; i++) ruiseki[i + 1] = ruiseki[i] + W[order[i]];
	for (int i = 0; i <= N; i++) Z.update(i, ruiseki[i]);
	for (int i = N + 1; i < Z.size_; i++) Z.update(i, -(1LL << 60));

	// 値を更新
	ans = max(ans, Z.get_val());
	for (int i = 0; i < E.size(); i++) {
		int u1 = ichi[get<1>(E[i])], u2 = ichi[get<2>(E[i])]; if (u1 > u2) swap(u1, u2);
		swap(order[u1], order[u2]);
		swap(ichi[get<1>(E[i])], ichi[get<2>(E[i])]);
		ruiseki[u1 + 1] = ruiseki[u1] + W[order[u1]];
		Z.update(u1 + 1, ruiseki[u1 + 1]);

		ans = max(ans, Z.get_val());
	}

	cout << ans << endl;
	return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:81:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vec.size(); i++) { ichi[vec[i].second] = i; order[i] = vec[i].second; }
                  ~~^~~~~~~~~~~~
bulldozer.cpp:90:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < E.size(); i++) {
                  ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 640 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 5 ms 640 KB Output is correct
2 Correct 4 ms 780 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 320 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 4 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 4 ms 640 KB Output is correct
26 Correct 4 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 3 ms 624 KB Output is correct
29 Correct 3 ms 640 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 4 ms 640 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 4 ms 780 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 320 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 4 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 4 ms 640 KB Output is correct
26 Correct 4 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 3 ms 624 KB Output is correct
29 Correct 3 ms 640 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 4 ms 640 KB Output is correct
33 Correct 1035 ms 49736 KB Output is correct
34 Correct 1026 ms 49756 KB Output is correct
35 Correct 1041 ms 49772 KB Output is correct
36 Correct 1047 ms 49796 KB Output is correct
37 Correct 1026 ms 49784 KB Output is correct
38 Correct 1036 ms 49824 KB Output is correct
39 Correct 1020 ms 49772 KB Output is correct
40 Correct 1027 ms 49756 KB Output is correct
41 Correct 1051 ms 49700 KB Output is correct
42 Correct 1050 ms 49764 KB Output is correct
43 Correct 919 ms 49708 KB Output is correct
44 Correct 921 ms 49836 KB Output is correct
45 Correct 925 ms 49708 KB Output is correct
46 Correct 964 ms 49708 KB Output is correct
47 Correct 953 ms 49776 KB Output is correct
48 Correct 947 ms 49816 KB Output is correct
49 Correct 934 ms 49836 KB Output is correct
50 Correct 972 ms 49856 KB Output is correct
51 Correct 960 ms 49824 KB Output is correct
52 Correct 916 ms 49828 KB Output is correct
53 Correct 916 ms 49776 KB Output is correct
54 Correct 920 ms 49768 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 4 ms 780 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 320 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 4 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 4 ms 640 KB Output is correct
26 Correct 4 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 3 ms 624 KB Output is correct
29 Correct 3 ms 640 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 4 ms 640 KB Output is correct
33 Correct 1035 ms 49736 KB Output is correct
34 Correct 1026 ms 49756 KB Output is correct
35 Correct 1041 ms 49772 KB Output is correct
36 Correct 1047 ms 49796 KB Output is correct
37 Correct 1026 ms 49784 KB Output is correct
38 Correct 1036 ms 49824 KB Output is correct
39 Correct 1020 ms 49772 KB Output is correct
40 Correct 1027 ms 49756 KB Output is correct
41 Correct 1051 ms 49700 KB Output is correct
42 Correct 1050 ms 49764 KB Output is correct
43 Correct 919 ms 49708 KB Output is correct
44 Correct 921 ms 49836 KB Output is correct
45 Correct 925 ms 49708 KB Output is correct
46 Correct 964 ms 49708 KB Output is correct
47 Correct 953 ms 49776 KB Output is correct
48 Correct 947 ms 49816 KB Output is correct
49 Correct 934 ms 49836 KB Output is correct
50 Correct 972 ms 49856 KB Output is correct
51 Correct 960 ms 49824 KB Output is correct
52 Correct 916 ms 49828 KB Output is correct
53 Correct 916 ms 49776 KB Output is correct
54 Correct 920 ms 49768 KB Output is correct
55 Correct 1025 ms 49744 KB Output is correct
56 Correct 1025 ms 49896 KB Output is correct
57 Correct 1060 ms 49824 KB Output is correct
58 Correct 1022 ms 49920 KB Output is correct
59 Correct 1018 ms 49716 KB Output is correct
60 Correct 1034 ms 49856 KB Output is correct
61 Correct 1053 ms 49812 KB Output is correct
62 Correct 1014 ms 49792 KB Output is correct
63 Correct 1031 ms 49836 KB Output is correct
64 Correct 1146 ms 49852 KB Output is correct
65 Correct 1040 ms 49860 KB Output is correct
66 Correct 1046 ms 49820 KB Output is correct
67 Correct 1040 ms 49744 KB Output is correct
68 Correct 1004 ms 49884 KB Output is correct
69 Correct 1026 ms 49684 KB Output is correct
70 Correct 1057 ms 49752 KB Output is correct
71 Correct 1080 ms 49680 KB Output is correct
72 Correct 1085 ms 49700 KB Output is correct
73 Correct 1039 ms 49708 KB Output is correct
74 Correct 1050 ms 49860 KB Output is correct

Subtask #5
0 / 20.0

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