oj.uz

답안 #829438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829438 2023-08-18T10:39:03 Z caganyanmaz 메기 농장 (IOI22_fish) C++17
9 / 100
 129 ms 34124 KB 
#include <bits/stdc++.h>
#define pb push_back
#define int int64_t
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif 

int n;
int m;
constexpr static int INF = 1e17;
constexpr static int MXN = 1e5 + 5;
constexpr static int INC = 0;
constexpr static int DEC = 1;
constexpr static int ZER = 2;
vector<array<int, 3>> dp[MXN]; // Y position, height (in fish units), state (increasing, decreasing, zeroed (returns previous height)
vector<int> lpf[MXN];
vector<int> rpf[MXN];
vector<array<int, 2>> f[MXN]; // X pos, Y pos, height/weight

int max_weights(int32_t N, int32_t M, vector<int32_t> x, vector<int32_t> y, vector<int32_t> w) 
{
	n = N;
	m = M;
	for (int i = 0; i < m; i++)
		f[x[i]].pb({y[i], w[i]});
	for (int i = 0; i < n; i++)
		sort(f[i].begin(), f[i].end());
	dp[0]= vector<array<int,3>>(f[0].size()+1, array<int, 3>({0, 0, 0}));
	for (int i = 0; i <= f[0].size(); i++)
	{
		dp[0][i][INC] = 0;
		dp[0][i][DEC] = 0;
		dp[0][i][ZER] = -INF;
	}
	for (int i = 1; i < n; i++)
	{
		dp[i]= vector<array<int,3>>(f[i].size()+1, array<int, 3>({0, 0, 0}));
		// Calculate prefixes
		// Calculate INC -> INC
		int k = 0; // Previous level
		for (int j = 0; j <= f[i].size(); j++) // Current level
		{
			if (j > 0)
				dp[i][j][INC] = max(dp[i][j][INC], dp[i][j-1][INC]);
			while (k <= f[i-1].size() && (j == f[i].size() || (k < f[i-1].size() && f[i][j][0] > f[i-1][k][0])))
			{
				debug(i, j, k);
				dp[i][j][INC] = max(dp[i][j][INC], dp[i-1][k][INC]);
				if (k < f[i-1].size())
					dp[i][j][INC] += f[i-1][k][1];
				k++;
			}
		}
		// Calculating DEC -> DEC
		k = f[i-1].size(); // Previous level
		for (int j = f[i].size(); j >= 0; j--)
		{
			
			if (j < f[i].size())
				dp[i][j][DEC] = max(dp[i][j][DEC], dp[i][j+1][DEC]);
			while (k >= 0 && (k == f[i-1].size() || (j != f[i].size() && f[i-1][k][0] > f[i][j][0])))
			{
				dp[i][j][DEC] = max(dp[i][j][DEC], dp[i-1][k][DEC]);
				k--;
			}
			if (j < f[i].size())
				dp[i][j][DEC] += f[i][j][1];
		}

		// Calculating INC -> DEC (it's only reasonable at the peak
		// Calculating DEC -> ZER
		k = 0;
		for (int j = 0; j <= f[i].size(); j++)
		{
			while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
			{
				dp[i][j][ZER] = max(dp[i][j][ZER], dp[i-1][k][DEC]);
				k++;
			}
		}
		dp[i][f[i].size()][ZER] = max(dp[i][f[i].size()][ZER], dp[i-1][f[i-1].size()][DEC]);
		// Calculating ZER -> INC
		vector<int> best_upper(f[i].size()+1);
		k = f[i-1].size();
		int change = 0;
		for (int j = 0; j < f[i-1].size(); j++)
			change += f[i-1][j][1];
		for (int j = f[i].size(); j>= 0; j--)
		{
			if (j < f[i].size())
				best_upper[j] = max(best_upper[j], best_upper[j+1]);
			while (k >= 0 && (k == f[i-1].size() || f[i-1][k][0] > f[i-1][j][0]))
			{
				best_upper[j] = max(best_upper[j], dp[i-1][k][ZER] + change);
				k--;
				if (k >= 0)
					change -= f[i-1][k][1];
			}
		}
		debug(dp[i]);
		k = 0;
		int sum = 0;
		int prev_val = 0;
		for (int j = 0; j <= f[i].size(); j++)
		{
			dp[i][j][INC] = max(dp[i][j][INC], best_upper[j]);
			while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
			{
				prev_val = max(prev_val, dp[i-1][k][ZER]);
				sum += f[i-1][k][1];
				dp[i][j][INC] = max({dp[i][j][INC], prev_val + sum});
				k++;
			}
		}
		// Calcaulating INC to DEC (max only)
		dp[i][f[i].size()][DEC] = max(dp[i][f[i].size()][DEC], dp[i][f[i].size()][INC]);
		debug(i, f[i].size(), dp[i].size(), dp[i]);
	}
	int best = 0;
	for (int i = 0; i < dp[n-1].size(); i++)
	{
		debug(i, dp[n-1][i][DEC], dp[n-1][i][INC], dp[n-1][i][ZER]);
		best = max({best, dp[n-1][i][DEC], dp[n-1][i][INC], dp[n-1][i][ZER]});
	}
	return best;



}

Compilation message

fish.cpp: In function 'int64_t max_weights(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for (int i = 0; i <= f[0].size(); i++)
      |                  ~~^~~~~~~~~~~~~~
