제출 #79973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
79973		muradeyn	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	94 ms	29456 KiB

molecules

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

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector< pair<intt,int> >a;
    for (int i = 0;i<n;i++)a.push_back({w[i],i});
    sort(a.begin(),a.end());
    if (a[0].first > u)return {};
    intt curr = 0 , sum = 0;
    for (int i = 0;i<n;i++) {
        //cout<<i<<" "<<sum<<endl;
        if (sum + a[i].first <= u) {
            sum += a[i].first;
            if (sum >= l) {
                vector<int>ans;
                for (int j = curr;j<=i;j++)ans.push_back(a[j].second);
                return ans;
            }
            continue;
        }
        sum += a[i].first;
        sum -= a[curr++].first;
        if (sum >= l) {
            vector<int>ans;
            for (int j = curr;j<=i;j++)ans.push_back(a[j].second);
            return ans;
        }
    }
    return {};
}

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