제출 #411568

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
411568		nxteru	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	292 KiB

molecules

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

vector<int> find_subset(int L, int U, std::vector<int> W) {
    ll l=L,u=U;
    ll n=W.size();
    vector<pair<ll,ll>>w(n);
    for(int i=0;i<n;i++)w[i]=make_pair(W[i],i);
    sort(w.begin(),w.end());
    vector<ll>s(n),t(n);
    for(int i=0;i<n;i++){
        s[i]=w[i].first;
        if(i>0)s[i]+=s[i-1];
    }
    for(int i=n-1;i>=0;i--){
        t[i]=w[i].first;
        if(i+1<=n-1)t[i]+=t[i+1];
    }
    vector<int>ans;
    int p=0;
    for(int i=0;i<=n;i++){
        ll ss=0;
        if(i>0)ss+=s[i-1];
        while(p<n&&ss+t[p]>u)p++;
        if(p<n)ss+=t[p];
        if(l<=ss&&ss<=u){
            for(int j=0;j<i;j++)ans.push_back(w[j].second);
            for(int j=p;j<n;j++)ans.push_back(w[j].second);
            break;
        }
    }
    return ans;
}

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