Submission #21812

#TimeUsernameProblemLanguageResultExecution timeMemory
21812sampritiDetecting Molecules (IOI16_molecules)C++14
9 / 100
0 ms1936 KiB
#include "molecules.h" #include <algorithm> #include <vector> using namespace std; vector<int> find_subset(int L, int R, vector<int> A) { int N = A.size(); sort(A.begin(), A.end()); int i = 0, j = -1; int sum = 0; while(j < N && sum < L) { sum += A[++j]; if(sum >= L) { if(sum <= R) break; while(sum > R) { sum -= A[i++]; } } } vector<int> ans; if(sum >= L && sum <= R) { while(i <= j) { ans.push_back(i); i++; } } return ans; }
#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...