제출 #623019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623019		Minindu2006	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	40 ms	4020 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int, int>> ww;
    int sz = w.size();
    for(int i=0;i<sz;i++)
        ww.push_back({w[i], i});
    sort(ww.begin(), ww.end());
    int a = 0, b = 0, csum = ww[0].first;
    int can = -1;
    while(b < sz)
    {
        if(csum >= l && csum <= u)
        {
            can = 1;
            break;
        }

        if(csum < l)
        {
            b++;
            if(b == sz)
                break;
            csum += ww[b].first;
        }
        else if(csum > u)
        {
            csum -= ww[a].first;
            a++;
        }
    }
    vector<int> ans;
    if(can == -1)
        return ans;
    for(int i=a;i<=b;i++)
        ans.push_back(ww[i].second);
    return ans;
}

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