| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1319305 | yessimkhan | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
// solved by bekagg
#define int long long
#define ent '\n'
#define pb push_back
#define all(x) x.begin(),x.end()
#define PRaim_bek_abi ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
const int N = 2e5+5;
const int MOD = 1e9+7;
int pref[N];
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<int , int> > v;
vector<int>ans;
for (int i = 0; i < w.size(); i++){
v.pb({w[i] , i});
}
sort(all(v));
for (int i = 0; i < w.size(); i++) pref[i] = pref[i - 1] + v[i].first;
for (int i = 0; i < w.size(); i++){
int l = i , r = w.size() , p = -1;
while(l <= r){
int m = (l + r) / 2;
if (pref[m] - pref[i - 1] >= l){
p = m;
r = m - 1;
}
else l = m + 1;
}
if (p != -1 and pref[p] - pref[i - 1] <= u){
for (int j = i; j <= p; j++){
ans.pb(v[j].second);
}
break;
}
}
return ans;
}
