oj.uz

답안 #626229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626229 2022-08-11T10:12:41 Z Eae02 메기 농장 (IOI22_fish) C++17
29 / 100
 1000 ms 174752 KB 
#include "fish.h"

#include <bits/stdc++.h>
using ll = __int128_t;
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 = LLONG_MIN; // 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, (ll)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, (ll)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, (ll)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, (ll)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
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 36788 KB Output is correct
2 Correct 156 ms 43696 KB Output is correct
3 Correct 14 ms 10508 KB Output is correct
4 Correct 13 ms 10452 KB Output is correct
5 Execution timed out 1093 ms 174752 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 476 ms 80596 KB Output is correct
3 Correct 584 ms 97664 KB Output is correct
4 Correct 129 ms 36664 KB Output is correct
5 Correct 161 ms 43700 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 212 KB Output is correct
10 Correct 13 ms 10432 KB Output is correct
11 Correct 13 ms 10416 KB Output is correct
12 Correct 267 ms 54784 KB Output is correct
13 Correct 336 ms 65620 KB Output is correct
14 Correct 209 ms 44264 KB Output is correct
15 Correct 262 ms 49380 KB Output is correct
16 Correct 207 ms 44368 KB Output is correct
17 Correct 261 ms 49136 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 10504 KB Output is correct
2 Correct 13 ms 10452 KB Output is correct
3 Correct 115 ms 31044 KB Output is correct
4 Correct 83 ms 25136 KB Output is correct
5 Correct 204 ms 48872 KB Output is correct
6 Correct 191 ms 48800 KB Output is correct
7 Correct 195 ms 48908 KB Output is correct
8 Correct 191 ms 48904 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 2 ms 468 KB Output is correct
10 Correct 4 ms 1192 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 2 ms 724 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 2 ms 468 KB Output is correct
10 Correct 4 ms 1192 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 6 ms 1192 KB Output is correct
17 Correct 132 ms 18872 KB Output is correct
18 Correct 121 ms 17824 KB Output is correct
19 Correct 116 ms 18752 KB Output is correct
20 Correct 109 ms 17320 KB Output is correct
21 Correct 111 ms 17160 KB Output is correct
22 Correct 225 ms 33176 KB Output is correct
23 Correct 32 ms 5080 KB Output is correct
24 Correct 104 ms 14888 KB Output is correct
25 Incorrect 3 ms 980 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 1 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 0 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 2 ms 468 KB Output is correct
10 Correct 4 ms 1192 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 6 ms 1192 KB Output is correct
17 Correct 132 ms 18872 KB Output is correct
18 Correct 121 ms 17824 KB Output is correct
19 Correct 116 ms 18752 KB Output is correct
20 Correct 109 ms 17320 KB Output is correct
21 Correct 111 ms 17160 KB Output is correct
22 Correct 225 ms 33176 KB Output is correct
23 Correct 32 ms 5080 KB Output is correct
24 Correct 104 ms 14888 KB Output is correct
25 Incorrect 3 ms 980 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 14 ms 10504 KB Output is correct
2 Correct 13 ms 10452 KB Output is correct
3 Correct 115 ms 31044 KB Output is correct
4 Correct 83 ms 25136 KB Output is correct
5 Correct 204 ms 48872 KB Output is correct
6 Correct 191 ms 48800 KB Output is correct
7 Correct 195 ms 48908 KB Output is correct
8 Correct 191 ms 48904 KB Output is correct
9 Correct 318 ms 67764 KB Output is correct
10 Correct 193 ms 40612 KB Output is correct
11 Correct 393 ms 80904 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
18 Correct 13 ms 10496 KB Output is correct
19 Correct 16 ms 10452 KB Output is correct
20 Correct 13 ms 10404 KB Output is correct
21 Correct 13 ms 10452 KB Output is correct
22 Incorrect 344 ms 65740 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 128 ms 36788 KB Output is correct
2 Correct 156 ms 43696 KB Output is correct
3 Correct 14 ms 10508 KB Output is correct
4 Correct 13 ms 10452 KB Output is correct
5 Execution timed out 1093 ms 174752 KB Time limit exceeded
6 Halted 0 ms 0 KB -