oj.uz

Submission #828566

# Submission time Handle Problem Language Result Execution time Memory
828566 2023-08-17T11:21:51 Z ttamx Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=1e5+5;
const ll inf=1e18;

int n,m;
vector<vector<ll>> w;
vector<vector<vector<ll>>> dp;
ll suff[N];
ll val[N];

long long max_weights(int _n,int _m,vector<int> X,vector<int> Y,vector<int> W) {
	n=_n,m=_m;
	int mxy=0;
	for(auto x:Y)mxy=max(mxy,x+1);
	w=vector<vector<ll>>(n+5,vector<ll>(mxy+5));
	dp=vector<vector<vector<ll>>>(n+5,vector<vector<ll>>(mxy+5,vector<ll>(2)));
	for(int i=0;i<m;i++)w[X[i]+1][Y[i]+1]=W[i];
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)w[i][j]+=w[i][j-1];
	for(int i=1;i<=n;i++)for(int j=0;j<=n;j++)dp[i][j][0]=dp[i][j][1]=-inf;
	for(int i=1;i<=n;i++){
		if(i>=2)for(int j=n;j>=0;j--)suff[j]=max(suff[j+1],dp[i-2][j][1]);
		ll tmp=-inf,tmp2=-inf;
		for(int j=0;j<=n;j++){
			tmp=max(tmp,dp[i-1][j][0]-w[i][j]-w[i-1][j]);
			dp[i][j][0]=w[i-1][j]+tmp+w[i+1][j];
			if(i>=2){
				tmp2=max(tmp2,dp[i-2][j][0]-w[i-1][j]);
				dp[i][j][0]=max(dp[i][j][0],w[i-1][j]+tmp+w[i+1][j]);
				dp[i][j][0]=max(dp[i][j][0],suff[j]+w[i+1][j]);
			}
		}
		tmp=-inf;
		for(int j=n;j>=0;j--){
			tmp=max(tmp,dp[i-1][j][1]);
			dp[i][j][1]=tmp-w[i][j]+w[i+1][j];
			dp[i][j][1]=max(dp[i][j][1],dp[i][j][0]);
		}
	}
	ll ans=0;
	for(int i=0;i<=n;i++)ans=max(ans,dp[n][i][1]);
	return ans;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 880 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Runtime error 1 ms 596 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Runtime error 1 ms 596 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Runtime error 1 ms 596 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 45620 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 1179 ms 1890420 KB Time limit exceeded
2 Halted 0 ms 0 KB -