Submission #1011215

#TimeUsernameProblemLanguageResultExecution timeMemory
1011215overwatch9A Difficult(y) Choice (BOI21_books)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; using ll = long long; // // --- Sample implementation for the task books --- // // To compile this program with the sample grader, place: // books.h books_sample.cpp sample_grader.cpp // in a single folder and run: // g++ books_sample.cpp sample_grader.cpp // in this folder. // void solve(int N, int K, ll A, int S) { vector <int> ans; ll sum = 0; int lo = 1, hi = N; while (lo < hi && (int)ans.size() < K) { int mid = (lo + hi) / 2; int x = skim(mid); if (sum + x <= 2*A) { sum += x; ans.push_back(mid); } if (sum < A) lo = mid; else hi = mid; } if (sum < A || (int)ans.size() != K || sum > 2*A) impossible(); answer(ans); } // int main() { // int n, k, a, s; // cin >> n >> k >> a >> s; // vector <int> nums(n+1); // for (int i = 1; i <= n; i++) // cin >> nums[i]; // auto res = solve(n, k, a, s); // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...