| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345221 | ElayV13 | Detecting Molecules (IOI16_molecules) | C++20 | 1096 ms | 4388 KiB |
#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
vector<int>find_subset(int l,int u,vector<int>w)
{
int n=(int)w.size();
vector<pair<int,int>>srt;
for(int i=0;i<n;i++) srt.push_back({w[i],i});
sort(srt.begin(),srt.end());
for(int i=0;i<n;i++){
int cur_s=0;
vector<int>id;
for(int j=i;j<n;j++){
cur_s+=srt[j].first;
id.push_back(srt[j].second);
if(cur_s>=l&&cur_s<=u){
sort(id.begin(),id.end());
return id;
}
}
}
return {};
}
| # | 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... | ||||
