Submission #472914

#	Time	Username	Problem	Language	Result	Execution time	Memory
472914		Erik_Gepard	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	58 ms	6084 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
using namespace std;
 
std::vector<int> find_subset(int ll, int uu, std::vector<int> w) {
    long long n=w.size();
    vector<int> ans;
    long long l=ll;
    long long u=uu;
    vector<pair<long long, long long> > a(w.size());
    for(long long i=0; i<w.size(); i++){
        a[i].first=w[i];
        a[i].second=i;
    }
    sort(a.begin(), a.end());
    long long sum=0;
    long long j=0;
    for(long long i=0; i<n; i++){
        while(j<n && sum+a[j].first<=u){
            sum+=a[j].first;
            j++;
        }
        if(sum>=l){
            for(long long q=i; q<j; q++){
              ans.push_back((int)a[q].second);
            }
            return ans;
          }
        sum-=a[i].first;
    }
    return vector<int>(0);
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(long long i=0; i<w.size(); i++){
      |                        ~^~~~~~~~~

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