oj.uz

Submission #101230

# Submission time Handle Problem Language Result Execution time Memory
101230 2019-03-17T21:02:05 Z jasony123123 Bulldozer (JOI17_bulldozer) C++11
55 / 100
 886 ms 95224 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define v vector
#define mp make_pair
typedef long long ll;
typedef pair<int, int > pii;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/****************************************************************/
const int MAXN = 2000;
int N, pos[2000];
ll x[2000], y[2000], w[2000];

struct Node {
	ll lsum, rsum, bsum, esum;
	Node() {
		lsum = rsum = bsum = esum = 0LL;
	}
	Node(ll val) {
		lsum = rsum = bsum = max(0LL, val);
		esum = val;
	}
	Node(Node &a, Node &b) {
		lsum = max(a.lsum, a.esum + b.lsum);
		rsum = max(b.rsum, b.esum + a.rsum);
		bsum = max(a.bsum, max(b.bsum, a.rsum + b.lsum));
		esum = a.esum + b.esum;
	}
};
struct Seg {
	int SZ = 1 << 12;
	Node data[1 << 13];

	void set(int x, ll val) {
		data[x + SZ] = Node(val);
	}
	void build() {
		for (int i = SZ - 1; i > 0; i--)
			data[i] = Node(data[i * 2], data[i * 2 + 1]);
	}
	void update(int x, ll val) {
		set(x, val);
		x += SZ;
		x /= 2;
		while (x) {
			data[x] = Node(data[x * 2], data[x * 2 + 1]);
			x /= 2;
		}
	}
	ll query() {
		return data[1].bsum;
	}

	//int data[2000];

	//void set(int x, int val) {
	//	data[x] = val;
	//}
	//void build() {

	//}
	//void update(int x, int val) {
	//	data[x] = val;
	//}
	//ll query() {
	//	//	cout << "Query: ";
	//	//	FOR(i, 0, N) cout << data[i] << " ";
	//	ll best = 0;
	//	FOR(i, 0, N) FOR(j, i, N) {
	//		ll tmp = 0;
	//		FORE(x, i, j) tmp += data[x];
	//		maxx(best, tmp);
	//	}
	//	//	cout << ":: " << best << "\n";
	//	return best;
	//}
} tree;

struct upd {
	ll vx, vy;
	int ia, ib;
	upd(ll _vx, ll _vy, int _a, int _b) : vx(_vx), vy(_vy), ia(_a), ib(_b) {}
};
v<upd> lines;

void perform_swap(int i, int j) {
	//	cout << "Swapping " << i << " " << j << "\n";
	swap(pos[i], pos[j]);
	tree.update(pos[i], w[i]);
	tree.update(pos[j], w[j]);
}

void setup() {
	cin >> N;
	v<int> pnts(N);
	FOR(i, 0, N) {
		cin >> x[i] >> y[i] >> w[i];
		pnts[i] = i;
	}
	sort(all(pnts), [](int &i, int &j) {
		return mp(x[i], y[i]) < mp(x[j], y[j]);
	});
	FOR(i, 0, N) {
		pos[pnts[i]] = i;
		tree.update(i, w[pnts[i]]);
	}
}

