oj.uz

Submission #724149

# Submission time Handle Problem Language Result Execution time Memory
724149 2023-04-14T18:36:38 Z ismayil Catfish Farm (IOI22_fish) C++17
12 / 100
 95 ms 9584 KB 
#pragma GCC optimize("O3")
#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll INF = 3e14 + 4; 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	int flag = 0;
	for(int i = 0; i < M; i++){
		if(X[i] > 1){
			flag = 1;
		}
	}
	if(flag){
		ll dp[N][2], a[N];
		memset(dp, 0, sizeof(dp)); memset(a, 0, sizeof(a));
		for(int i = 0; i < M; i++) a[X[i]] += W[i]; 
		dp[1][0] = a[1];
		dp[1][1] = a[0];
		for(int i = 2; i < N; i++){
			dp[i][0] = max(dp[i - 1][1] + a[i], dp[i - 1][0]);
			dp[i][1] = max(max(dp[i - 2][0] + a[i - 1], dp[i - 1][1]), dp[i - 2][1] + a[i - 1]);
		}
		return max(dp[N - 1][0], dp[N - 1][1]);
	}
	ll ans[N + 1][2];
	memset(ans, 0, sizeof(ans));
	for(int i = 0; i < M; i++){
		ans[Y[i] + 1][X[i]] = W[i];
	}
	for(int i = 1; i <= N; i++){
		ans[i][0] += ans[i - 1][0];
		ans[i][1] += ans[i - 1][1];
	}
	ll res = 0;
	for (int i = 0; i <= N; i++)
	{
		res = max(res, ans[i][0] + (ans[N][1] - ans[i][1]));
	}
	return res;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3532 KB Output is correct
2 Correct 30 ms 4164 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 85 ms 9584 KB Output is correct
6 Correct 95 ms 9568 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 50 ms 5396 KB Output is correct
3 Correct 59 ms 6480 KB Output is correct
4 Correct 24 ms 3560 KB Output is correct
5 Correct 31 ms 5940 KB Output is correct
6 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
7 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1748 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 15 ms 3628 KB Output is correct
4 Correct 11 ms 3428 KB Output is correct
5 Correct 27 ms 4944 KB Output is correct
6 Correct 22 ms 4940 KB Output is correct
7 Correct 25 ms 4936 KB Output is correct
8 Correct 26 ms 4932 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 0 ms 212 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 0 ms 212 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 2 ms 1748 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 15 ms 3628 KB Output is correct
4 Correct 11 ms 3428 KB Output is correct
5 Correct 27 ms 4944 KB Output is correct
6 Correct 22 ms 4940 KB Output is correct
7 Correct 25 ms 4936 KB Output is correct
8 Correct 26 ms 4932 KB Output is correct
9 Incorrect 25 ms 4996 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3532 KB Output is correct
2 Correct 30 ms 4164 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 85 ms 9584 KB Output is correct
6 Correct 95 ms 9568 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 50 ms 5396 KB Output is correct
9 Correct 59 ms 6480 KB Output is correct
10 Correct 24 ms 3560 KB Output is correct
11 Correct 31 ms 5940 KB Output is correct
12 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
13 Halted 0 ms 0 KB -