# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969069 | CyberCow | A Difficult(y) Choice (BOI21_books) | C++17 | 1 ms | 356 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 "books.h"
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
using ll = long long;
const int N = 100010;
long long v[N];
void solve(int n, int k, long long a, int s) {
ll sum = 0;
for (int i = 1; i <= k - 1; i++)
{
sum += v[i];
}
int l = k, r = n, m = 0, ans;
while (l <= r)
{
m = (l + r) / 2;
int x = skim(m);
if (sum + x <= 2 * a && sum + x >= a)
{
vector<int> ans;
for (int j = 1; j < k; j++)
{
ans.push_back(j);
}
ans.push_back(m);
answer(ans);
return;
}
else if(sum + x > 2 * a)
{
r = m - 1;
}
else
{
l = m + 1;
}
}
l = 1, r = n - k + 1, m = 0, ans;
while (l <= r)
{
m = (l + r) / 2;
sum = 0;
for (int i = m; i < m + k; i++)
{
sum += skim(i);
}
if (sum > 2 * a)
{
r = m - 1;
}
else if (sum < a)
{
l = m + 1;
}
else
{
vector<int> ans;
for (int j = m; j < m + k; j++)
{
ans.push_back(j);
}
answer(ans);
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... |