Submission #599182

#	Time	Username	Problem	Language	Result	Execution time	Memory
599182		Jomnoi	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	212 KiB

molecules

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

vector <int> find_subset(int L, int U, vector <int> w) {
    int n = w.size();
    vector <pair <int, int>> weights;
    for(int i = 0; i < n; i++) {
        weights.emplace_back(w[i], i);
    }

    sort(weights.begin(), weights.end());

    long long sum = 0;
    int l = 0, r = 0;
    while(l < n or r < n) {
        if(r < n and sum < L) {
            sum += weights[r].first;
            r++;
        }
        else if(l < n and sum > U) {
            sum -= weights[l].first;
            l++;
        }
        else {
            vector <int> ans;
            for(int i = l; i < r; i++) {
                ans.push_back(weights[i].second);
            }
            return ans;
        }
    }
    return vector <int> ();
}

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