Submission #1084995

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w){
    int N = w.size();
    
    vector<pair<int, int>> W(N);
    
    for(int i = 0; i < N; i++){
        W[i] = make_pair(w[i], i);    
    }
    
    vector<int> ans;
    
    int sum = 0;
    
    for(int i = 0; i < N; i++){
        sum += W[i].first;
    }
    
    if(sum >= l and sum <= u){
        for(int i = 0; i < N; i++){
            ans.push_back(i);
        }
        
        return ans;
    }
    
    if(sum < l){
        return ans;
    }
    
    sort(W.begin(), W.end());
    
    bool found = false;
    
    set<int> s;
    
    for(int i = 0; i < N; i++){
        sum -= W[i].first;
        s.insert(W[i].second);
        if(sum >= l and sum <= u){
            found = true;
            break;
        }
    }
    
    if(found == false) return {};
    
    for(int i = 0; i < N; i++){
        if(s.count(W[i].second) == 0){
            ans.push_back(W[i].second);
        }
    }
    
    return ans;
}

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