Submission #1065075

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065075		MrPavlito	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	34 ms	5480 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector<pii> niz(n);
    for(int i=0; i<n; i++)niz[i] = mp(w[i],i);
    sort(all(niz));
    int pl = 0;
    int pr = 0;
    long long trsum = niz[0].fi;
    vector<int> resenje;
    while(pr< n)
    {
        if(trsum <= u && trsum>=l)
        {
            for(int i=pl; i<=pr; i++)resenje.pb(niz[i].sc);
            return resenje;
        }
        else if(trsum > u)
        {
            while(pl < pr && trsum > u)
            {
                trsum-= niz[pl++].fi;
                 if(trsum <= u && trsum>=l)
                {
                    for(int i=pl; i<=pr; i++)resenje.pb(niz[i].sc);
                    return resenje;
                }
            }
            pr++;
            if(pr != n)trsum+= niz[pr].fi;
        }
        else
        {
            pr++;
            if(pr != n)trsum+= niz[pr].fi;
        }
    }
    return resenje;


}

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