# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
932811 |
2024-02-24T09:30:53 Z |
vjudge1 |
Holiday (IOI14_holiday) |
C++17 |
|
3486 ms |
5724 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define F first
#define S second
#define ll long long
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back
#define ull unsigned ll
const int MAX=1e5+55;
const int inf=1e9;
const int N=2e5;
const int C=331;
const int C1=431;
const int mod=1e9+9;
const int mod1=1e9+9;
#include "holiday.h"
int dpL[MAX],dpR[MAX];
int dp1L[MAX],dp1R[MAX];
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
if(start==0){
multiset<int> st;
int ans=0;
int cur=0;
for(int i=0;i<n;i++){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>d-i){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
return ans;
}
for(int ds=0;ds<=d;ds++){
multiset<int> st;
int ans=0;
int cur=0;
for(int i=start;i<n;i++){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>ds-(i-start)){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
dpR[ds]=ans;
st.clear();
ans=cur=0;
for(int i=start;i<n;i++){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>ds-2*(i-start)){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
dp1R[ds]=ans;
}
for(int ds=0;ds<=d;ds++){
multiset<int> st;
int ans=0;
int cur=0;
for(int i=start-1;i>=0;i--){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>ds-(start-i-1)){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
dpL[ds]=ans;
st.clear();
ans=cur=0;
for(int i=start-1;i>=0;i--){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>ds-2*(start-i-1)){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
dp1L[ds]=ans;
}
// cout<<dpR[4]<<"\n";
int ans=0;
for(int i=0;i<=d;i++){
ans=max(ans,dpR[i]+dp1L[d-i-1]);
ans=max(ans,dp1R[i]+dpL[d-i-1]);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
5720 KB |
Output is correct |
2 |
Correct |
20 ms |
5716 KB |
Output is correct |
3 |
Correct |
20 ms |
5468 KB |
Output is correct |
4 |
Correct |
20 ms |
5724 KB |
Output is correct |
5 |
Correct |
24 ms |
3932 KB |
Output is correct |
6 |
Correct |
7 ms |
2136 KB |
Output is correct |
7 |
Correct |
13 ms |
2908 KB |
Output is correct |
8 |
Correct |
16 ms |
2908 KB |
Output is correct |
9 |
Correct |
5 ms |
1628 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3486 ms |
1196 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
17 ms |
5204 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |