oj.uz

Submission #1107008

# Submission time Handle Problem Language Result Execution time Memory
1107008 2024-10-31T11:24:52 Z I_am_Polish_Girl Catfish Farm (IOI22_fish) C++17
18 / 100
 104 ms 25928 KB 
#include "fish.h"

#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <bitset>
#include <cmath>
#include <string>

using namespace std;


int log_ = 23;
long long inf = 8000000007000000007ll;
int mod = 1000000007;

int p = 523;


#include <vector>

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) 
{
	int n = N;
	

	vector <vector <pair <int, int>>> vp(n);
	vector <long long> sum(n);


	for (int i = 0; i < X.size(); i++)
	{
		vp[X[i]].push_back({ Y[i] , W[i] });

		sum[X[i]] += W[i];
	}

	for (int i = 0; i < n; i++)
	{
		sort(vp[i].begin(), vp[i].end());
	}

	vector <vector <long long>> dp0(n);
	vector <vector <long long>> dp1(n);

	for (int i = 0; i < n; i++)
	{
		dp0[i].resize(vp[i].size());
		dp1[i].resize(vp[i].size());
	}

	long long ans = 0;
	long long mx_ = 0;

	vector <long long> dp(n);

	for (int i = 0; i < n; i++)
	{

		if (i >= 4)
		{
			mx_ = max(mx_, dp[i - 4] + sum[i - 3] + sum[i - 2]);
		}

		for (int j = 0; j < vp[i].size(); j++)
		{
			ans = max(ans , mx_ + vp[i][j].second);
		}


		if ((i > 0) and (vp[i].size() > 0))
		{

			if (i != n - 1)
			{
				int ind = 0;

				int sz = vp[i].size();

				long long mx = 0;

				for (int j = 0; j < sz; j++)
				{
					while ((ind < vp[i - 1].size()) and (vp[i - 1][ind].first < vp[i][j].first))
					{

						mx = max(mx, dp0[i - 1][ind]);
						ind++;
					}

					mx = max(mx, mx_);

					dp0[i][j] = mx + vp[i][j].second;
					mx = max(mx, dp0[i][j]);
				}
			}

			if (i != 0)
			{
				int ind = vp[i - 1].size();

				ind--;

				int sz = vp[i].size();

				long long mx1 = 0;
				long long mx2 = 0;


				for (int j = sz - 1; j >= 0; j--)
				{
					while ((ind >= 0) and (vp[i - 1][ind].first > vp[i][j].first))
					{
						mx1 = max(mx1, dp1[i - 1][ind]);
						ind--;

					}

					mx1 = max(mx1, mx_);
					mx2 = max(mx2, mx_);

					dp1[i][j] = max(mx1 , mx2) + vp[i][j].second;

					if (i < n - 1)
					{
						dp0[i][j] = max(dp0[i][j], mx1+ vp[i][j].second);
					}

					if ((ind >= 0) and(i != n - 1))
					{
						if (vp[i - 1][ind].first == vp[i][j].first)
						{
							dp0[i][j] = max(dp1[i - 1][ind] + vp[i][j].second, dp0[i][j]);
						}
					}

					mx2 = max(mx2, dp1[i][j]);
				}

			}

			if (i < n - 1)
			{
				if (vp[i].size() > 0)
				{
					long long mx__ = 0;
					for (int j = 0; j < vp[i].size(); j++)
					{
						if (mx__ != 0)
							mx__ += vp[i][j].second;
						
						mx__ = max(mx__, dp0[i][j]);

						dp0[i][j] = mx__;
					}
				}
			}
		}
		else
		{
			long long s = 0;
			for (int j = 0; j < vp[i].size(); j++)
			{
				s += vp[i][j].second;

				dp0[i][j] = s;
				dp1[i][j] = 0;
			}
		}


		for (int j = 0; j < vp[i].size(); j++)
		{
			ans = max(ans, dp0[i][j]);
			ans = max(ans, dp1[i][j]);
		}

		if (i - 1 >= 0)
		{
			for (int j = 0; j < vp[i - 1].size(); j++)
			{
				mx_ = max(mx_, dp0[i - 1][j]);
				mx_ = max(mx_, dp1[i - 1][j]);
			}
		}

		dp[i] = mx_;

		ans = max(ans, mx_);
	}

	if (n >= 4)
	{
		mx_ = max(mx_, dp[n - 4] + sum[n - 3] + sum[n - 2]);
	}
	ans = max(ans, mx_);

	return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (int i = 0; i < X.size(); i++)
      |                  ~~^~~~~~~~~~
fish.cpp:75:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for (int j = 0; j < vp[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:94:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |      while ((ind < vp[i - 1].size()) and (vp[i - 1][ind].first < vp[i][j].first))
      |              ~~~~^~~~~~~~~~~~~~~~~~
fish.cpp:157:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |      for (int j = 0; j < vp[i].size(); j++)
      |                      ~~^~~~~~~~~~~~~~
fish.cpp:172:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |    for (int j = 0; j < vp[i].size(); j++)
      |                    ~~^~~~~~~~~~~~~~
fish.cpp:182:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  182 |   for (int j = 0; j < vp[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:190:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |    for (int j = 0; j < vp[i - 1].size(); j++)
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11972 KB Output is correct
2 Correct 37 ms 13760 KB Output is correct
3 Correct 4 ms 9040 KB Output is correct
4 Correct 4 ms 9040 KB Output is correct
5 Correct 86 ms 22956 KB Output is correct
6 Correct 104 ms 25928 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 47 ms 15796 KB Output is correct
3 Correct 61 ms 18512 KB Output is correct
4 Correct 27 ms 11972 KB Output is correct
5 Correct 30 ms 13760 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 9040 KB Output is correct
11 Correct 4 ms 9040 KB Output is correct
12 Correct 25 ms 12012 KB Output is correct
13 Correct 33 ms 13752 KB Output is correct
14 Correct 28 ms 12092 KB Output is correct
15 Correct 28 ms 13508 KB Output is correct
16 Correct 29 ms 12228 KB Output is correct
17 Correct 30 ms 13308 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9040 KB Output is correct
2 Correct 4 ms 9040 KB Output is correct
3 Correct 24 ms 14504 KB Output is correct
4 Correct 19 ms 13188 KB Output is correct
5 Correct 43 ms 20560 KB Output is correct
6 Correct 44 ms 20552 KB Output is correct
7 Correct 49 ms 20616 KB Output is correct
8 Correct 50 ms 20788 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Incorrect 1 ms 588 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '277681576679'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Incorrect 1 ms 588 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '277681576679'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Incorrect 1 ms 588 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '277681576679'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9040 KB Output is correct
2 Correct 4 ms 9040 KB Output is correct
3 Correct 24 ms 14504 KB Output is correct
4 Correct 19 ms 13188 KB Output is correct
5 Correct 43 ms 20560 KB Output is correct
6 Correct 44 ms 20552 KB Output is correct
7 Correct 49 ms 20616 KB Output is correct
8 Correct 50 ms 20788 KB Output is correct
9 Correct 40 ms 20552 KB Output is correct
10 Correct 42 ms 11592 KB Output is correct
11 Correct 65 ms 23008 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 4 ms 9040 KB Output is correct
19 Correct 4 ms 9040 KB Output is correct
20 Correct 4 ms 9040 KB Output is correct
21 Correct 5 ms 9040 KB Output is correct
22 Incorrect 49 ms 17480 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45259457816092'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11972 KB Output is correct
2 Correct 37 ms 13760 KB Output is correct
3 Correct 4 ms 9040 KB Output is correct
4 Correct 4 ms 9040 KB Output is correct
5 Correct 86 ms 22956 KB Output is correct
6 Correct 104 ms 25928 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 47 ms 15796 KB Output is correct
9 Correct 61 ms 18512 KB Output is correct
10 Correct 27 ms 11972 KB Output is correct
11 Correct 30 ms 13760 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 4 ms 9040 KB Output is correct
17 Correct 4 ms 9040 KB Output is correct
18 Correct 25 ms 12012 KB Output is correct
19 Correct 33 ms 13752 KB Output is correct
20 Correct 28 ms 12092 KB Output is correct
21 Correct 28 ms 13508 KB Output is correct
22 Correct 29 ms 12228 KB Output is correct
23 Correct 30 ms 13308 KB Output is correct
24 Correct 4 ms 9040 KB Output is correct
25 Correct 4 ms 9040 KB Output is correct
26 Correct 24 ms 14504 KB Output is correct
27 Correct 19 ms 13188 KB Output is correct
28 Correct 43 ms 20560 KB Output is correct
29 Correct 44 ms 20552 KB Output is correct
30 Correct 49 ms 20616 KB Output is correct
31 Correct 50 ms 20788 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 504 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 592 KB Output is correct
42 Incorrect 1 ms 588 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '277681576679'
43 Halted 0 ms 0 KB -