Submission #1021939

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021939		amirhoseinfar1385	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	9664 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10;
int n;
long long suma=0,mina=(1<<31),ps[maxn],all[maxn];

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    n=w.size();
    vector<pair<long long ,long long>>lnk;
    for(int i=0;i<n;i++){
        lnk.push_back(make_pair(w[i],i));
    }
    sort(lnk.begin(),lnk.end());
    for(int i=0;i<n;i++){
        w[i]=lnk[i].first;
    }
    for(auto x:w){
        suma+=x;
        mina=min(mina,1ll*x);
    }
    if(l>suma||u<mina){
        return {};
    }
    for(int i=1;i<=n;i++){
        ps[i]=ps[i-1]+w[i-1];
    }
    for(int i=1;i<=n;i++){
        if((ps[i]>=l&&ps[i]<=u)||((ps[n]-ps[n-i])>=l&&(ps[n]-ps[n-i])<=u)||(ps[i]<l&&ps[n]-ps[n-i]>u)){
            for(int j=i;j<=n;j++){
                if(ps[j]-ps[j-i]>=l&&ps[j]-ps[j-i]<=u){
                    vector<int>ret;
                    for(int k=j-i+1;k<=j;k++){
                        ret.push_back(lnk[k-1].second);
                    }
                    return ret;
                }
            }
        }
    }
    return {};
}

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