| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 900920 | simona1230 | A Difficult(y) Choice (BOI21_books) | C++17 | 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>
using namespace std;
long long n,k,a,s;
long long x[120001];
fo
void solve(int N,int K,long long A,int S)
{
n=N;
k=K;
a=A;
s=S;
for(long long i=1;i<=n;i++)
{
x[i]=skim(i);
}
int fk=0,fs=0,fsidx=0;
for(int i=1;i<=n;i++)
{
if(i<k)fk+=x[i];
if(x[i]>=a)
{
fs=x[i];
fsidx=i;
break;
}
}
if(fs+fk>=a&&fs+fk<=2*a)
{
vector<int> ans;
for(int i=1;i<k;i++)
ans.push_back(i);
ans.push_back(fsidx);
return ans;
}
int sum=0;
for(int i=1;i<=n;i++)
{
sum+=x[i];
if(i>k)sum-=x[i-k];
if(i>=k&&sum>=a&&sum<=2*a)
{
vector<int> ans;
for(int j=i-k+1;j<=i;j++)
ans.push_back(j);
return ans;
}
}
impossible();
}