제출 #197491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197491		handlename	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	74 ms	6252 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    int n=w.size();
    vector<pair<int,int> > wpos;
    for (int i=0;i<n;i++){
        wpos.push_back(make_pair(w[i],i));
    }
    sort(wpos.begin(),wpos.end());
    int maxsize=0;
    long long tempsum=0;
    while (tempsum<=u && maxsize<n){
        tempsum+=wpos[maxsize].first;
        maxsize++;
    }
    if (tempsum>u) maxsize--;
    deque<int> ans;
    vector<int> temp;
    long long sum=0;
    for (int i=0;i<maxsize;i++){
        ans.push_back(wpos[i].second);
        sum+=wpos[i].first;
    }
    if (sum>=l){
        vector<int> realans;
        for (auto i:ans) realans.push_back(i);
        return realans;
    }
    for (int i=maxsize;i<n;i++){
        ans.push_back(wpos[i].second);
        ans.pop_front();
        sum-=wpos[i-maxsize].first;
        sum+=wpos[i].first;
        if (sum>=l){
            vector<int> realans;
            for (auto i:ans) realans.push_back(i);
            return realans;
        }
    }
    if (sum>=l){
        vector<int> realans;
        for (auto i:ans) realans.push_back(i);
        return realans;
    }
    else return temp;
}

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