# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032324 | Marco_Escandon | A Difficult(y) Choice (BOI21_books) | C++14 | 121 ms | 1112 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;
typedef long long ll;
const string ny[2] = {"No", "Yes"};
#include"books.h"
void solve(int n, int k, long long a, int S) {
ll cad[n+4]={ };
ll v[k+2]={ },ac=0;
v[k]=n+3;
for(int i=1; i<=n; i++)
{
cad[i]=skim(i);
if(i<=k)
{
v[i-1]=i;
ac+=cad[i];
}
}
/*for(int i=k-1; i>-1; i--)
{
ll temp=ac-cad[v[i]]+cad[v[i]+1];
while(temp<2*a&&ac<a&&v[i]<v[i+1]-1&&v[i]<n)
{
ac-=cad[v[i]];
v[i]++;
ac+=cad[v[i]];
temp=ac-cad[v[i]]+cad[v[i]+1];
}
}*/
for(int i=0; i<n; i++)
# | 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... |