| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1028176 | khanhtb | 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"
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define vii vector<vi>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define fi first
#define se second
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 2e18;
const ll blocksz = 320;
const ll N = 2e5 + 8;
ll ans[N];
pll a[N];
vi find_subset(int l, int r, vi x){
    ll n = x.size();
    for(ll i = 0; i < n; i++) a[i].fi = x[i], a[i].se = i;
    sort(a+1,a+n+1);
    vi ans;
    ll j = 1, sum = 0;
    for(ll i = 1; i <= n; i++){
        sum += a[i].fi;
        while((sum > r || a[i].fi-a[j].fi > r-l) && j <= i){
            sum -= a[j].fi;
            j++;
        }
        if(l <= sum){
            for(ll x = j; x <= i; x++){
                ans.pb(a[x].se);
            }
            sort(all(ans));
            break;
        }
    }
    return ans;
}
