oj.uz

답안 #627550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627550 2022-08-12T16:44:42 Z JustInCase 메기 농장 (IOI22_fish) C++17
53 / 100
 104 ms 11700 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <array>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <cstring>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <random>
#include <cstdlib>

#define debug(x) std::cout << #x << " " << (x) << '\n';
#define pb push_back
#define mp std::make_pair
#define remax(a, b) a = std::max((a), (b));
#define remin(a, b) a = std::min((a), (b));

#define maxWeights max_weights

int64_t solveSmallN(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y,
			std::vector<int32_t> w) {
	const int32_t MAX_N = 300;

	std::array<std::array<int64_t, MAX_N>, MAX_N> wPrefSums {};
	std::array<std::array<std::array<int64_t, 3>, MAX_N + 1>, MAX_N + 1> dp {};

	auto getWRangeSum = [&wPrefSums](int32_t startRow, int32_t endRow, int32_t column) -> int64_t {
		if(endRow <= startRow) {
			return 0;
		}

		return wPrefSums[endRow - 1][column] - (startRow == 0 ? 0 : wPrefSums[startRow - 1][column]);
	};

	for(int32_t i = 0; i < m; i++) {
		wPrefSums[y[i]][x[i]] = (int64_t) w[i];
	}

	for(int32_t j = 0; j < n; j++) {
		for(int32_t i = 1; i < n; i++) {
			wPrefSums[i][j] += wPrefSums[i - 1][j];
		}
	}

	for(int32_t j = 1; j < n; j++) {
		for(int32_t lastK = 0; lastK <= n; lastK++) {
			for(int32_t k = 0; k <= n; k++) {
				if(k == 0) {
					remax(dp[j + 1][lastK][2], dp[j][lastK][0] + getWRangeSum(0, lastK, j));
					remax(dp[j + 1][lastK][2], dp[j][lastK][1] + getWRangeSum(0, lastK, j));
				}

				if(lastK <= k) {
					remax(dp[j + 1][k][0], dp[j][lastK][0] + getWRangeSum(lastK, k, j - 1));
					remax(dp[j + 1][k][0], dp[j][lastK][2] + getWRangeSum(lastK, k, j - 1));
				}
				if(lastK >= k) {
					remax(dp[j + 1][k][1], dp[j][lastK][1] + getWRangeSum(k, lastK, j));
					remax(dp[j + 1][k][1], dp[j][lastK][0] + getWRangeSum(k, lastK, j));
					remax(dp[j + 1][k][0], dp[j][lastK][2]);
				}
			}
		}
	}
	
	int64_t ans = 0;
	for(int32_t k = 0; k <= n; k++) {
		remax(ans, dp[n][k][0]);
		remax(ans, dp[n][k][1]);
		remax(ans, dp[n][k][2]);
	}

	return ans;
}

int64_t solveEvenXs(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y,
			std::vector<int32_t> w) {
	int64_t ans = 0;
	for(int32_t i = 0; i < m; i++) {
		ans += (int64_t) w[i];
	}
	return ans;
}

int64_t solveAllXs0Or1(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y,
			std::vector<int32_t> w) {
	const int32_t MAX_N = 1e5;

	std::array<std::array<int64_t, 2>, MAX_N> wPrefSums {};

	auto getWRangeSum = [&wPrefSums](int32_t startRow, int32_t endRow, int32_t column) -> int64_t {
		if(endRow <= startRow) {
			return 0;
		}

		return wPrefSums[endRow - 1][column] - (startRow == 0 ? 0 : wPrefSums[startRow - 1][column]);
	};

	for(int32_t i = 0; i < m; i++) {
		wPrefSums[y[i]][x[i]] = (int64_t) w[i];
	}

	for(int32_t j = 0; j < 2; j++) {
		for(int32_t i = 1; i < n; i++) {
			wPrefSums[i][j] += wPrefSums[i - 1][j];
		}
	}

	int64_t ans = 0;
	remax(ans, getWRangeSum(0, n, 1));
	remax(ans, getWRangeSum(0, n, 0));

	if(n > 2) {
		for(int32_t i = 0; i <= n; i++) {
			remax(ans, getWRangeSum(0, i, 0) + getWRangeSum(i, n, 1));
		}
	}

	return ans;
}

