제출 #221125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
221125		joseacaz	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	66 ms	4472 KiB

molecules

#include "molecules.h"
#include <algorithm>
#include <vector>

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;

vi find_subset(int L, int U, vi W)
{
    int N = W.size();
    vector<pii> A(N);
    vi used(N), ans;

    for(int i = 0; i < N; i++)
        A[i] = {W[i], i};
    sort(A.begin(), A.end());

    if(A[0].first > U)
        return ans;
    
    int rpnt = 0;
    ll sum = 0;
    for(int lpnt = 0; lpnt < N; lpnt++)
    {
        for(; rpnt < N; rpnt++)
        {
            if(sum + A[rpnt].first > U)
                break;
            used[A[rpnt].second] = 1;
            sum += A[rpnt].first;
        }
        //[lpnt, rpnt)
        
        if ( L <= sum )
        {
            for(int i = 0; i < N; i++)
                if(used[i])
                    ans.push_back(i);
            return ans;
        }
        
        sum -= A[lpnt].first;
        used[A[lpnt].second] = 0;
    }
    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