Submission #492024

#	Time	Username	Problem	Language	Result	Execution time	Memory
492024		eNGy	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	54 ms	3748 KiB

molecules

#include <bits/stdc++.h>
 
using namespace std;
 
std::vector<int> find_subset(int l, int u, std::vector<int> w){
    vector<int> sol;
    int N = w.size();
    
    vector<pair<int, int> > v(N);
    for(int i=0; i<N; i++){
    	v[i] = make_pair(w[i], i);
	}
    sort(v.begin(), v.end());
    
    long long somma = 0, J = 0;
    for(int i=0; i<N; i++){
        while(J < N && somma < l){
            somma += v[J].first;
            J++;
        }
        
        if(somma >= l && somma <= u){
            for (int s=i; s<J; s++) {
            	sol.push_back(v[s].second);
			}
				
            return sol;
            
        }else{
        	somma -= v[i].first;
		}
    }
 
    return sol;
}

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