int64_t solveAllYs0(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> w) {
	const int32_t MAX_N = 1e5;

	std::array<int32_t, MAX_N + 3> wByColumn {};
	for(int32_t i = 0; i < m; i++) {
		wByColumn[x[i]] = w[i];
	}
	
	if(n == 2) {
		return std::max(wByColumn[0], wByColumn[1]);
	}

	std::array<std::array<std::array<int64_t, 2>, 2>, MAX_N + 3> dp {};
	dp[2][0][0] = 0;
	dp[2][0][1] = wByColumn[0];
	dp[2][1][0] = 0;
	dp[2][1][1] = 0;
	for(int32_t j = 2; j <= n + 1; j++) {
		for(int32_t p = 0; p < 2; p++) {
			for(int32_t q = 0; q < 2; q++) {
				remax(dp[j + 1][q][0], dp[j][p][q] + ((p == 1 && q != 1) ? wByColumn[j - 1] : 0));
				remax(dp[j + 1][q][1], dp[j][p][q] + (q != 1 ? wByColumn[j - 1] : 0));
			}
		}
	}

	return dp[n + 2][0][0];
}

int64_t maxWeights(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y,
                      std::vector<int32_t> w) {
	if(n <= 300) {
		return solveSmallN(n, m, x, y, w);
	}
	else if(std::all_of(x.begin(), x.end(), [](int32_t v) { return !(v & 1); })) {
		return solveEvenXs(n, m, x, y, w);
	}
	else if(std::all_of(x.begin(), x.end(), [](int32_t v) { return (v < 2); })) {
		return solveAllXs0Or1(n, m, x, y, w);
	}
	else if(std::all_of(y.begin(), y.end(), [](int32_t v) { return (v == 0); })) {
		return solveAllYs0(n, m, x, w);
	}

	return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3156 KB Output is correct
2 Correct 28 ms 3784 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 85 ms 10848 KB Output is correct
6 Correct 93 ms 10848 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 58 ms 7456 KB Output is correct
3 Correct 62 ms 11700 KB Output is correct
4 Correct 28 ms 3876 KB Output is correct
5 Correct 33 ms 4896 KB Output is correct
6 Correct 2 ms 3116 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3116 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 27 ms 5132 KB Output is correct
13 Correct 32 ms 5868 KB Output is correct
14 Correct 34 ms 5368 KB Output is correct
15 Correct 30 ms 5472 KB Output is correct
16 Correct 26 ms 5228 KB Output is correct
17 Correct 31 ms 5456 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 19 ms 5404 KB Output is correct
4 Correct 15 ms 5204 KB Output is correct
5 Correct 29 ms 7016 KB Output is correct
6 Correct 25 ms 7264 KB Output is correct
7 Correct 29 ms 7756 KB Output is correct
8 Correct 30 ms 7764 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3076 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3124 KB Output is correct
8 Correct 2 ms 3072 KB Output is correct
9 Correct 11 ms 3140 KB Output is correct
10 Correct 70 ms 3184 KB Output is correct
11 Correct 12 ms 3028 KB Output is correct
12 Correct 69 ms 3156 KB Output is correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 70 ms 3136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3076 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3124 KB Output is correct
8 Correct 2 ms 3072 KB Output is correct
9 Correct 11 ms 3140 KB Output is correct
10 Correct 70 ms 3184 KB Output is correct
11 Correct 12 ms 3028 KB Output is correct
12 Correct 69 ms 3156 KB Output is correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 70 ms 3136 KB Output is correct
15 Correct 74 ms 3112 KB Output is correct
16 Correct 4 ms 3156 KB Output is correct
17 Correct 87 ms 4692 KB Output is correct
18 Correct 83 ms 4704 KB Output is correct
19 Correct 77 ms 4708 KB Output is correct
20 Correct 81 ms 4812 KB Output is correct
21 Correct 79 ms 4692 KB Output is correct
22 Correct 104 ms 6224 KB Output is correct
23 Correct 71 ms 3416 KB Output is correct
24 Correct 78 ms 4052 KB Output is correct
25 Correct 73 ms 3156 KB Output is correct
26 Correct 77 ms 3412 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3076 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3124 KB Output is correct
8 Correct 2 ms 3072 KB Output is correct
9 Correct 11 ms 3140 KB Output is correct
10 Correct 70 ms 3184 KB Output is correct
11 Correct 12 ms 3028 KB Output is correct
12 Correct 69 ms 3156 KB Output is correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 70 ms 3136 KB Output is correct
15 Correct 74 ms 3112 KB Output is correct
16 Correct 4 ms 3156 KB Output is correct
17 Correct 87 ms 4692 KB Output is correct
18 Correct 83 ms 4704 KB Output is correct
19 Correct 77 ms 4708 KB Output is correct
20 Correct 81 ms 4812 KB Output is correct
21 Correct 79 ms 4692 KB Output is correct
22 Correct 104 ms 6224 KB Output is correct
23 Correct 71 ms 3416 KB Output is correct
24 Correct 78 ms 4052 KB Output is correct
25 Correct 73 ms 3156 KB Output is correct
26 Correct 77 ms 3412 KB Output is correct
27 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '2999', found: '0'
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 19 ms 5404 KB Output is correct
4 Correct 15 ms 5204 KB Output is correct
5 Correct 29 ms 7016 KB Output is correct
6 Correct 25 ms 7264 KB Output is correct
7 Correct 29 ms 7756 KB Output is correct
8 Correct 30 ms 7764 KB Output is correct
9 Incorrect 33 ms 2876 KB 1st lines differ - on the 1st token, expected: '99999', found: '0'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3156 KB Output is correct
2 Correct 28 ms 3784 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 85 ms 10848 KB Output is correct
6 Correct 93 ms 10848 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 58 ms 7456 KB Output is correct
9 Correct 62 ms 11700 KB Output is correct
10 Correct 28 ms 3876 KB Output is correct
11 Correct 33 ms 4896 KB Output is correct
12 Correct 2 ms 3116 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 2 ms 3116 KB Output is correct
15 Correct 2 ms 3028 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 27 ms 5132 KB Output is correct
19 Correct 32 ms 5868 KB Output is correct
20 Correct 34 ms 5368 KB Output is correct
21 Correct 30 ms 5472 KB Output is correct
22 Correct 26 ms 5228 KB Output is correct
23 Correct 31 ms 5456 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 19 ms 5404 KB Output is correct
27 Correct 15 ms 5204 KB Output is correct
28 Correct 29 ms 7016 KB Output is correct
29 Correct 25 ms 7264 KB Output is correct
30 Correct 29 ms 7756 KB Output is correct
31 Correct 30 ms 7764 KB Output is correct
32 Correct 2 ms 3028 KB Output is correct
33 Correct 2 ms 3028 KB Output is correct
34 Correct 2 ms 3028 KB Output is correct
35 Correct 2 ms 3028 KB Output is correct
36 Correct 2 ms 3076 KB Output is correct
37 Correct 2 ms 3028 KB Output is correct
38 Correct 2 ms 3124 KB Output is correct
39 Correct 2 ms 3072 KB Output is correct
40 Correct 11 ms 3140 KB Output is correct
41 Correct 70 ms 3184 KB Output is correct
42 Correct 12 ms 3028 KB Output is correct
43 Correct 69 ms 3156 KB Output is correct
44 Correct 3 ms 3028 KB Output is correct
45 Correct 70 ms 3136 KB Output is correct
46 Correct 74 ms 3112 KB Output is correct
47 Correct 4 ms 3156 KB Output is correct
48 Correct 87 ms 4692 KB Output is correct
49 Correct 83 ms 4704 KB Output is correct
50 Correct 77 ms 4708 KB Output is correct
51 Correct 81 ms 4812 KB Output is correct
52 Correct 79 ms 4692 KB Output is correct
53 Correct 104 ms 6224 KB Output is correct
54 Correct 71 ms 3416 KB Output is correct
55 Correct 78 ms 4052 KB Output is correct
56 Correct 73 ms 3156 KB Output is correct
57 Correct 77 ms 3412 KB Output is correct
58 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '2999', found: '0'
59 Halted 0 ms 0 KB -