Submission #1065069

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065069		MrPavlito	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	348 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 = 0;
    vector<int> resenje;
    while(pr< n)
    {
        trsum+= niz[pr].fi;
        if(trsum <= u && trsum>=l)
        {
            for(int i=pl; i<=pr; i++)resenje.pb(niz[i].sc);
            return resenje;
        }
        if(trsum >= u)
        {
            if(pl == n-1)break;
            trsum-=niz[pl++].fi;
            if(pl > pr)
            {
                pr++;
                if(pr >= n)break;
                trsum+=niz[pr].fi;
            }
            if(trsum <= u && trsum>=l)
            {
                for(int i=pl; i<=pr; i++)resenje.pb(niz[i].sc);
                return resenje;
            }
        }
        else pr++;
    }
    return resenje;


}

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