# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963822 | marinaluca | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
//#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
using namespace std;
/**
#define ll long long
#define XX first
#define YY second
#define pb push_back
#define sz (x) int(x.size())
#define pf pop_front
#define pob pop_back
#define pff push_front
**/
/*_____________defines---------------*/
/**
typedef dl double;
typedef ldb long double;
typedef vii vector <int>;
typedef pid pair <double, double>;
typedef pii pair <int, int>;
typedef ull unsigned long long;
**/
vector <int> find_subset (const int l, const int u, vector <int> w){
vector < pair <long long, long long>> ans;
vector <int> v;
for (int i = 0; i < w.size(); ++ i){
ans.push_back({w[i], i});
}
sort (ans.begin(), ans.end());
for (int i = 0, sum = 0, cnt = 0; i < w.size(); ++ i){
sum += ans[i].first;
while (sum > u){
sum -= ans[i].first;
++ cnt;
}
if (sum >= l){
for (int idx = cnt; idx <= i; ++ idx){
v.push_back(ans[idx].second);
}
break;
}
}
return v;
}
/**
signed main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0 ^ 0;
}