# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784323 | Lyrically | Holiday (IOI14_holiday) | C++17 | 1691 ms | 14348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
void file(string s)
{
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int mod=998244353;
long long a[100005];
long long n,s,d;
long long calc(int x)
{
multiset<long long> st;
for(int i=x;i<=s;i++){st.insert(a[i]);}
long long res=0;
long long cur=0;
for(int i=s;i-s<=s-x;i++)
{
int go=2*i-s-x;
if(go>d){break;}
go=d-go;
if(i==s)
{
vector<long long> v;
for(int j=1;j<=go;j++)
{
if(st.empty()){break;}
v.pb(*(--st.end()));cur+=*(--st.end());
st.erase(--st.end());
}
res=cur;st.clear();
for(auto p:v){st.insert(p);}
}
else
{
st.insert(a[i]);cur+=a[i];cur-=*(st.begin());
st.erase(st.begin());
if(!st.empty())
{
cur-=*st.begin();st.erase(st.begin());
}
res=max(res,cur);
}//print(go);
}
//print(res);cout<<2*s-x+1<<endl;
st.clear();
for(int i=x;i<=2*s-x+1;i++){st.insert(a[i]);}
cur=0;
for(int i=2*s-x+1;i<=n;i++)
{
int go=i+s-2*x;
if(go>d){break;}
go=d-go;
if(i==2*s-x+1)
{
vector<long long> v;
for(int j=1;j<=go;j++)
{
if(st.empty()){break;}
v.pb(*(--st.end()));cur+=*(--st.end());
st.erase(--st.end());
}
res=cur;st.clear();
for(auto p:v){st.insert(p);}
}
else
{
st.insert(a[i]);cur+=a[i];cur-=*(st.begin());
st.erase(st.begin());
res=max(res,cur);
}
}
//print(res);
return res;
}
long long findMaxAttraction(int N,int S,int D,int attr[])
{
n=N,s=S+1,d=D;
rep(i,n){a[i+1]=attr[i];}
//往左去到的最远地方
long long res=0;
for(int i=1;i<=s;i++)
{
long long x=calc(i);//if(x==52){print(i);}
res=max(res,x);
}
reverse(a+1,a+n+1);
s=n-s+1;
if(s!=1)
{
for(int i=1;i<=s;i++)
{
long long x=calc(i);
res=max(res,x);
}
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |