제출 #139455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
139455		medk	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	73 ms	8296 KiB

molecules

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

#define ll long long
#define pb push_back
#define x first
#define y second

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w)
{
    vector<pair<ll,int>> pw;
    for(int x:w) pw.pb({(ll)(x),int(pw.size())});
    sort(pw.begin(),pw.end());
    ll sum=0;
    int ptr=0;
    vector<int> ans;
    bool flag=0;
    while(ptr<int(pw.size()))
    {
        if(sum+pw[ptr].x<l) sum+=pw[ptr].x, flag=1;
        else if(sum+pw[ptr].x<=u)
        {
            ans.pb(pw[ptr].y);
            return ans;
        }
        else break;
        ans.pb(pw[ptr].y);
        ptr++;
    }
    if(!flag) return {};
    for(int i=0;i<int(ans.size()) && pw.size()-1-i>=ans.size();i++)
    {
        sum+=pw[pw.size()-1-i].x-pw[i].x;
        ans[i]=pw[pw.size()-1-i].y;
        if(sum>=l) return ans;
    }
    return {};
}

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