Submission #239130

#TimeUsernameProblemLanguageResultExecution timeMemory
239130T0p_Detecting Molecules (IOI16_molecules)C++14
0 / 100
5 ms384 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector<int> ans, tmp; int n = w.size(); long long sum = 0; deque<int> deq; sort(w.begin(), w.end()); for(int i=0 ; i<n ; i++) { deq.push_back(w[i]); sum += w[i]; while(sum > u) { sum -= deq.front(); deq.pop_front(); } if(l <= sum && sum <= u) { while(!deq.empty()) { ans.push_back(deq.front()); deq.pop_front(); } return ans; } } return tmp; }
#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...