Submission #774691

#TimeUsernameProblemLanguageResultExecution timeMemory
774691agussDetecting Molecules (IOI16_molecules)C++17
69 / 100
1081 ms3412 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pair<int, int>> v(n); vector<int> ans; for(int i = 0; i < n; i++){ v[i].first = w[i]; v[i].second = i; } sort(v.begin(), v.end()); ll sum, s = 0, e = 0; while(1){ sum = 0; for(int i = s; i <= e; i++) sum += v[i].first; if(sum >= l and sum <= u){ for(int i = s; i <= e; i++){ ans.push_back(v[i].second); } return ans; } if(sum < l) e++; if(sum > u) s++; if(e >= n or s >= n) break; } 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...