# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241173 | crossing0ver | Detecting Molecules (IOI16_molecules) | C++17 | 5 ms | 384 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> answer(deque<int> v) {
vector<int> ans;
ans.clear();
for (int i = 0; i < v.size(); i++) {
ans.push_back(v[i]);
}
return ans;
}
vector<int> find_subset(int l, int u, vector<int> w1) {
int n = w1.size();
vector<pair<int,int> > w;
for (int i = 0; i < w1.size(); i++) w.push_back({w1[i],i});
sort(w.begin(),w.end());
long long tot = 0;
deque<int> v;
vector<int> ans;
ans.clear();
if (w[0].first > u) return ans;
for (int i = 0; i < n; i++) {
if ( tot + w[i].first < l) {
tot+=w[i].first;
v.push_back(w[i].second);
}
}
for (int i = n - 1; i >= 0; i--) {
if (w[i].first > u) n--;
}
int in = (v.size() > 0 ? v.back() : -1);
for (int i = in + 1; i < n; i++) {
if ( tot + w[i].first >= l && tot + w[i].first <= u) {
v.push_back(w[i].second);
return answer(v);
}
if (tot + w[i].first > u) {
tot -= w[v.front()].first;
v.pop_front();
}
tot += w[i].first;
v.push_back(w[i].second);
if (tot >= l && tot <= u) return answer(v);
}
return ans;
}
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... |