Submission #588886

#TimeUsernameProblemLanguageResultExecution timeMemory
588886mahra_IOIDetecting Molecules (IOI16_molecules)C++17
100 / 100
50 ms5576 KiB
#include <bits/stdc++.h>
#include "molecules.h"
 
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
 
 
std::vector<int> find_subset(int l, int u, std::vector<int> W) {
    vector <int> ret;
    int n = W.size();
    vector <pii> w(n);
    for(int i = 0; i < n; ++i) {
        w[i] = {W[i], i};
    }
    sort(w.begin(), w.end());
    ll sum = 0;
    int left = 0, right = -1;
    while (right < n-1) {
        sum += w[++right].first;
        while (sum > u) {
            sum -= w[left++].first;
        }
        if (l <= sum && sum <= u) {
            break;
        }
    }
    if (l <= sum && sum <= u) {
        while (left <= right) ret.push_back(w[left++].second);
    }
    return ret;
}
#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...