int main() {
	io();
	setup();
	FOR(i, 0, N) FOR(j, 0, N) if (x[i] < x[j])
		lines.push_back(upd(x[j] - x[i], y[j] - y[i], i, j));

	sort(all(lines), [](upd &a, upd &b) {
		if (a.vy*b.vx == b.vy*a.vx) {
			assert(0);
			//	return mp(x[a.ia], x[a.ib]) < mp(x[b.ia], x[b.ib]);
		}
		return a.vy*b.vx > b.vy*a.vx;
	});

	ll best = tree.query();
	for (int i = 0; i < lines.size(); ) {
		ll curx = lines[i].vx, cury = lines[i].vy;
		while (i < lines.size() && cury*lines[i].vx == curx*lines[i].vy) {
			perform_swap(lines[i].ia, lines[i].ib);
			i++;
		}
		maxx(best, tree.query());
	}
	cout << best << "\n";
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:135:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < lines.size(); ) {
                  ~~^~~~~~~~~~~~~~
bulldozer.cpp:137:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (i < lines.size() && cury*lines[i].vx == curx*lines[i].vy) {
          ~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1600 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 896 KB Output is correct
2 Correct 4 ms 896 KB Output is correct
3 Correct 4 ms 896 KB Output is correct
4 Correct 4 ms 896 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 4 ms 896 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 4 ms 896 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 4 ms 896 KB Output is correct
24 Correct 4 ms 896 KB Output is correct
25 Correct 4 ms 896 KB Output is correct
26 Correct 3 ms 896 KB Output is correct
27 Correct 4 ms 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 924 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 4 ms 896 KB Output is correct
32 Correct 4 ms 896 KB Output is correct
33 Correct 842 ms 49992 KB Output is correct
34 Correct 855 ms 49964 KB Output is correct
35 Correct 848 ms 50092 KB Output is correct
36 Correct 819 ms 49964 KB Output is correct
37 Correct 832 ms 50064 KB Output is correct
38 Correct 830 ms 49964 KB Output is correct
39 Correct 824 ms 50088 KB Output is correct
40 Correct 847 ms 50036 KB Output is correct
41 Correct 831 ms 50072 KB Output is correct
42 Correct 822 ms 49968 KB Output is correct
43 Correct 822 ms 49964 KB Output is correct
44 Correct 840 ms 49964 KB Output is correct
45 Correct 824 ms 50008 KB Output is correct
46 Correct 833 ms 50036 KB Output is correct
47 Correct 830 ms 49980 KB Output is correct
48 Correct 845 ms 50020 KB Output is correct
49 Correct 886 ms 49964 KB Output is correct
50 Correct 863 ms 50012 KB Output is correct
51 Correct 844 ms 49964 KB Output is correct
52 Correct 811 ms 49964 KB Output is correct
53 Correct 824 ms 50104 KB Output is correct
54 Correct 819 ms 49992 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 896 KB Output is correct
2 Correct 4 ms 896 KB Output is correct
3 Correct 4 ms 896 KB Output is correct
4 Correct 4 ms 896 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 4 ms 896 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 4 ms 896 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 4 ms 896 KB Output is correct
24 Correct 4 ms 896 KB Output is correct
25 Correct 4 ms 896 KB Output is correct
26 Correct 3 ms 896 KB Output is correct
27 Correct 4 ms 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 924 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 4 ms 896 KB Output is correct
32 Correct 4 ms 896 KB Output is correct
33 Correct 842 ms 49992 KB Output is correct
34 Correct 855 ms 49964 KB Output is correct
35 Correct 848 ms 50092 KB Output is correct
36 Correct 819 ms 49964 KB Output is correct
37 Correct 832 ms 50064 KB Output is correct
38 Correct 830 ms 49964 KB Output is correct
39 Correct 824 ms 50088 KB Output is correct
40 Correct 847 ms 50036 KB Output is correct
41 Correct 831 ms 50072 KB Output is correct
42 Correct 822 ms 49968 KB Output is correct
43 Correct 822 ms 49964 KB Output is correct
44 Correct 840 ms 49964 KB Output is correct
45 Correct 824 ms 50008 KB Output is correct
46 Correct 833 ms 50036 KB Output is correct
47 Correct 830 ms 49980 KB Output is correct
48 Correct 845 ms 50020 KB Output is correct
49 Correct 886 ms 49964 KB Output is correct
50 Correct 863 ms 50012 KB Output is correct
51 Correct 844 ms 49964 KB Output is correct
52 Correct 811 ms 49964 KB Output is correct
53 Correct 824 ms 50104 KB Output is correct
54 Correct 819 ms 49992 KB Output is correct
55 Correct 820 ms 50116 KB Output is correct
56 Correct 832 ms 49988 KB Output is correct
57 Correct 822 ms 50092 KB Output is correct
58 Correct 838 ms 50092 KB Output is correct
59 Correct 851 ms 50016 KB Output is correct
60 Correct 823 ms 49964 KB Output is correct
61 Correct 812 ms 49964 KB Output is correct
62 Correct 825 ms 50088 KB Output is correct
63 Correct 848 ms 49968 KB Output is correct
64 Correct 826 ms 50092 KB Output is correct
65 Runtime error 152 ms 95224 KB Execution killed with signal 11 (could be triggered by violating memory limits)
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1600 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -