Submission #54332

#	Time	Username	Problem	Language	Result	Execution time	Memory
54332		MoNsTeR_CuBe	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	3 ms	632 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
//#define int long long

using namespace std;

vector<int> find_subset(int l, int r, vector<int> w){
    int n = w.size();
    vector< pair<int, int> > v;
    for(int i = 0; i < n; i++){
        v[i] = {w[i], i};
    }
    sort(v.begin(), v.end());
    int sum = 0;
    int right = -1;
    for(int i = 0; i < n; i++){
        for(int j = right; j < n; j++){
            if(j != right) sum += v[j].first;
            //cout << sum << endl;
            if(sum >= l && sum <= r){
                vector<int> v1(0);
                for(int k = i; k <= j; k++){
                    v1.push_back(v[k].second);
                }
                return v1;
            }
            right = j;
            if(sum > r){
                sum -= v[i].first;
                break;
            }
        }
    }
    vector<int> v1(0);
    return v1;
}

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