| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 574992 | m_fenais | A Difficult(y) Choice (BOI21_books) | C++14 | 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>
#include <book.h>
using namespace std;
void solve(int N, int K, long long A, int S) {
vector<int> v;
for(int i=1; i<=N; i++){
v.push_back(skim(i));
}
for(int i=0; i<v.size()-2; i++)
{
int cnt = v[i] + v[i+1] + v[i+2];
if(cnt <= A*2 && cnt >= A)
{
vector<int> ans;
ans.push_back(i+1);
ans.push_back(i+2);
ans.push_back(i+3);
answer(ans);
}
}
impossible();
}