oj.uz

Submission #629232

# Submission time Handle Problem Language Result Execution time Memory
629232 2022-08-14T09:42:04 Z handlename Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 119848 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
			//calculate increasing
			for (int k=0;k<=j;k++){ //prev col height
				long long cur=dp[i-1][k][0];
				cur-=pre[i][k];
				cur+=pre[i-1][j]-pre[i-1][k];
				cur+=pre[i+1][j];
				dp[i][j][0]=max(dp[i][j][0],cur);
			}
			if (i>=2){
				//i-1 is 0
				for (int k=0;k<=j;k++){ //i-2 col height
					long long cur=dp[i-2][k][1];
					cur+=pre[i-1][j]-pre[i-1][k];
					cur+=pre[i+1][j];
					dp[i][j][0]=max(dp[i][j][0],cur);
				}
				for (int k=j;k<=n;k++){ //i-2 col height
					long long cur=dp[i-2][k][1];
					cur+=pre[i+1][j];
					dp[i][j][0]=max(dp[i][j][0],cur);
				}
			}
			//calculate decreasing
			for (int k=j;k<=n;k++){ //prev col height
				long long cur=dp[i-1][k][1];
				cur-=pre[i][j];
				cur+=pre[i+1][j];
				dp[i][j][1]=max(dp[i][j][1],cur);
			}
		}
		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 1093 ms 119848 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 1099 ms 119688 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 108144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 67 ms 4860 KB Output is correct
11 Correct 9 ms 2056 KB Output is correct
12 Correct 65 ms 4848 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 65 ms 4872 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 67 ms 4860 KB Output is correct
11 Correct 9 ms 2056 KB Output is correct
12 Correct 65 ms 4848 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 65 ms 4872 KB Output is correct
15 Correct 83 ms 4812 KB Output is correct
16 Correct 3 ms 1232 KB Output is correct
17 Correct 77 ms 5836 KB Output is correct
18 Correct 78 ms 5824 KB Output is correct
19 Correct 96 ms 5832 KB Output is correct
20 Correct 79 ms 5880 KB Output is correct
21 Correct 78 ms 5880 KB Output is correct
22 Correct 100 ms 6916 KB Output is correct
23 Correct 69 ms 5012 KB Output is correct
24 Correct 75 ms 5536 KB Output is correct
25 Correct 65 ms 4860 KB Output is correct
26 Correct 68 ms 5012 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 67 ms 4860 KB Output is correct
11 Correct 9 ms 2056 KB Output is correct
12 Correct 65 ms 4848 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 65 ms 4872 KB Output is correct
15 Correct 83 ms 4812 KB Output is correct
16 Correct 3 ms 1232 KB Output is correct
17 Correct 77 ms 5836 KB Output is correct
18 Correct 78 ms 5824 KB Output is correct
19 Correct 96 ms 5832 KB Output is correct
20 Correct 79 ms 5880 KB Output is correct
21 Correct 78 ms 5880 KB Output is correct
22 Correct 100 ms 6916 KB Output is correct
23 Correct 69 ms 5012 KB Output is correct
24 Correct 75 ms 5536 KB Output is correct
25 Correct 65 ms 4860 KB Output is correct
26 Correct 68 ms 5012 KB Output is correct
27 Execution timed out 1089 ms 73348 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 108144 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 1093 ms 119848 KB Time limit exceeded
2 Halted 0 ms 0 KB -