oj.uz

Submission #629268

# Submission time Handle Problem Language Result Execution time Memory
629268 2022-08-14T10:18:55 Z handlename Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 107564 KB 
#include <bits/stdc++.h>
//#include "fish.h"
using namespace std;
#define pb push_back
#define mp make_pair
long long dp[3005][3005][2]; //col,height,increasing/decreasing
long long pre[3005][3005];
long long max_weights(int n,int m,vector<int> x,vector<int> y,vector<int> w){
	for (int i=0;i<m;i++){
		x[i]++;
		y[i]++;
		pre[x[i]][y[i]]=w[i];
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			pre[i][j]+=pre[i][j-1];
		}
	}
	for (int i=1;i<=n;i++){ //col
		for (int j=0;j<=n;j++){ //col height
			dp[i][j][0]=-1e18;
			dp[i][j][1]=-1e18;
		}
		long long maxi=0;
		for (int j=0;j<=n;j++){
			//calculate increasing
			maxi=max(maxi,dp[i-1][j][0]-pre[i][j]-pre[i-1][j]);
			if (i>=2){
				maxi=max(maxi,dp[i-2][j][1]-pre[i-1][j]);
				/*
				//i-1 col height is 0
				for (int k=0;k<=j;k++){ //i-2 col height
					maxi=max(maxi,dp[i-2][k][1]-pre[i-1][k]);
				}
				* */
			}
			dp[i][j][0]=maxi+pre[i-1][j]+pre[i+1][j];
		}
		for (int j=0;j<=n;j++){
			if (i>=2){
				for (int k=j;k<=n;k++){ //i-2 col height
					dp[i][j][0]=max(dp[i][j][0],dp[i-2][k][1]+pre[i+1][j]);
				}
			}
		}
		for (int j=0;j<=n;j++){
			//calculate decreasing
			for (int k=j;k<=n;k++){ //prev col height
				dp[i][j][1]=max(dp[i][j][1],dp[i-1][k][1]);
			}
			dp[i][j][1]+=pre[i+1][j]-pre[i][j];
		}
		for (int j=0;j<=n;j++){
			dp[i][j][1]=max(dp[i][j][1],dp[i][j][0]);
		}
	}
	long long ans=0;
	for (int j=0;j<=n;j++){
		ans=max(ans,dp[n][j][1]);
	}
	return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 107564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 97408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 236 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 6 ms 1972 KB Output is correct
10 Correct 40 ms 4812 KB Output is correct
11 Correct 7 ms 2132 KB Output is correct
12 Correct 36 ms 4792 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 43 ms 4756 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 236 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 6 ms 1972 KB Output is correct
10 Correct 40 ms 4812 KB Output is correct
11 Correct 7 ms 2132 KB Output is correct
12 Correct 36 ms 4792 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 43 ms 4756 KB Output is correct
15 Correct 42 ms 4808 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 51 ms 5852 KB Output is correct
18 Correct 45 ms 5808 KB Output is correct
19 Correct 45 ms 5804 KB Output is correct
20 Correct 48 ms 5872 KB Output is correct
21 Correct 59 ms 5860 KB Output is correct
22 Correct 77 ms 6884 KB Output is correct
23 Correct 37 ms 4984 KB Output is correct
24 Correct 40 ms 5480 KB Output is correct
25 Correct 35 ms 4840 KB Output is correct
26 Correct 44 ms 4956 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 236 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 6 ms 1972 KB Output is correct
10 Correct 40 ms 4812 KB Output is correct
11 Correct 7 ms 2132 KB Output is correct
12 Correct 36 ms 4792 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 43 ms 4756 KB Output is correct
15 Correct 42 ms 4808 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 51 ms 5852 KB Output is correct
18 Correct 45 ms 5808 KB Output is correct
19 Correct 45 ms 5804 KB Output is correct
20 Correct 48 ms 5872 KB Output is correct
21 Correct 59 ms 5860 KB Output is correct
22 Correct 77 ms 6884 KB Output is correct
23 Correct 37 ms 4984 KB Output is correct
24 Correct 40 ms 5480 KB Output is correct
25 Correct 35 ms 4840 KB Output is correct
26 Correct 44 ms 4956 KB Output is correct
27 Execution timed out 1074 ms 75324 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 97408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 107564 KB Time limit exceeded
2 Halted 0 ms 0 KB -