# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150279 | ALTAKEXE | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 3656 KiB |
#include <cstdio>
#include <vector>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n=w.size();
vector<pair<int,int> > v(n);
for(int i=0; i<n; i++) v[i]={w[i], i};
sort(v.begin(), v.end());
long long sum=0;
vector<int> r;
for(int i=0, j=0; j<n; j++){
sum+=v[j].first;
while(sum>u) sum-=v[i++].first;
if(sum>=l){
for(; i<=j; i++) r.push_back(v[i].second);
break;
}
}
return r;
}
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... |