# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206353 | autumn_eel | Detecting Molecules (IOI16_molecules) | C++14 | 5 ms | 504 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>
#define rep(i,n)for(int i=0;i<(n);i++)
#include "molecules.h"
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<P>v;
rep(i,w.size())v.push_back(P(w[i],i));
sort(v.begin(),v.end(),greater<>());
ll sum=0;
vector<int>ans;
for(auto p:v){
sum+=p.first;
ans.push_back(p.second);
if(l<=sum&&sum<=u){
return ans;
}
}
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... |