oj.uz

Submission #724107

# Submission time Handle Problem Language Result Execution time Memory
724107 2023-04-14T17:49:32 Z ismayil Catfish Farm (IOI22_fish) C++17
12 / 100
 105 ms 9572 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) {
	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]);
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4308 KB Output is correct
2 Correct 27 ms 4944 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 96 ms 9572 KB Output is correct
6 Correct 105 ms 9564 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 14 ms 3632 KB Output is correct
4 Correct 10 ms 3424 KB Output is correct
5 Correct 25 ms 4932 KB Output is correct
6 Correct 23 ms 4940 KB Output is correct
7 Correct 31 ms 4920 KB Output is correct
8 Correct 30 ms 4920 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 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 14 ms 3632 KB Output is correct
4 Correct 10 ms 3424 KB Output is correct
5 Correct 25 ms 4932 KB Output is correct
6 Correct 23 ms 4940 KB Output is correct
7 Correct 31 ms 4920 KB Output is correct
8 Correct 30 ms 4920 KB Output is correct
9 Incorrect 27 ms 4932 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 24 ms 4308 KB Output is correct
2 Correct 27 ms 4944 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 96 ms 9572 KB Output is correct
6 Correct 105 ms 9564 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -