| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351944 | bbbiros | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 344 KiB |
#include "molecules.h"
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w)
{
set<pair<int,int>> s;
int sum=0;
for(int i=0;i<w.size();i++)
{
s.insert({w[i],i});
sum+=w[i];
if(sum>=l&&sum<=u)break;
while(sum>u)
{
set<pair<int,int>>::iterator it=s.lower_bound({sum-u,0});
if(it==s.end())it--;
sum-=it->first;
s.erase(it);
}
}
if(sum<l||sum>u)return {};
vector<int> ans;
for(pair<int,int> x:s)
{
ans.push_back(x.second);
}
return ans;
}
| # | 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... | ||||
