oj.uz

Submission #46855

# Submission time Handle Problem Language Result Execution time Memory
46855 2018-04-23T19:28:51 Z qoo2p5 Bulldozer (JOI17_bulldozer) C++17
100 / 100
 942 ms 63388 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int INF = (int) 1e9 + 1e6;
const ll LINF = (ll) 1e18 + 1e9;
const ll MOD = (ll) 1e9 + 7;

#define sz(x) (int) (x).size()
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb(s, t, x) (int) (lower_bound(s, t, x) - s)
#define ub(s, t, x) (int) (upper_bound(s, t, x) - s)
#define rep(i, f, t) for (auto i = f; i < t; ++(i))
#define per(i, f, t) for (auto i = (f); i >= (t); --(i))

ll power(ll x, ll y, ll mod = MOD) {
    if (y == 0) {
        return 1;
    }
    if (y & 1) {
        return power(x, y - 1, mod) * x % mod;
    } else {
        ll tmp = power(x, y / 2, mod);
        return tmp * tmp % mod;
    }
}

template<typename A, typename B> bool mini(A &x, const B &y) {
    if (y < x) {
        x = y;
        return true;
    }
    return false;
}

template<typename A, typename B> bool maxi(A &x, const B &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

void add(ll &x, ll y) {
    x += y;
    if (x >= MOD) x -= MOD;
    if (x < 0) x += MOD;
}

void run();

#define TASK ""

int main() {
#ifdef LOCAL
    if (strlen(TASK) > 0) {
        cerr << "Reminder: you are using file i/o, filename: " TASK "!" << endl << endl;
    }
#endif
#ifndef LOCAL
    if (strlen(TASK)) {
        freopen(TASK ".in", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    cout << fixed << setprecision(12);
    run();
    return 0;
}

// == SOLUTION == //

#define double long double

const int N = 1 << 11;
const double EPS = 1e-16;

struct P {
	ll x, y, c;
};

int n;
P p[N];

struct F {
	bool is_inf;
	ll p, q;
	
	F() {}
	
	F(ll pp, ll qq) {
		p = 0;
		q = 0;
		is_inf = 0;
		if (qq == 0) {
			is_inf = 1;
		} else {
			p = pp;
			q = qq;
			if (q < 0) {
				p = -p;
				q = -q;
			}
		}
	}
	
	bool operator<(const F &b) const {
		return mp(is_inf, p * b.q) < mp(b.is_inf, b.p * q);
	}
};

struct Ev {
	int a, b;
	F ang;
	
	Ev(int a, int b) : a(a), b(b) {
		ang = F(p[a].y - p[b].y, p[a].x - p[b].x);
	}
};

bool operator<(const Ev &u, const Ev &v) {
	if (u.ang < v.ang) {
		return 1;
	}
	if (v.ang < u.ang) {
		return 0;
	}
	
	return mp(u.a, u.b) < mp(v.a, v.b);
}

struct Node {
	ll sum, res, left, right;
};

Node tree[2 * N + 13];

void upd(int i, ll val) {
	i += N;
	tree[i] = {val, max(0LL, val), max(0LL, val), max(0LL, val)};
	i /= 2;
	while (i > 0) {
		tree[i].sum = tree[2 * i].sum + tree[2 * i + 1].sum;
		tree[i].left = max(tree[2 * i].left, tree[2 * i].sum + tree[2 * i + 1].left);
		tree[i].right = max(tree[2 * i + 1].right, tree[2 * i + 1].sum + tree[2 * i].right);
		tree[i].res = max(tree[2 * i].right + tree[2 * i + 1].left, max(tree[2 * i].res, tree[2 * i + 1].res));
		i /= 2;
	}
}

ll get() {
	return tree[1].res;
}

int pos[N];

void make(const Ev &ev) {
	int a = pos[ev.a];
	int b = pos[ev.b];
	assert(a + 1 == b);
	swap(pos[ev.a], pos[ev.b]);
	ll va = tree[N + a].sum;
	ll vb = tree[N + b].sum;
	upd(a, vb);
	upd(b, va);
}

void run() {
	cin >> n;
	rep(i, 0, n) {
		cin >> p[i].x >> p[i].y >> p[i].c;
	}
	sort(p, p + n, [] (const auto &a, const auto &b) {
		return mp(a.x, a.y) < mp(b.x, b.y);
	});
	vector<Ev> events;
	events.reserve(n * (n - 1) / 2);
	rep(i, 0, n) {
		rep(j, i + 1, n) {
			events.pb(Ev(i, j));
		}
	}
	sort(all(events));
	
	ll ans = 0;
	rep(i, 0, n) {
		upd(i, p[i].c);
		pos[i] = i;
	}
	
	maxi(ans, get());
	
	rep(i, 0, sz(events)) {
		make(events[i]);
		int j = i;
		while (j + 1 < sz(events) && !(events[j].ang < events[j + 1].ang)) {
			j++;
			make(events[j]);
		}
		
		maxi(ans, get());
		i = j;
	}
	
	cout << ans << "\n";
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK ".in", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bulldozer.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK ".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 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 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 356 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 428 KB Output is correct
14 Correct 2 ms 384 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 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 4 ms 640 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 356 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 428 KB Output is correct
14 Correct 2 ms 384 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 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 4 ms 640 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 883 ms 63168 KB Output is correct
34 Correct 883 ms 63180 KB Output is correct
35 Correct 895 ms 63168 KB Output is correct
36 Correct 880 ms 63172 KB Output is correct
37 Correct 875 ms 63168 KB Output is correct
38 Correct 872 ms 63164 KB Output is correct
39 Correct 878 ms 63168 KB Output is correct
40 Correct 871 ms 63160 KB Output is correct
41 Correct 902 ms 63224 KB Output is correct
42 Correct 899 ms 63124 KB Output is correct
43 Correct 892 ms 63112 KB Output is correct
44 Correct 891 ms 63164 KB Output is correct
45 Correct 926 ms 63388 KB Output is correct
46 Correct 911 ms 63164 KB Output is correct
47 Correct 873 ms 63196 KB Output is correct
48 Correct 867 ms 63172 KB Output is correct
49 Correct 885 ms 63168 KB Output is correct
50 Correct 865 ms 63136 KB Output is correct
51 Correct 869 ms 63164 KB Output is correct
52 Correct 875 ms 63164 KB Output is correct
53 Correct 864 ms 63280 KB Output is correct
54 Correct 889 ms 63168 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 356 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 428 KB Output is correct
14 Correct 2 ms 384 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 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 4 ms 640 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 883 ms 63168 KB Output is correct
34 Correct 883 ms 63180 KB Output is correct
35 Correct 895 ms 63168 KB Output is correct
36 Correct 880 ms 63172 KB Output is correct
37 Correct 875 ms 63168 KB Output is correct
38 Correct 872 ms 63164 KB Output is correct
39 Correct 878 ms 63168 KB Output is correct
40 Correct 871 ms 63160 KB Output is correct
41 Correct 902 ms 63224 KB Output is correct
42 Correct 899 ms 63124 KB Output is correct
43 Correct 892 ms 63112 KB Output is correct
44 Correct 891 ms 63164 KB Output is correct
45 Correct 926 ms 63388 KB Output is correct
46 Correct 911 ms 63164 KB Output is correct
47 Correct 873 ms 63196 KB Output is correct
48 Correct 867 ms 63172 KB Output is correct
49 Correct 885 ms 63168 KB Output is correct
50 Correct 865 ms 63136 KB Output is correct
51 Correct 869 ms 63164 KB Output is correct
52 Correct 875 ms 63164 KB Output is correct
53 Correct 864 ms 63280 KB Output is correct
54 Correct 889 ms 63168 KB Output is correct
55 Correct 888 ms 63172 KB Output is correct
56 Correct 870 ms 63164 KB Output is correct
57 Correct 894 ms 63168 KB Output is correct
58 Correct 883 ms 63160 KB Output is correct
59 Correct 874 ms 63104 KB Output is correct
60 Correct 887 ms 63164 KB Output is correct
61 Correct 881 ms 63172 KB Output is correct
62 Correct 881 ms 63196 KB Output is correct
63 Correct 883 ms 63168 KB Output is correct
64 Correct 879 ms 63168 KB Output is correct
65 Correct 870 ms 63168 KB Output is correct
66 Correct 885 ms 63160 KB Output is correct
67 Correct 870 ms 63172 KB Output is correct
68 Correct 874 ms 63176 KB Output is correct
69 Correct 870 ms 63168 KB Output is correct
70 Correct 886 ms 63168 KB Output is correct
71 Correct 875 ms 63096 KB Output is correct
72 Correct 939 ms 63164 KB Output is correct
73 Correct 914 ms 63164 KB Output is correct
74 Correct 882 ms 63168 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 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 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 3 ms 484 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 2 ms 356 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 428 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 3 ms 512 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 4 ms 640 KB Output is correct
45 Correct 3 ms 512 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 883 ms 63168 KB Output is correct
49 Correct 883 ms 63180 KB Output is correct
50 Correct 895 ms 63168 KB Output is correct
51 Correct 880 ms 63172 KB Output is correct
52 Correct 875 ms 63168 KB Output is correct
53 Correct 872 ms 63164 KB Output is correct
54 Correct 878 ms 63168 KB Output is correct
55 Correct 871 ms 63160 KB Output is correct
56 Correct 902 ms 63224 KB Output is correct
57 Correct 899 ms 63124 KB Output is correct
58 Correct 892 ms 63112 KB Output is correct
59 Correct 891 ms 63164 KB Output is correct
60 Correct 926 ms 63388 KB Output is correct
61 Correct 911 ms 63164 KB Output is correct
62 Correct 873 ms 63196 KB Output is correct
63 Correct 867 ms 63172 KB Output is correct
64 Correct 885 ms 63168 KB Output is correct
65 Correct 865 ms 63136 KB Output is correct
66 Correct 869 ms 63164 KB Output is correct
67 Correct 875 ms 63164 KB Output is correct
68 Correct 864 ms 63280 KB Output is correct
69 Correct 889 ms 63168 KB Output is correct
70 Correct 888 ms 63172 KB Output is correct
71 Correct 870 ms 63164 KB Output is correct
72 Correct 894 ms 63168 KB Output is correct
73 Correct 883 ms 63160 KB Output is correct
74 Correct 874 ms 63104 KB Output is correct
75 Correct 887 ms 63164 KB Output is correct
76 Correct 881 ms 63172 KB Output is correct
77 Correct 881 ms 63196 KB Output is correct
78 Correct 883 ms 63168 KB Output is correct
79 Correct 879 ms 63168 KB Output is correct
80 Correct 870 ms 63168 KB Output is correct
81 Correct 885 ms 63160 KB Output is correct
82 Correct 870 ms 63172 KB Output is correct
83 Correct 874 ms 63176 KB Output is correct
84 Correct 870 ms 63168 KB Output is correct
85 Correct 886 ms 63168 KB Output is correct
86 Correct 875 ms 63096 KB Output is correct
87 Correct 939 ms 63164 KB Output is correct
88 Correct 914 ms 63164 KB Output is correct
89 Correct 882 ms 63168 KB Output is correct
90 Correct 904 ms 63164 KB Output is correct
91 Correct 908 ms 63172 KB Output is correct
92 Correct 892 ms 63164 KB Output is correct
93 Correct 942 ms 63224 KB Output is correct
94 Correct 910 ms 63240 KB Output is correct
95 Correct 900 ms 63096 KB Output is correct
96 Correct 905 ms 63176 KB Output is correct
97 Correct 899 ms 63196 KB Output is correct
98 Correct 892 ms 63168 KB Output is correct
99 Correct 889 ms 63172 KB Output is correct
100 Correct 690 ms 63224 KB Output is correct
101 Correct 687 ms 63040 KB Output is correct
102 Correct 691 ms 63168 KB Output is correct
103 Correct 695 ms 63324 KB Output is correct
104 Correct 678 ms 63168 KB Output is correct
105 Correct 736 ms 63096 KB Output is correct
106 Correct 844 ms 63168 KB Output is correct
107 Correct 713 ms 63096 KB Output is correct
108 Correct 715 ms 63096 KB Output is correct
109 Correct 725 ms 63112 KB Output is correct
110 Correct 788 ms 63172 KB Output is correct
111 Correct 780 ms 63160 KB Output is correct
112 Correct 800 ms 63160 KB Output is correct
113 Correct 778 ms 63224 KB Output is correct
114 Correct 804 ms 63224 KB Output is correct
115 Correct 796 ms 63224 KB Output is correct
116 Correct 802 ms 63164 KB Output is correct
117 Correct 814 ms 63188 KB Output is correct
118 Correct 796 ms 63144 KB Output is correct
119 Correct 799 ms 63320 KB Output is correct
120 Correct 2 ms 384 KB Output is correct
121 Correct 2 ms 384 KB Output is correct
122 Correct 879 ms 63164 KB Output is correct
123 Correct 870 ms 63168 KB Output is correct
124 Correct 887 ms 63168 KB Output is correct
125 Correct 878 ms 63164 KB Output is correct
126 Correct 878 ms 63264 KB Output is correct
127 Correct 885 ms 63172 KB Output is correct
128 Correct 869 ms 63176 KB Output is correct
129 Correct 887 ms 63168 KB Output is correct
130 Correct 910 ms 63184 KB Output is correct
131 Correct 917 ms 63224 KB Output is correct
132 Correct 912 ms 63224 KB Output is correct
133 Correct 891 ms 63096 KB Output is correct