Submission #1099653

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099653		Trn115	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	40 ms	6348 KiB

molecules

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

#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define dbg(v) cerr << "\n" << #v << " = " << v << "\n"

using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pair<int,int>> a;
    for (int i = 0; i < n; ++i) a.push_back({w[i], i});
    sort(all(a));
    
    ll le = 0, sum = 0;
    vector<int> res;
    for (int i = 0; i < n; ++i) {
        sum += a[i].fi;
        while (i-le+1 > 1 && sum > u) sum -= a[le++].fi;
        if (l <= sum && sum <= u) {
            for (int j = le; j <= i; ++j) res.push_back(a[j].se);
            break;
        }
    }
    return res;
}

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