Submission #715603

#TimeUsernameProblemLanguageResultExecution timeMemory
715603ovidiush11Detecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms304 KiB
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    int n = w.size();
    sort(w.begin(),w.end());
    vector<int> result;
    while(n != 1 && w[n-1] + w[n-2] < l)
    {
        result.push_back(n-1);
        l -= w[n-1];u -= w[n-1];
        n--;
    }
    int left = 0,right = n-1;
    while(left != right)
    {
        if(w[left] + w[right] > u)right--;
        else if(w[left] + w[right] < l)left++;
        else break;
    }
    if(left == right)while(left != n-1 && w[left] < l){left++;right++;}
    if(left == right && (w[left] < l || w[left] > u))return {};
    result.push_back(left);
    if(left != right)result.push_back(right);
    return result;
}
#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...