제출 #444659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
444659		Hanksburger	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	53 ms	7128 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[200000];
vector<int> ans;
vector<int> find_subset(int u1, int u2, vector<int> w)
{
	long long n=w.size(), l=u1, r=u2, index=0, sum=0;
    for (long long i=0; i<n; i++)
    {
        a[i].first=w[i];
        a[i].second=i;
    }
    sort(a, a+n);
    for (long long i=0; i<n; i++)
    {
        while (1)
        {
            if (l<=sum && sum<=r)
            {
                for (long long j=i; j<index; j++)
                    ans.push_back(a[j].second);
                return ans;
            }
            if (index<n && sum<=r)
            {
                sum+=a[index].first;
                index++;
            }
            else
                break;
        }
        sum-=a[i].first;
    }
    return ans;
}

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