oj.uz

Submission #871728

# Submission time Handle Problem Language Result Execution time Memory
871728 2023-11-11T11:54:18 Z Nonoze Catfish Farm (IOI22_fish) C++17
23 / 100
 1000 ms 88456 KB 
#include "fish.h"
//#include "grader.cpp"

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

map<pair<int, pair<int, int>>, int> memo;
vector<vector<int>> values;
int n;

int dp(int empl, int take, int pretake) {
	if (empl>=n) return 0;
	if (memo.count({empl, {take, pretake}})) return memo[{empl, {take, pretake}}];
	int ans=dp(empl+1, 0, take);
	int sum=0;
	for (int i=0; i<min(n, 8LL); i++) {
		int temp=dp(empl+1, (1<<(i+1))-1, take);
		if ((pretake&(1<<i))!=(1<<i) && (take&(1<<i))!=(1<<i) && empl>0) {
			sum+=values[empl-1][i];
		}
		if (empl+1<n) sum+=values[empl+1][i];
		if ((take&(1<<i))==(1<<i)) sum-=values[empl][i];
		ans=max(ans, temp+sum);
	}
	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, tachc=true;
	for (int i = 0; i < m; ++i)
	{
		if (x[i]%2) tacha=false;
		if (x[i]>1) tachb=false;
		if (y[i]) tachc=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;
	}
	values.resize(n, vector<int>(8, 0));
	for (int i=0; i<m; i++) {
		values[x[i]][y[i]]=w[i];
	}
	return dp(0, 0, 0);
	#undef int
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:33:31: warning: variable 'tachc' set but not used [-Wunused-but-set-variable]
   33 |  bool tacha=true, tachb=true, tachc=true;
      |                               ^~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2140 KB Output is correct
2 Correct 22 ms 2640 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 70 ms 7248 KB Output is correct
6 Correct 64 ms 7284 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 37 ms 7824 KB Output is correct
3 Correct 45 ms 9684 KB Output is correct
4 Correct 19 ms 2140 KB Output is correct
5 Correct 23 ms 2644 KB Output is correct
6 Correct 1 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 6076 KB Output is correct
13 Correct 23 ms 7244 KB Output is correct
14 Correct 19 ms 5948 KB Output is correct
15 Correct 27 ms 6988 KB Output is correct
16 Correct 20 ms 6080 KB Output is correct
17 Correct 22 ms 6996 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Execution timed out 1103 ms 88456 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 10 ms 1388 KB Output is correct
10 Correct 24 ms 2384 KB Output is correct
11 Correct 10 ms 1356 KB Output is correct
12 Correct 20 ms 2320 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 21 ms 2236 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 10 ms 1388 KB Output is correct
10 Correct 24 ms 2384 KB Output is correct
11 Correct 10 ms 1356 KB Output is correct
12 Correct 20 ms 2320 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 21 ms 2236 KB Output is correct
15 Runtime error 22 ms 4444 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 10 ms 1388 KB Output is correct
10 Correct 24 ms 2384 KB Output is correct
11 Correct 10 ms 1356 KB Output is correct
12 Correct 20 ms 2320 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 21 ms 2236 KB Output is correct
15 Runtime error 22 ms 4444 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Execution timed out 1103 ms 88456 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2140 KB Output is correct
2 Correct 22 ms 2640 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 70 ms 7248 KB Output is correct
6 Correct 64 ms 7284 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 37 ms 7824 KB Output is correct
9 Correct 45 ms 9684 KB Output is correct
10 Correct 19 ms 2140 KB Output is correct
11 Correct 23 ms 2644 KB Output is correct
12 Correct 1 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 6076 KB Output is correct
19 Correct 23 ms 7244 KB Output is correct
20 Correct 19 ms 5948 KB Output is correct
21 Correct 27 ms 6988 KB Output is correct
22 Correct 20 ms 6080 KB Output is correct
23 Correct 22 ms 6996 KB Output is correct
24 Correct 0 ms 356 KB Output is correct
25 Execution timed out 1103 ms 88456 KB Time limit exceeded
26 Halted 0 ms 0 KB -