제출 #780631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780631		andecaandeci	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	37 ms	5588 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second

vector<int> find_subset(int l, int u, vector<int> w) {  
    int n = (int)w.size();
    vector<pair<int, int>> v(n);
    vector<int> ans;
    for (int i = 0; i < n; i++) v[i].fi = w[i], v[i].se = i;
    sort(v.begin(), v.end());
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        sum += 1ll * v[i].fi;
        if (sum > u) {
            sum -= 1ll * v[i].fi;
            break;
        }
        ans.push_back(v[i].se);
        if (sum >= l) return ans;
    }
    if ((ans.empty()) or (sum < l and (int)ans.size() == n)) return vector<int>(0);
    int r = n - 1;
    for (int i = 0; i < (int)ans.size() and r >= (int)ans.size(); i++) {
        sum += 1ll * v[r].fi - w[ans[i]];
        ans[i] = v[r].se;
        if (sum >= l) {
            sort(ans.begin(), ans.end());
            return ans;
        }
        r--;
    }
    return vector<int>(0);
}

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