Submission #890222

#TimeUsernameProblemLanguageResultExecution timeMemory
890222MercubytheFirstDetecting Molecules (IOI16_molecules)C++14
0 / 100
0 ms348 KiB
#include "molecules.h"
#include<algorithm>
#include<assert.h>
#include<numeric>
#include<iostream>
using namespace std;
using ll = long long;

vector<int> find_subset(int weight_low, int weight_hi, vector<int> w) {
    int n = w.size();
    sort(w.begin(), w.end());
    for(int l = 0; l < n; ++l){
        for(int r = l; r < n; ++r){
            ll sum = 0;
            for(int i = l; i <= r; ++i)
                sum += w[i];
            if(weight_low <= sum and sum <= weight_hi){
                // for(int i = l; i <= r; ++i)
                    // cout << w[i] << ' ';
                // cout << endl;
                return vector<int>(w.begin() + l, w.begin() + r + 1);
            }
        }
    }
    return vector<int>();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...