oj.uz

답안 #626224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626224 2022-08-11T10:06:56 Z Eae02 메기 농장 (IOI22_fish) C++17
32 / 100
 797 ms 94396 KB 
#include "fish.h"

#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define all(x) begin(x),end(x)

struct SegTree {
	using T = ll; // use pair of value and index to get index from queries
	T f(T a, T b) { return max(a, b); }
	static constexpr T UNIT = -(1LL << 50LL); // neutral value for f
	
	vector<T> s; ll n;
	SegTree(ll len) : s(2 * len, UNIT), n(len) {}
	void set(ll pos, T val) {
		for (s[pos += n] = val; pos /= 2;)
			s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
	}
	T query(ll lo, ll hi) { // query lo to hi (hi not included)
		T ra = UNIT, rb = UNIT;
		for (lo += n, hi += n; lo < hi; lo /= 2, hi /= 2) {
			if (lo % 2) ra = f(ra, s[lo++]);
			if (hi % 2) rb = f(s[--hi], rb);
		}
		return f(ra, rb);
	}
};

vector<vector<pair<ll, ll>>> fishWeightSum;

ll weightSum(ll x, ll y) {
	if (x < 0 || x >= (ll)fishWeightSum.size())
		return 0;
	ll idx = lower_bound(all(fishWeightSum[x]), make_pair(y, LLONG_MIN)) - fishWeightSum[x].begin();
	if (fishWeightSum[x][idx].first > y)
		idx--;
	return fishWeightSum[x][idx].second;
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
	if (M == 0) return 0;
	
	vector<pair<ll, ll>> piers;
	vector<tuple<ll, ll, ll>> fish;
	for (ll i = 0; i < M; i++) {
		fish.emplace_back(X[i], Y[i], W[i]);
		if (X[i] != 0)
			piers.emplace_back(X[i] - 1, Y[i]);
		if (X[i] != N - 1)
			piers.emplace_back(X[i] + 1, Y[i]);
	}
	sort(all(piers));
	piers.erase(unique(all(piers)), piers.end());
	
	sort(all(fish));
	fishWeightSum.resize(N);
	for (ll i = 0; i < N; i++) {
		fishWeightSum[i].emplace_back(LLONG_MIN, 0);
	}
	for (auto [x, y, w] : fish) {
		fishWeightSum[x].emplace_back(y, fishWeightSum[x].back().second + w);
	}
	for (ll i = 0; i < N; i++) {
		fishWeightSum[i].emplace_back(LLONG_MAX, fishWeightSum[i].back().second);
	}
	
	SegTree st1(piers.size());
	SegTree st2(piers.size());
	SegTree st3(piers.size());
	SegTree st4(piers.size());
	SegTree st5(piers.size());
	
	vector<array<ll, 2>> dpv(piers.size() + 1);
	array<ll, 2>* dp = &dpv[1];
	for (ll lp = (ll)piers.size() - 1; lp >= -1; lp--) {
		ll cx = lp == -1 ? -5 : piers[lp].first;
		ll cy = lp == -1 ? -5 : piers[lp].second;
		
		ll x1ShorterFirstIdx = lower_bound(all(piers), make_pair(cx + 1, LLONG_MIN)) - piers.begin();
		ll x1LongerFirstIdx = lower_bound(all(piers), make_pair(cx + 1, cy)) - piers.begin();
		ll x2ShorterFirstIdx = lower_bound(all(piers), make_pair(cx + 2, LLONG_MIN)) - piers.begin();
		ll x2LongerFirstIdx = lower_bound(all(piers), make_pair(cx + 2, cy)) - piers.begin();
		ll c3FirstIdx = lower_bound(all(piers), make_pair(cx + 3, LLONG_MIN)) - piers.begin();
		
		for (ll allowNext = 0; allowNext < 2; allowNext++) {
			ll ans = 0;
			if (allowNext) {
				ans = max(ans, st1.query(x1ShorterFirstIdx, x1LongerFirstIdx));
				//for (ll np = x1ShorterFirstIdx; np < x1LongerFirstIdx; np++) {
				//	auto [nx, ny] = piers[np];
				//	ans = max(ans, dp[np][0] + weightSum(nx + 1, ny) - weightSum(nx, ny));
				//}
				
				ans = max(ans, st2.query(x1LongerFirstIdx, x2ShorterFirstIdx) - weightSum(cx, cy) - weightSum(cx + 1, cy));
				//for (ll np = x1LongerFirstIdx; np < x2ShorterFirstIdx; np++) {
				//	auto [nx, ny] = piers[np];
				//	ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny) - weightSum(cx, cy) - weightSum(cx + 1, cy));
				//}
			}
			
			ans = max(ans, st3.query(x2ShorterFirstIdx, x2LongerFirstIdx));
			//for (ll np = x2ShorterFirstIdx; np < x2LongerFirstIdx; np++) {
			//	auto [nx, ny] = piers[np];
			//	ans = max(ans, dp[np][1] + weightSum(nx + 1, ny));
			//}
			
			ans = max(ans, st4.query(x2LongerFirstIdx, c3FirstIdx) - weightSum(cx + 1, cy));
			//for (ll np = x2LongerFirstIdx; np < c3FirstIdx; np++) {
			//	auto [nx, ny] = piers[np];
			//	ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny) - weightSum(cx + 1, cy));
			//}
			
			ans = max(ans, st5.query(c3FirstIdx, (ll)piers.size()));
			//for (ll np = c3FirstIdx; np < (ll)piers.size(); np++) {
			//	auto [nx, ny] = piers[np];
			//	ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny));
			//}
			
			dp[lp][allowNext] = ans;
		}
		
		if (lp != -1) {
			st1.set(lp, dp[lp][0] + weightSum(cx + 1, cy) - weightSum(cx, cy));
			st2.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
			st3.set(lp, dp[lp][1] + weightSum(cx + 1, cy));
			st4.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
			st5.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
		}
	}
	
	return dp[-1][1];
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 21216 KB Output is correct
2 Correct 116 ms 25196 KB Output is correct
3 Correct 11 ms 7324 KB Output is correct
4 Correct 10 ms 7252 KB Output is correct
5 Correct 793 ms 93084 KB Output is correct
6 Correct 797 ms 94396 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 349 ms 44200 KB Output is correct
3 Correct 425 ms 53392 KB Output is correct
4 Correct 99 ms 21324 KB Output is correct
5 Correct 117 ms 25088 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 14 ms 7344 KB Output is correct
11 Correct 12 ms 7272 KB Output is correct
12 Correct 193 ms 30172 KB Output is correct
13 Correct 234 ms 36232 KB Output is correct
14 Correct 160 ms 25060 KB Output is correct
15 Correct 201 ms 27892 KB Output is correct
16 Correct 155 ms 25060 KB Output is correct
17 Correct 187 ms 27804 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7252 KB Output is correct
2 Correct 11 ms 7252 KB Output is correct
3 Correct 93 ms 18000 KB Output is correct
4 Correct 73 ms 15176 KB Output is correct
5 Correct 142 ms 27760 KB Output is correct
6 Correct 134 ms 27624 KB Output is correct
7 Correct 142 ms 27752 KB Output is correct
8 Correct 142 ms 27716 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 568 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 568 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 96 ms 10148 KB Output is correct
18 Correct 98 ms 9920 KB Output is correct
19 Correct 88 ms 10084 KB Output is correct
20 Correct 78 ms 9348 KB Output is correct
21 Correct 77 ms 9160 KB Output is correct
22 Correct 178 ms 18088 KB Output is correct
23 Correct 23 ms 2784 KB Output is correct
24 Correct 75 ms 8068 KB Output is correct
25 Incorrect 3 ms 596 KB 1st lines differ - on the 1st token, expected: '443843838929', found: '443838673362'
26 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 568 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 96 ms 10148 KB Output is correct
18 Correct 98 ms 9920 KB Output is correct
19 Correct 88 ms 10084 KB Output is correct
20 Correct 78 ms 9348 KB Output is correct
21 Correct 77 ms 9160 KB Output is correct
22 Correct 178 ms 18088 KB Output is correct
23 Correct 23 ms 2784 KB Output is correct
24 Correct 75 ms 8068 KB Output is correct
25 Incorrect 3 ms 596 KB 1st lines differ - on the 1st token, expected: '443843838929', found: '443838673362'
26 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7252 KB Output is correct
2 Correct 11 ms 7252 KB Output is correct
3 Correct 93 ms 18000 KB Output is correct
4 Correct 73 ms 15176 KB Output is correct
5 Correct 142 ms 27760 KB Output is correct
6 Correct 134 ms 27624 KB Output is correct
7 Correct 142 ms 27752 KB Output is correct
8 Correct 142 ms 27716 KB Output is correct
9 Correct 228 ms 37040 KB Output is correct
10 Correct 147 ms 22588 KB Output is correct
11 Correct 304 ms 44956 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 11 ms 7252 KB Output is correct
19 Correct 11 ms 7252 KB Output is correct
20 Correct 11 ms 7252 KB Output is correct
21 Correct 11 ms 7264 KB Output is correct
22 Incorrect 254 ms 36344 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45449488300152'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 21216 KB Output is correct
2 Correct 116 ms 25196 KB Output is correct
3 Correct 11 ms 7324 KB Output is correct
4 Correct 10 ms 7252 KB Output is correct
5 Correct 793 ms 93084 KB Output is correct
6 Correct 797 ms 94396 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 349 ms 44200 KB Output is correct
9 Correct 425 ms 53392 KB Output is correct
10 Correct 99 ms 21324 KB Output is correct
11 Correct 117 ms 25088 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 14 ms 7344 KB Output is correct
17 Correct 12 ms 7272 KB Output is correct
18 Correct 193 ms 30172 KB Output is correct
19 Correct 234 ms 36232 KB Output is correct
20 Correct 160 ms 25060 KB Output is correct
21 Correct 201 ms 27892 KB Output is correct
22 Correct 155 ms 25060 KB Output is correct
23 Correct 187 ms 27804 KB Output is correct
24 Correct 10 ms 7252 KB Output is correct
25 Correct 11 ms 7252 KB Output is correct
26 Correct 93 ms 18000 KB Output is correct
27 Correct 73 ms 15176 KB Output is correct
28 Correct 142 ms 27760 KB Output is correct
29 Correct 134 ms 27624 KB Output is correct
30 Correct 142 ms 27752 KB Output is correct
31 Correct 142 ms 27716 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 568 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 96 ms 10148 KB Output is correct
49 Correct 98 ms 9920 KB Output is correct
50 Correct 88 ms 10084 KB Output is correct
51 Correct 78 ms 9348 KB Output is correct
52 Correct 77 ms 9160 KB Output is correct
53 Correct 178 ms 18088 KB Output is correct
54 Correct 23 ms 2784 KB Output is correct
55 Correct 75 ms 8068 KB Output is correct
56 Incorrect 3 ms 596 KB 1st lines differ - on the 1st token, expected: '443843838929', found: '443838673362'
57 Halted 0 ms 0 KB -