Submission #536643

#	Time	Username	Problem	Language	Result	Execution time	Memory
536643		terrasphere	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	468 KiB

molecules

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

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    std::vector<std::pair<int,int>> v;
    int n=w.size();
    for(int i=0;i<n;i++)
        v.push_back({w[i],i});
    std::sort(v.begin(),v.end());
    for(int i=0;i<n;i++)
        printf("%d %d %d\n",v[i].first,v[i].second,i);
    std::vector<int> answer;
    bool arr[222222];
    int left=0,right=0;
    long long sum=v[0].first;
    arr[v[0].second]=true;
    bool impossible=false;
    while(1)
    {
        if(sum<l)
        {
            right++;
            if(right>=n)
            {
                impossible=true;
                break;
            }
            sum+=v[right].first;
            arr[v[right].second]=true;
        }
        else if(sum>u)
        {
            sum-=v[left].first;
            arr[v[left].second]=false;
            left++;
        }
        else
            break;
        if(left>right)
        {
            impossible=true;
            break;
        }
    }
    printf("%lld\n",sum);
    if(impossible)
        return std::vector<int>(0);
    for(int i=0;i<n;i++)
        if(arr[i])
            answer.push_back(i);
    return answer;
}

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