Submission #947801

#TimeUsernameProblemLanguageResultExecution timeMemory
947801willychanA Difficult(y) Choice (BOI21_books)C++17
0 / 100
5 ms344 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; typedef long long ll; // // --- 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, long long A, int S) { if(K!=3) return; vector<ll> v(N); for(int i=1;i<=N;i++) v[i-1] = skim(i); for(int i=0;i<N;i++){ for(int j=i+1;j<N;j++){ ll g = v[i]+v[j]; int l = lower_bound(v.begin()+j+1,v.end(),A-g)-v.begin(); if(l>j && v[l]+g<=2*A){ answer({i+1,j+1,l+1}); return; } } } impossible(); return ; }
#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...