oj.uz

답안 #1106975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106975 2024-10-31T10:47:35 Z I_am_Polish_Girl 메기 농장 (IOI22_fish) C++17
18 / 100
 91 ms 24176 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);


	for (int i = 0; i < X.size(); i++)
	{
		vp[X[i]].push_back({ Y[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;

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

		if (i > 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 mx = 0;

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

					}

					mx = max(mx, mx_);

					dp1[i][j] = mx + vp[i][j].second;

					if (i < n - 1)
					{
						dp0[i][j] = max(dp0[i][j], dp1[i][j]);
					}

					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]);
						}
					}

					mx = max(mx, dp1[i][j]);

				}

			}

			/*long long mx = -inf;
			for (int j = 0; j < vp[i].size(); j++)
			{
				mx += vp[i][j].second;
				mx = max(mx, dp0[i][j]);

				dp0[i][j] = mx;
			}


			int sz = vp[i].size();
			mx = -inf;
			for (int j = sz - 1; j >= 0; j--)
			{
				mx += vp[i][j].second;
				mx = max(mx, dp1[i][j]);

				dp1[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]);
			}
		}
	}


	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:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for (int i = 0; i < X.size(); i++)
      |                  ~~^~~~~~~~~~
fish.cpp:64: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]
   64 |   for (int j = 0; j < vp[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:82: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]
   82 |      while ((ind < vp[i - 1].size()) and (vp[i - 1][ind].first < vp[i][j].first))
      |              ~~~~^~~~~~~~~~~~~~~~~~
fish.cpp:161: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]
  161 |    for (int j = 0; j < vp[i].size(); j++)
      |                    ~~^~~~~~~~~~~~~~
fish.cpp:171: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]
  171 |   for (int j = 0; j < vp[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~
fish.cpp:179: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]
  179 |    for (int j = 0; j < vp[i - 1].size(); j++)
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 10692 KB Output is correct
2 Correct 30 ms 12244 KB Output is correct
3 Correct 3 ms 7248 KB Output is correct
4 Correct 3 ms 7248 KB Output is correct
5 Correct 89 ms 21428 KB Output is correct
6 Correct 91 ms 24176 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 508 KB Output is correct
2 Correct 48 ms 14300 KB Output is correct
3 Correct 63 ms 16936 KB Output is correct
4 Correct 25 ms 10468 KB Output is correct
5 Correct 30 ms 12220 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 3 ms 7248 KB Output is correct
11 Correct 3 ms 7248 KB Output is correct
12 Correct 26 ms 10752 KB Output is correct
13 Correct 32 ms 12216 KB Output is correct
14 Correct 25 ms 10588 KB Output is correct
15 Correct 31 ms 11972 KB Output is correct
16 Correct 26 ms 10684 KB Output is correct
17 Correct 27 ms 11728 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7248 KB Output is correct
2 Correct 3 ms 7248 KB Output is correct
3 Correct 25 ms 12856 KB Output is correct
4 Correct 16 ms 11620 KB Output is correct
5 Correct 57 ms 19188 KB Output is correct
6 Correct 45 ms 19016 KB Output is correct
7 Correct 43 ms 19108 KB Output is correct
8 Correct 42 ms 19048 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7248 KB Output is correct
2 Correct 3 ms 7248 KB Output is correct
3 Correct 25 ms 12856 KB Output is correct
4 Correct 16 ms 11620 KB Output is correct
5 Correct 57 ms 19188 KB Output is correct
6 Correct 45 ms 19016 KB Output is correct
7 Correct 43 ms 19108 KB Output is correct
8 Correct 42 ms 19048 KB Output is correct
9 Correct 43 ms 19024 KB Output is correct
10 Incorrect 34 ms 10824 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '32247709734698'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 10692 KB Output is correct
2 Correct 30 ms 12244 KB Output is correct
3 Correct 3 ms 7248 KB Output is correct
4 Correct 3 ms 7248 KB Output is correct
5 Correct 89 ms 21428 KB Output is correct
6 Correct 91 ms 24176 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 48 ms 14300 KB Output is correct
9 Correct 63 ms 16936 KB Output is correct
10 Correct 25 ms 10468 KB Output is correct
11 Correct 30 ms 12220 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 0 ms 336 KB Output is correct
16 Correct 3 ms 7248 KB Output is correct
17 Correct 3 ms 7248 KB Output is correct
18 Correct 26 ms 10752 KB Output is correct
19 Correct 32 ms 12216 KB Output is correct
20 Correct 25 ms 10588 KB Output is correct
21 Correct 31 ms 11972 KB Output is correct
22 Correct 26 ms 10684 KB Output is correct
23 Correct 27 ms 11728 KB Output is correct
24 Correct 5 ms 7248 KB Output is correct
25 Correct 3 ms 7248 KB Output is correct
26 Correct 25 ms 12856 KB Output is correct
27 Correct 16 ms 11620 KB Output is correct
28 Correct 57 ms 19188 KB Output is correct
29 Correct 45 ms 19016 KB Output is correct
30 Correct 43 ms 19108 KB Output is correct
31 Correct 42 ms 19048 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 508 KB Output is correct
40 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '194964455320'
41 Halted 0 ms 0 KB -