Submission #23681

#TimeUsernameProblemLanguageResultExecution timeMemory
23681NirjhorDetecting Molecules (IOI16_molecules)C++14
9 / 100
0 ms2024 KiB
#include <bits/stdc++.h> #include <bits/stdc++.h> #include "molecules.h" using namespace std; typedef long long ll; vector <int> find_subset (int l, int u, vector <int> w) { int n = w.size(); sort(w.begin(), w.end()); ll sum = 0; vector <int> r; for (int i = 0, j = 0; j < n; ++j) { sum += (ll) w[j]; while (sum > u) { sum -= w[i++]; } if (sum >= l and sum <= u) { for (int k = i; k <= j; ++k) { r.push_back(k); } break; } } return r; }
#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...