# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009378 | alexdd | A Difficult(y) Choice (BOI21_books) | C++17 | 3046 ms | 344 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>
#include "books.h"
using namespace std;
map<long long,long long> mp;
int ramase;
long long query(long long x)
{
if(mp[x]==0)
{
if(ramase==0)
while(1);
ramase--;
mp[x] = skim(x);
}
return mp[x];
}
long long pref[15];
void solve(int N, int K, long long A, int S)
{
int primu=N+1;
int st=1,dr=N;
while(st<=dr)
{
int mij=(st+dr)/2;
if(query(mij) > A)
{
primu=mij;
dr=mij-1;
}
else
st=mij+1;
}
if(primu<K)
{
impossible();
return;
}
if(primu<N+1)
{
vector<int> sol;
long long sum=query(primu);
sol.push_back(primu);
for(int i=1;i<K;i++)
{
sol.push_back(i);
sum += query(i);
}
if(sum<=2*A)
{
answer(sol);
return;
}
}
vector<int> pozs;
for(int i=1;i<=K;i++)
pozs.push_back(i);
for(int i=max(primu-K,K+1);i<primu;i++)
pozs.push_back(i);
for(int i=0;i+K-1<pozs.size();i++)
{
vector<int> sol;
long long sumsol=0;
for(int j=i;j<i+K;j++)
{
sol.push_back(pozs[j]);
sumsol += query(pozs[j]);
}
if(sumsol>=A && sumsol<=2LL*A)
{
answer(sol);
return;
}
}
impossible();
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |