Submission #415985

#TimeUsernameProblemLanguageResultExecution timeMemory
415985aris12345678Detecting Molecules (IOI16_molecules)C++14
9 / 100
2 ms296 KiB
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;

const int mxN = 200005;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int, int> > arr;
    int n = w.size();
    for(int i = 0; i < n; i++)
        arr.push_back({w[i], i});
    sort(arr.begin(), arr.end());
    vector<int> ans;
    int i = 0, j = 0, sum = 0;
    while(j < n) {
        if(sum < l)
            sum += arr[j++].first;
        else
            sum -= arr[i++].first;
        if(sum >= l && sum <= u) break;
    }
    if(sum >= l && sum <= u) {
        for(int k = i; k < j; k++)
            ans.push_back(arr[k].second);
    }
    return ans;
}
#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...