Submission #942972

#TimeUsernameProblemLanguageResultExecution timeMemory
942972hmm789A Difficult(y) Choice (BOI21_books)C++14
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; void solve(int N, int K, long long A, int S) { // TODO implement this function int l = 1, r = N-K+1, m, ans = -1; while(l < r) { m = (l+r)/2; int sm = 0; for(int i = 0; i < K; i++) sm += skim(m+i); if(sm < A) l = m+1; else { if(sm <= 2*A) ans = m; r = m; } } if(ans == -1) impossible(); else { vector<int> v; for(int i = 0; i < K; i++) v.push_back(ans+i); answer(v); } }
#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...