Submission #715422

#	Time	Username	Problem	Language	Result	Execution time	Memory
715422		aykhn	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	49 ms	6228 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define OPT ios_base::sync_with_stdio(0); \
            cin.tie(0); \
            cout.tie(0)

#define pii pair<int,int>
#define pll pair<ll,ll>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) \
                    cout << v[i] << " "; \
                    cout<<endl;

vector<int> find_subset(int lx, int u, vector<int> arr)
{
    int n = arr.size();

    int l = 0;
    int r = 0;

    vector<pii> w;

    for (int i = 0; i < n; i++)
    {
        w.pb({arr[i], i});
    }

    sort(all(w));

    ll sum = 0;

    while (r < n)
    {
        sum = sum + w[r].fi;

        while (sum > u)
        {
            sum = sum - w[l].fi;
            l++;
        }

        if (sum >= lx && sum <= u)
        {
            vector<int> ans;
            for (int i = l; i <= r; i++)
            {
                ans.pb(w[i].se);
            }
            sort(all(ans));
            return ans;
        }

        r++;
    }

    vector<int> ans;

    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31