답안 #46841 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46841	2018-04-23T19:01:08 Z	qoo2p5	Bulldozer (JOI17_bulldozer)	C++17	75 / 100	848 ms	63224 KB

bulldozer

#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-10;

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

int n;
P p[N];

struct Ev {
	int a, b;
	double ang;
	
	Ev(int a, int b) : a(a), b(b) {
		if (p[a].x == p[b].x) {
			ang = 1e10;
		} else {
			ang = (double) (p[a].y - p[b].y) / (p[a].x - p[b].x);
		}
	}
};

bool operator<(const Ev &u, const Ev &v) {
	/*if (u.ang + EPS < v.ang) {
		return 1;
	}
	if (u.ang - EPS > v.ang) {
		return 0;
	}
	
	if (abs(u.ang) < EPS) {
		return mp(p[u.a].x, p[u.b].x) < mp(p[v.a].x, p[v.b].x);
	} else {
		double w = -1.0 / u.ang;
		return mp(w * p[u.a].x - p[u.a].y, w * p[u.b].x - p[u.b].y) < mp(w * p[v.a].x - p[v.a].y, w * p[v.b].x - p[v.b].y);
	}*/
	return u.ang < v.ang;
}

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];
	if (a < 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) && abs(events[j].ang - events[j + 1].ang) < EPS) {
			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
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	512 KB	Output is correct
2	Incorrect	2 ms	512 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	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	5 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 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	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	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	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	3 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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	3 ms	512 KB	Output is correct

Subtask #3
35.0 / 35.0

#	결과	실행 시간	메모리	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	5 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 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	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	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	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	3 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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	3 ms	512 KB	Output is correct
33	Correct	792 ms	63100 KB	Output is correct
34	Correct	781 ms	63168 KB	Output is correct
35	Correct	835 ms	63224 KB	Output is correct
36	Correct	831 ms	63224 KB	Output is correct
37	Correct	792 ms	63224 KB	Output is correct
38	Correct	770 ms	63224 KB	Output is correct
39	Correct	798 ms	63224 KB	Output is correct
40	Correct	819 ms	63096 KB	Output is correct
41	Correct	770 ms	63164 KB	Output is correct
42	Correct	751 ms	63164 KB	Output is correct
43	Correct	765 ms	63172 KB	Output is correct
44	Correct	749 ms	63168 KB	Output is correct
45	Correct	751 ms	63168 KB	Output is correct
46	Correct	786 ms	63172 KB	Output is correct
47	Correct	794 ms	63172 KB	Output is correct
48	Correct	770 ms	63168 KB	Output is correct
49	Correct	769 ms	63184 KB	Output is correct
50	Correct	751 ms	63172 KB	Output is correct
51	Correct	745 ms	63224 KB	Output is correct
52	Correct	742 ms	63164 KB	Output is correct
53	Correct	786 ms	63168 KB	Output is correct
54	Correct	762 ms	63172 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	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	5 ms	512 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 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	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	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	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	4 ms	512 KB	Output is correct
24	Correct	3 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	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	3 ms	512 KB	Output is correct
33	Correct	792 ms	63100 KB	Output is correct
34	Correct	781 ms	63168 KB	Output is correct
35	Correct	835 ms	63224 KB	Output is correct
36	Correct	831 ms	63224 KB	Output is correct
37	Correct	792 ms	63224 KB	Output is correct
38	Correct	770 ms	63224 KB	Output is correct
39	Correct	798 ms	63224 KB	Output is correct
40	Correct	819 ms	63096 KB	Output is correct
41	Correct	770 ms	63164 KB	Output is correct
42	Correct	751 ms	63164 KB	Output is correct
43	Correct	765 ms	63172 KB	Output is correct
44	Correct	749 ms	63168 KB	Output is correct
45	Correct	751 ms	63168 KB	Output is correct
46	Correct	786 ms	63172 KB	Output is correct
47	Correct	794 ms	63172 KB	Output is correct
48	Correct	770 ms	63168 KB	Output is correct
49	Correct	769 ms	63184 KB	Output is correct
50	Correct	751 ms	63172 KB	Output is correct
51	Correct	745 ms	63224 KB	Output is correct
52	Correct	742 ms	63164 KB	Output is correct
53	Correct	786 ms	63168 KB	Output is correct
54	Correct	762 ms	63172 KB	Output is correct
55	Correct	758 ms	63164 KB	Output is correct
56	Correct	763 ms	63172 KB	Output is correct
57	Correct	780 ms	63180 KB	Output is correct
58	Correct	784 ms	63096 KB	Output is correct
59	Correct	779 ms	63168 KB	Output is correct
60	Correct	761 ms	63168 KB	Output is correct
61	Correct	770 ms	63164 KB	Output is correct
62	Correct	815 ms	63096 KB	Output is correct
63	Correct	772 ms	63096 KB	Output is correct
64	Correct	796 ms	63172 KB	Output is correct
65	Correct	750 ms	63172 KB	Output is correct
66	Correct	836 ms	63160 KB	Output is correct
67	Correct	848 ms	63168 KB	Output is correct
68	Correct	763 ms	63080 KB	Output is correct
69	Correct	770 ms	63224 KB	Output is correct
70	Correct	806 ms	63160 KB	Output is correct
71	Correct	787 ms	63176 KB	Output is correct
72	Correct	792 ms	63168 KB	Output is correct
73	Correct	779 ms	63164 KB	Output is correct
74	Correct	797 ms	63224 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	512 KB	Output is correct
2	Incorrect	2 ms	512 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

답안 #46841

Compilation message

Subtask #1 0 / 5.0

Subtask #2 20.0 / 20.0

Subtask #3 35.0 / 35.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 20.0

Subtask #1
0 / 5.0

Subtask #2
20.0 / 20.0

Subtask #3
35.0 / 35.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 20.0