| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282745 | enzy | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 6172 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> find_subset(int L, int R, vector<int> w){
ll sum=0, at=0, l=L, r=R;
vector<pair<ll,int>>v;
for(int i=0;i<w.size();i++) v.push_back({w[i],i});
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
sum+=v[i].first;
while(sum>r){
sum-=v[at].first;
at++;
}
if(l<=sum&&sum<=r){
vector<int>resp;
for(int j=at;j<=i;j++) resp.push_back(v[j].second);
return resp;
}
}
return {};
}
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... | ||||
