| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1002854 |
2024-06-19T20:43:47 Z |
Juan |
Cigle (COI21_cigle) |
C++17 |
|
1000 ms |
2292 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 5e3+5;
int p[maxn], dp[maxn][maxn];
bool mark[maxn*maxn];
int calc(int r, int l, int c){
int rt=0;
for(int i=l; i<c; i++) mark[p[i]]=true;
for(int i=c+1; i<r; i++) if(2*p[c]-p[i]<maxn*maxn) rt += mark[2*p[c]-p[i]];
for(int i=l; i<c; i++) mark[p[i]]=false;
return rt;
}
signed main(){
int n; cin >> n;
vector<int> v(n+1);
for(int i=1; i<=n; i++) cin >> v[i];
for(int i=1; i<=n; i++) p[i] = p[i-1]+v[i];
int dbg=9;
bool dbg_on=false;
int ans=0;
for(int i=1; i<=n; i++){
for(int j=1; j<i; j++){
for(int k=j; k<i; k++){
int val = calc(i,j,k);
if(i==dbg && dbg_on) cout << val << " ";
dp[i][k] = max(dp[i][k], dp[k][j-1]+val);
ans = max(ans,dp[i][k]);
}
if(i==dbg && dbg_on) cout << endl;
}
if(i==dbg && dbg_on) cout << endl;
}
// for(int i=0; i<=n; i++) cout << dp[i] << " ";
// cout << endl;
// int ans=0;
// for(int i=0; i<=n; i++) ans = max(ans,dp[n][i]);
cout << ans << '\n';
// cout << dp[n] << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1062 ms |
2292 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
