| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1354605 | takoshanava | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
#define pb push_back
#define fs first
#define sc second
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> p;
for(int i = 0; i < w.size(); i++) p.pb({w[i], i});
sort(p.begin(), p.end());
int l1 = 0, r = 0;
long long sum = 0;
bool ok = 0;
int n = w.size();
while(r < n){
if(sum >= l and sum <= u){ok = 1; break;}
if(sum < l) r++, if(r != n) sum += p[r].fs;
if(sum > u) sum -= p[l1].fs, l1++;
}
vector<int> ans;
if(!ok) return ans;
for(int i = l1; i < r; i++) ans.pb(p[i].sc);
return ans;
}