Submission #1004978

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004978		Mardonbekhazratov	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	436 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>

using namespace std;

int n;
vector<int>ans;

vector<int> find_subset(int l, int u, vector<int> w) {
    n=(int)w.size();
    vector<pair<int,int>>a(n);
    for(int i=0;i<n;i++) a[i].first=w[i],a[i].second=i+1;
    sort(a.begin(),a.end());
    int j=0;
    long long sum=0;
    for(int i=0;i<n;i++){
        sum+=a[i].first;
        while(j<n && (a[i].first-a[j].first>u-l || sum>u)) sum-=a[j].first,j++;
        if(sum>=l){
            for(int k=j;k<=i;k++) ans.push_back(k);
            return ans;
        }
    }
    return vector<int>(0);
}

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