제출 #378008

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378008		hackermub	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	44 ms	2668 KiB

molecules

#include "molecules.h"

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

//#define int long long
#define pii pair<int,int>
#define float long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n=sz(w);
    vector<int> idx(n);
    iota(all(idx),0);
    sort(all(idx),[&w](int a,int b)->bool{
        return w[a]<w[b];
    });
    int L=0,R=0,sum=w[idx[0]];
    while(L<n && R<n && L<=R){
    	if(l<=sum && sum<=u) return vector<int>(idx.begin()+L,idx.begin()+R+1);
    	if(sum<l && R+1<n) sum+=w[idx[R+1]],R++;
    	else sum-=w[idx[L]],L++;
    }
    return {};
}

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