oj.uz

Submission #873624

# Submission time Handle Problem Language Result Execution time Memory
873624 2023-11-15T11:49:44 Z Nonoze Catfish Farm (IOI22_fish) C++17
46 / 100
 1000 ms 192340 KB 
#include "fish.h"
//#include "grader.cpp"

#include <bits/stdc++.h>
using namespace std;
#define int long long

unordered_map<int, unordered_map<int, unordered_map<int,int>>> memo;
vector<vector<pair<int, int>>> values;
int n;
int mini=0;

int dp(int empl, int take, int pretake) {
	if (empl>=n) return 0;
	if (memo[empl][take].count(pretake)) return memo[empl][take][pretake];
	int ans=dp(empl+1, 0, take);
	int sum=0;
	int empl1=0, empl2=0, empl3=0;
	int sz1=(empl?values[empl-1].size():0), sz2=values[empl].size(), sz3=(empl+1<n?values[empl+1].size():0);
	while (empl1<sz1 || empl2<sz2 || empl3<sz3) {
		int i=LLONG_MAX, indice=1;
		if (empl2<sz2 && values[empl][empl2].first<i) {
			i=values[empl][empl2].first;
			indice=2;
		}
		if (empl1<sz1 && values[empl-1][empl1].first<i) {
			i=values[empl-1][empl1].first;
			indice=1;
		}
		if (empl3<sz3 && values[empl+1][empl3].first<i) {
			i=values[empl+1][empl3].first;
			indice=3;
		}
		if (indice==1) {
			if (pretake<i+1 && take<i+1) {
				sum+=values[empl-1][empl1].second;
				ans=max(ans, dp(empl+1, i+1, take)+sum);
			}
			empl1++;
		} else if (indice==2) {
			if (take>=i+1) {
				sum-=values[empl][empl2].second;
			}
			empl2++;
		} else {
			sum+=values[empl+1][empl3].second;
			ans=max(ans, dp(empl+1, i+1, take)+sum);
			empl3++;
		}
	}
	return memo[empl][take][pretake]=ans;
}
#undef int
long long max_weights(int N, int m, vector<int> x, vector<int> y, vector<int> w) {
	#define int long long
	n=N;
	bool tacha=true, tachb=true;
	for (int i = 0; i < m; ++i)
	{
		if (x[i]%2) tacha=false;
		if (x[i]>1) tachb=false;
	}
	if (tacha)
	{
		int ans=0;
		for (int i = 0; i < m; ++i) ans+=w[i];
		return ans;
	}
	if (tachb)
	{
		vector<vector<int>> farm(2, vector<int> (n, 0));
		for (int i=0; i<m; i++) {
			farm[x[i]][y[i]]=w[i];
		}
		vector<int> suml, sumr;
		suml.push_back(farm[0][0]);
		sumr.push_back(farm[1][0]);
		for (int i=1; i<n; i++) {
			suml.push_back(suml.back()+farm[0][i]);
			sumr.push_back(sumr.back()+farm[1][i]);
		}
		if (n==2) return max(suml.back(), sumr.back());
		int ans=sumr.back();
		for (int i=0; i<n; i++) {
			ans=max(ans, suml[i]+sumr.back()-sumr[i]);
		}
		return ans;
	}
	mini=0;
	for (int i=0; i<m; i++) {
		mini=max(mini, (long long) y[i]);
	}
	mini++;
	values.resize(n);
	for (int i=0; i<m; i++) {
		values[x[i]].push_back({y[i], w[i]});
	}
	for (int i=0; i<n; i++) {
		sort(values[i].begin(), values[i].end());
	}
	return dp(0, 0, 0);
	#undef int
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2132 KB Output is correct
2 Correct 21 ms 2644 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 65 ms 7284 KB Output is correct
6 Correct 66 ms 7284 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 37 ms 8048 KB Output is correct
3 Correct 45 ms 9400 KB Output is correct
4 Correct 17 ms 2140 KB Output is correct
5 Correct 24 ms 2648 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 19 ms 6072 KB Output is correct
13 Correct 23 ms 7244 KB Output is correct
14 Correct 20 ms 6128 KB Output is correct
15 Correct 22 ms 6976 KB Output is correct
16 Correct 20 ms 6044 KB Output is correct
17 Correct 21 ms 6988 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 57 ms 57464 KB Output is correct
3 Correct 97 ms 70852 KB Output is correct
4 Correct 88 ms 70344 KB Output is correct
5 Correct 147 ms 90816 KB Output is correct
6 Correct 141 ms 90824 KB Output is correct
7 Correct 144 ms 90888 KB Output is correct
8 Correct 144 ms 90772 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 15 ms 1884 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 15 ms 1884 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 600 ms 8212 KB Output is correct
17 Execution timed out 1002 ms 8160 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 15 ms 1884 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 600 ms 8212 KB Output is correct
17 Execution timed out 1002 ms 8160 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 57 ms 57464 KB Output is correct
3 Correct 97 ms 70852 KB Output is correct
4 Correct 88 ms 70344 KB Output is correct
5 Correct 147 ms 90816 KB Output is correct
6 Correct 141 ms 90824 KB Output is correct
7 Correct 144 ms 90888 KB Output is correct
8 Correct 144 ms 90772 KB Output is correct
9 Correct 236 ms 122308 KB Output is correct
10 Correct 154 ms 64868 KB Output is correct
11 Correct 332 ms 129480 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 52 ms 57288 KB Output is correct
21 Correct 52 ms 57140 KB Output is correct
22 Correct 281 ms 121400 KB Output is correct
23 Correct 518 ms 180260 KB Output is correct
24 Correct 591 ms 192340 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2132 KB Output is correct
2 Correct 21 ms 2644 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 65 ms 7284 KB Output is correct
6 Correct 66 ms 7284 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 37 ms 8048 KB Output is correct
9 Correct 45 ms 9400 KB Output is correct
10 Correct 17 ms 2140 KB Output is correct
11 Correct 24 ms 2648 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 19 ms 6072 KB Output is correct
19 Correct 23 ms 7244 KB Output is correct
20 Correct 20 ms 6128 KB Output is correct
21 Correct 22 ms 6976 KB Output is correct
22 Correct 20 ms 6044 KB Output is correct
23 Correct 21 ms 6988 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 57 ms 57464 KB Output is correct
26 Correct 97 ms 70852 KB Output is correct
27 Correct 88 ms 70344 KB Output is correct
28 Correct 147 ms 90816 KB Output is correct
29 Correct 141 ms 90824 KB Output is correct
30 Correct 144 ms 90888 KB Output is correct
31 Correct 144 ms 90772 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 15 ms 1884 KB Output is correct
42 Correct 6 ms 856 KB Output is correct
43 Correct 5 ms 1368 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 3 ms 1116 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 600 ms 8212 KB Output is correct
48 Execution timed out 1002 ms 8160 KB Time limit exceeded
49 Halted 0 ms 0 KB -