Submission #492102

#	Time	Username	Problem	Language	Result	Execution time	Memory
492102		Zeriont	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	212 KiB

molecules

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <string>
#include <list>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<int, pi> ppi;

vector<int> find_subset(int l, int u, std::vector<int> w) {
    int sum = 0;
    vi ans;

    sort(w.begin(), w.end());

    for (int i = w.size()-1; i >= 0; i--)
    {
        if (sum + w[i] > u) continue;
        sum += w[i];
        ans.push_back(i);
        if (sum >= l) break;
    }
    
    if (sum < l || sum > u) return vi(0);
    else return ans;
}

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