Submission #145080

#TimeUsernameProblemLanguageResultExecution timeMemory
145080NightlightDetecting Molecules (IOI16_molecules)C++14
9 / 100
3 ms380 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; vector<int> ans; vector<int> find_subset(int l, int u, vector<int> w) { sort(w.begin(), w.end()); int N = w.size(); long long sum = w[0]; int low = 0, up = 0; while((sum < l || sum > u) && up < N){ if(low > up)break; if(sum < l){ up++; sum += w[up]; }else if(sum > u){ sum -= w[low]; low++; } // cout << low << " " << up << " " << sum << "\n"; } if(l <= sum && sum <= u){ for(int i = low; i <= up; i++){ ans.push_back(i); } return ans; } return vector<int>(0); }
#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...