Submission #528326

#TimeUsernameProblemLanguageResultExecution timeMemory
52832679brueA Difficult(y) Choice (BOI21_books)C++14
5 / 100
243 ms444 KiB
#include "books.h" using namespace std; typedef long long ll; int n, k; ll arr[100002]; int s, lim; void solve(int N, int K, ll A, int S){ n = N, k = K, s = S, lim = A; for(int i=1; i<=n; i++) arr[i] = skim(i); for(int i=1; i<=n; i++){ int s = i+1, e = n; while(s<e){ if(arr[i] + arr[s] + arr[e] < A) s++; else if(arr[i] + arr[s] + arr[e] > A+A) e--; else{ answer(vector<int> {i, s, e}); return; } } } impossible(); }
#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...