# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969054 | CyberCow | A Difficult(y) Choice (BOI21_books) | C++17 | 136 ms | 3608 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) {
set<pair<long long, int>> se;
for (int i = 1; i <= n; i++)
{
v[i] = skim(i);
se.insert({ v[i], i });
}
int st = 0;
ll sum = 0;
for (int i = 1; i <= k; i++)
{
sum += v[i];
}
for (int i = k; i <= n; i++)
{
if (sum >= a && sum <= 2 * a)
{
vector<int> ans;
for (int j = i - k + 1; j <= i; j++)
{
ans.push_back(j);
}
answer(ans);
return;
}
sum += v[i + 1] - v[i - k + 1];
}
sum = 0;
for (int i = 1; i <= k - 1; i++)
{
sum += v[i];
}
for (int i = k; i <= n; i++)
{
if (sum + v[i] >= a && sum + v[i] <= 2 * a)
{
vector<int> ans;
for (int j = 1; j < k; j++)
{
ans.push_back(j);
}
ans.push_back(i);
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... |