# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875762 | TahirAliyev | Detecting Molecules (IOI16_molecules) | C++17 | 47 ms | 6180 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;
#define pii pair<int, int>
#define ll long long
vector<pii> v;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
for(int i = 0; i < w.size(); i++){
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
int p1 = 0, p2 = 0;
ll sum = v[0].first;
bool pos = true;
while(p1 <= p2){
if(l <= sum && sum <= u){
break;
}
if(sum > u){
if(p1 == v.size() - 1){
pos = false;
break;
}
sum -= v[p1].first;
p1++;
}
else{
if(p2 == v.size() - 1){
pos = false;
break;
}
p2++;
sum += v[p2].first;
}
}
if(!pos){
return vector<int>();
}
vector<int> id;
for(int i = p1; i <= p2; i++){
id.push_back(v[i].second);
}
sort(id.begin(), id.end());
return id;
}
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... |