# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
987533 |
2024-05-23T01:14:26 Z |
cig32 |
Fruits (NOI22_fruits) |
C++17 |
|
591 ms |
1048576 KB |
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int MAXN = 4e5 + 10;
void solve(int tc) {
int n;
cin >> n;
int a[n+1], c[n+1];
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) cin >> c[i];
int dp[n+1][n+1];
for(int i=0; i<=n; i++) {
for(int j=0; j<=n; j++) {
dp[i][j] = -1e18;
}
}
dp[0][0] = 0;
for(int i=1; i<=n; i++) {
int mx = dp[0][i-1];
for(int j=1; j<=n; j++) {
if(a[i] == -1 || a[i] == j) dp[j][i] = max(dp[j][i], c[j] + mx);
if(a[i] > j) dp[j][i] = -1e18;
else dp[j][i] = max(dp[j][i], dp[j][i-1]);
mx = max(mx, dp[j][i-1]);
}
int wow = 0;
for(int j=1; j<=n; j++) wow = max(wow, dp[j][i]);
cout << wow << " \n"[i == n];
}
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1; //cin>>t;
for(int i=1; i<=t; i++) solve(i);
}
/*
g++ T2443.cpp -std=c++17 -O2 -o T2443
./T2443 < input.txt
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
600 KB |
Output is correct |
2 |
Correct |
69 ms |
31580 KB |
Output is correct |
3 |
Runtime error |
555 ms |
1048576 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
591 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |