oj.uz

Submission #1075616

# Submission time Handle Problem Language Result Execution time Memory
1075616 2024-08-26T08:00:15 Z UmairAhmadMirza Catfish Farm (IOI22_fish) C++17
3 / 100
 60 ms 10864 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N=305;
ll dp[N][N],inc[N][N];
ll sm[N][N];
long long max_weights(int n, int m, vector<int> X, vector<int> Y,
                      vector<int> W)
{
	ll o=0,e=0;
	for(int i=0;i<m;i++){
		// sm[X[i]+1][Y[i]+1]+=W[i];
		if(X[i]%2==0)
			e+=W[i];
		else
			o+=W[i];
	}
	return max(o,e);
	for (int i = 1; i <=n; ++i)
		for(int j=1;j<=n;++j)
			sm[i][j]+=sm[i][j-1];
	for(int i=2;i<=n;i++)
		for(int k=0;k<=n;k++){
			//cal inc
			for(int p=0;p<=k;p++)
				inc[i][k]=max(inc[i][k],max(inc[i-1][p]+sm[i-1][k]-sm[i-1][p],dp[i-1][p]));
			dp[i][k]=inc[i][k];
			for(int p=k+1;p<=n;p++)
				dp[i][k]=max(dp[i][k],dp[i-1][p]+sm[i][p]-sm[i][k]);
			// cout<<dp[i][k]<<' ';
			// if(k==n)
			// 	cout<<endl;
		}
	ll ans=0;
	for(int i=0;i<=n;i++)
		ans=max(ans,dp[n][i]);
	return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3332 KB Output is correct
2 Correct 18 ms 3716 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 59 ms 10624 KB Output is correct
6 Correct 60 ms 10864 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.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 Incorrect 10 ms 2396 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '13412238152019'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
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 Incorrect 10 ms 2396 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '13412238152019'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3332 KB Output is correct
2 Correct 18 ms 3716 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 59 ms 10624 KB Output is correct
6 Correct 60 ms 10864 KB Output is correct
7 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -