# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718644 | n1k | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 308 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>
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
#define ll long long
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(all(w));
ll ps = 0, ss = 0;
for(int i = 0; i < sz(w); i++){
ps += w[i];
ss += w[sz(w) - i - 1];
if(ps <= u && ss >= l){
if(l <= ps){
vector<int> ans(i + 1);
iota(all(ans), 0);
return ans;
}
for(int j = 0; j <= i; j++){
ps -= w[j];
ps += w[sz(w) - j - 1];
if(l <= ps && ps <= u){
set<int> ans;
for(int k = j + 1; k <= i; k++){
ans.insert(k);
}
for(int k = sz(w) - j - 1; k < sz(w); k++){
ans.insert(k);
}
return vector(all(ans));
}
}
}
}
return std::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... |