fish.cpp:47:21: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |   for (int j = 0; j <= f[i].size(); j++) // Current level
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:51:13: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    while (k <= f[i-1].size() && (j == f[i].size() || (k < f[i-1].size() && f[i][j][0] > f[i-1][k][0])))
      |           ~~^~~~~~~~~~~~~~~~
fish.cpp:51:36: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    while (k <= f[i-1].size() && (j == f[i].size() || (k < f[i-1].size() && f[i][j][0] > f[i-1][k][0])))
      |                                  ~~^~~~~~~~~~~~~~
fish.cpp:51:57: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    while (k <= f[i-1].size() && (j == f[i].size() || (k < f[i-1].size() && f[i][j][0] > f[i-1][k][0])))
      |                                                       ~~^~~~~~~~~~~~~~~
fish.cpp:55:11: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     if (k < f[i-1].size())
      |         ~~^~~~~~~~~~~~~~~
fish.cpp:65:10: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |    if (j < f[i].size())
      |        ~~^~~~~~~~~~~~~
fish.cpp:67:24: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    while (k >= 0 && (k == f[i-1].size() || (j != f[i].size() && f[i-1][k][0] > f[i][j][0])))
      |                      ~~^~~~~~~~~~~~~~~~
fish.cpp:67:47: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    while (k >= 0 && (k == f[i-1].size() || (j != f[i].size() && f[i-1][k][0] > f[i][j][0])))
      |                                             ~~^~~~~~~~~~~~~~
fish.cpp:72:10: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    if (j < f[i].size())
      |        ~~^~~~~~~~~~~~~
fish.cpp:79:21: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for (int j = 0; j <= f[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:81:13: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |    while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
      |           ~~^~~~~~~~~~~~~~~
fish.cpp:81:35: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |    while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
      |                                 ~~^~~~~~~~~~~~~~
fish.cpp:92:21: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   for (int j = 0; j < f[i-1].size(); j++)
      |                   ~~^~~~~~~~~~~~~~~
fish.cpp:96:10: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |    if (j < f[i].size())
      |        ~~^~~~~~~~~~~~~
fish.cpp:98:24: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |    while (k >= 0 && (k == f[i-1].size() || f[i-1][k][0] > f[i-1][j][0]))
      |                      ~~^~~~~~~~~~~~~~~~
fish.cpp:110:21: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |   for (int j = 0; j <= f[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:113:13: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |    while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
      |           ~~^~~~~~~~~~~~~~~
fish.cpp:113:35: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |    while (k < f[i-1].size() && (j == f[i].size() || f[i-1][k][0] < f[i][j][0]))
      |                                 ~~^~~~~~~~~~~~~~
fish.cpp:126:20: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::array<long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |  for (int i = 0; i < dp[n-1].size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 17468 KB Output is correct
2 Correct 46 ms 19052 KB Output is correct
3 Correct 13 ms 12828 KB Output is correct
4 Correct 13 ms 12716 KB Output is correct
5 Correct 129 ms 32100 KB Output is correct
6 Correct 122 ms 34124 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 69 ms 22636 KB Output is correct
3 Correct 80 ms 25340 KB Output is correct
4 Correct 38 ms 17464 KB Output is correct
5 Correct 46 ms 19048 KB Output is correct
6 Correct 5 ms 9584 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9616 KB Output is correct
10 Correct 13 ms 12792 KB Output is correct
11 Correct 12 ms 12800 KB Output is correct
12 Correct 40 ms 17620 KB Output is correct
13 Correct 46 ms 19008 KB Output is correct
14 Correct 40 ms 17580 KB Output is correct
15 Correct 42 ms 18488 KB Output is correct
16 Correct 39 ms 17564 KB Output is correct
17 Correct 42 ms 18412 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12740 KB Output is correct
2 Correct 14 ms 12748 KB Output is correct
3 Incorrect 29 ms 17088 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '23377109270875'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9628 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9632 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '218048786436'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9628 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9632 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '218048786436'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9628 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9632 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '218048786436'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12740 KB Output is correct
2 Correct 14 ms 12748 KB Output is correct
3 Incorrect 29 ms 17088 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '23377109270875'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 17468 KB Output is correct
2 Correct 46 ms 19052 KB Output is correct
3 Correct 13 ms 12828 KB Output is correct
4 Correct 13 ms 12716 KB Output is correct
5 Correct 129 ms 32100 KB Output is correct
6 Correct 122 ms 34124 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 69 ms 22636 KB Output is correct
9 Correct 80 ms 25340 KB Output is correct
10 Correct 38 ms 17464 KB Output is correct
11 Correct 46 ms 19048 KB Output is correct
12 Correct 5 ms 9584 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 4 ms 9616 KB Output is correct
16 Correct 13 ms 12792 KB Output is correct
17 Correct 12 ms 12800 KB Output is correct
18 Correct 40 ms 17620 KB Output is correct
19 Correct 46 ms 19008 KB Output is correct
20 Correct 40 ms 17580 KB Output is correct
21 Correct 42 ms 18488 KB Output is correct
22 Correct 39 ms 17564 KB Output is correct
23 Correct 42 ms 18412 KB Output is correct
24 Correct 12 ms 12740 KB Output is correct
25 Correct 14 ms 12748 KB Output is correct
26 Incorrect 29 ms 17088 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '23377109270875'
27 Halted 0 ms 0 KB -