# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380361 | ritul_kr_singh | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h";
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<int, int>> a;
int curr = 0;
for(int i : w) a.emplace_back(i, curr++);
sort(a.begin(), a.end());
for(int _=0; _<2; ++_){
int sum = 0;
for(int i=0; i<(int)a.size(); ++i){
sum += a[i].first;
if(l<=sum and sum<=u){
vector<int> ans(i+1);
for(int j=0; j<=i; ++j) ans[j] = a[j].second+1;
sort(ans.begin(), ans.end());
return ans;
}
}
reverse(a.begin(), a.end());
}
return {};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |