Submission #774705

#TimeUsernameProblemLanguageResultExecution timeMemory
774705agussDetecting Molecules (IOI16_molecules)C++17
69 / 100
1082 ms3020 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(e < n and s < n){ sum = 0; ans.clear(); for(int i = s; i <= e; i++){ sum += v[i].first; ans.push_back(v[i].second); } if(sum >= l and sum <= u) return ans; if(sum < l) e++; if(sum > u) s++; } 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...