| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1017853 | vivkostov | Holiday (IOI14_holiday) | C++14 | 0 ms | 0 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>
//#define endl '\n'
using namespace std;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
struct cell
{
long long nt st;
bool operator<(const cell&a)const
{
return st>a.st;
}
};
priority_queue<cell>q;
long long int n,a[3005],k,st,sum;
void fil(int h)
{
cell g;
for(int i=h;i<=st;i++)
{
sum+=a[i];
g.st=a[i];
q.push(g);
}
}
void read()
{
cin>>n>>k>>st;
cell h;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
long long int p=k,otg=0;
for(int i=1;i<=st;i++)
{
for(int j=st;j<=n;j++)
{
p-=min(st-i,j-st);
p-=j-i;
if(p<=0)break;
if(j==st)
{
fil(i);
}
else
{
sum+=a[j];
h.st=a[j];
q.push(h);
}
while(p<q.size())
{
//cout<<q.top().st<<" "<<i<<" "<<j<<" "<<q.size()<<endl;
sum-=q.top().st;
q.pop();
}
p=k;
otg=max(otg,sum);
}
sum=0;
while(!q.empty())q.pop();
}
cout<<otg<<endl;
}
long long int findMaxAttraction(int N, int start, int d, int attraction[])
{
n=N;
st=start;
k=d;
cell h;
for(int i=1;i<=n;i++)
{
a[i]=attraction[i-1];
}
long long int p=k,otg=0;
for(int i=1;i<=st;i++)
{
for(int j=st;j<=n;j++)
{
p-=min(st-i,j-st);
p-=j-i;
if(p<=0)break;
if(j==st)
{
fil(i);
}
else
{
sum+=a[j];
h.st=a[j];
q.push(h);
}
while(p<q.size())
{
sum-=q.top().st;
q.pop();
}
p=k;
otg=max(otg,sum);
}
sum=0;
while(!q.empty())q.pop();
}
return otg;
}
/*int main()
{
speed();
read();
return 0;
}
*/