제출 #154791

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

molecules

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

vector<int> find_subset(int l, int u, std::vector<int> w) {
    typedef pair<int,int> ii;
    vector<ii> v(w.size());
    for(int i = 0 ; i < (int)w.size() ; ++i){
        v[i] = make_pair(w[i] , i);
    }
    vector<int> ans;
    sort(v.begin(),v.end());
    int jj = 0;
    int sum = 0;
    for(int i = 0 ; i < (int)v.size() ; ++i){
        while(jj < (int)v.size() && sum + v[jj].first <= u)sum += v[jj++].first;
        if(sum >= l){
            for(int j = i ; j < jj ; ++j)ans.push_back(v[j].second);
            return ans;
        }
        sum -= v[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: 0 / 31