# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157439 | dennisstar | Detecting Molecules (IOI16_molecules) | C++11 | 68 ms | 6252 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<pair<int,int> > pi;
vector<int> ans;
vector<int> find_subset(int l, int u, vector<int> w) {
int i; N=w.size();
for (i=0; i<N; i++) pi.push_back({w[i], i});
sort(pi.begin(), pi.end());
ll s=0;
for (i=N-1; i>=0; i--) {
s+=(ll)pi[i].first;
ans.push_back(i);
if (s>=(ll)l) break;
}
if (i<0) return vector<int>(0);
for (; i>=0; i--) {
if (s<=(ll)u) break;
s-=(ll)pi[ans[(N-1-i)%ans.size()]].first; s+=(ll)pi[i].first; ans[(N-1-i)%ans.size()]=i;
}
if (s<=(ll)u) {
for (i=0; i<ans.size(); i++) ans[i]=pi[ans[i]].second;
return ans;
}
return vector<int>(0);
}
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... |