# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921374 | H1H | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 348 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 T "Task"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<int, int>> a;
for(int i = 0; i < w.size(); ++i){
a.push_back({w[i], i});
}
sort(a.begin(), a.end());
queue<int> qu;
long long res = 0;
int id = 0;
while(id < w.size()){
res += a[id].first;
qu.push(id);
id += 1;
while(res > u){
res -= a[qu.front()].first;
qu.pop();
}
if(res >= l)break;
}
vector<int> ans;
if(res >= l && res <= u){
while(qu.size()){
ans.push_back(qu.front());
qu.pop();
}
}
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... |