제출 #305905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
305905		talant117408	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	61 ms	5368 KiB

molecules

#include "molecules.h"

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;
/*
vector <int> find_subset(int l, int u, vector <int> w);
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}

*/
vector <int> find_subset(int l, int r, vector <int> w){
    int n = w.size();
    vector <pair<ll, int>> pref(n);
    for(int i = 0; i < n; i++){
        pref[i] = {w[i], i};
    }
    sort(pref.begin(), pref.end());
    ll sum = 0;
    
    for(int i = 0, j = 0; j < n; j++){
        sum += pref[j].first;
        if(sum > r){
            while(sum > r){
                sum -= pref[i++].first;
            }
        }
        if(sum >= l){
            vector <int> inds;
            for(int k = i; k <= j; k++){
                inds.push_back(pref[k].second);
            }
            return inds;
        }
    }
    
    return vector <int> (0);
}

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