oj.uz

답안 #1044693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044693 2024-08-05T12:29:58 Z Dan4Life 메기 농장 (IOI22_fish) C++17
0 / 100
 1000 ms 70672 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int mxN = (int)1e5+10;
const int mxN2 = (int)3e2+10;
const ll LINF = (ll)2e18;
int n, m;
struct Fish{ int x, y, w; };
vector<Fish> fishes;
ll dp[mxN][10][10];
ll pref[mxN2][mxN2];
int mxY = 2;

ll max_weights(int N, int M, vi _X, vi _Y, vi _W) {
	n = N, m = M; mxY=min(mxY,N);
	for(int i = 0; i < m; i++) 
		fishes.pb({_X[i]+1,_Y[i]+1,_W[i]});
	sort(all(fishes),[&](Fish a, Fish b){
		if(a.x!=b.x) return a.x<b.x;
		return a.y<b.y;
	});
	for(int i = 0; i < m; i++){
		auto [x,y,w] = fishes[i];
		pref[x][y]+=w;
	}
	for(int i = 0; i <= n; i++)
		for(int j = 1; j <= n; j++)
			pref[i][j]+=pref[i][j-1];
	for(int i = 0; i <= n; i++)
		for(int j = 0; j <= mxY; j++)
			for(int k = 0; k <= mxY; k++)
				dp[i][j][k]=-LINF;
	ll ans = 0;
	for(int i = 0; i <= mxY; i++){
		for(int j = 0; j <= mxY; j++){
			if(i>j) dp[2][i][j]=pref[1][i]-pref[1][j];
			else if(i<j) dp[2][i][j]=pref[2][j]-pref[2][i];
			else dp[2][i][j]=0;
			ans=max(ans, dp[2][i][j]+pref[3][i]);
		}
	}
	for(int i = 3; i <= n; i++){
		for(int j = 0; j <= mxY; j++){
			for(int k = 0; k <= mxY; k++){
				ll costi = 0;
				if(k>j) costi=pref[i][k]-pref[i][j];
				for(int l = 0; l <= k; l++){
					ll costi1 = 0;
					if(j>k) costi1 = pref[i-1][j]-pref[i-1][k];
					dp[i][j][k] = max(dp[i][j][k], dp[i-1][k][l]+costi1);
				}
				for(int l = k+1; l<= mxY; l++){
					ll costi1 = 0;
					if(j>l) costi1 = pref[i-1][j]-pref[i-1][l];
					dp[i][j][k] = max(dp[i][j][k], dp[i-1][k][l]+costi1);
				}
				dp[i][j][k]+=costi;
				ans = max(ans, dp[i][j][k]+pref[i+1][j]);
			}
		}
	}
	return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1043 ms 70596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2648 KB Output is correct
2 Execution timed out 1032 ms 70672 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1081 ms 62040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2392 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2392 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2392 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1081 ms 62040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1043 ms 70596 KB Time limit exceeded
2 Halted 0 ms 0 KB -