Submission #299364

#	Time	Username	Problem	Language	Result	Execution time	Memory
299364		c4ts0up	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	1053 ms	6640 KiB

molecules

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

#define pb push_back
#define ff first
#define ss second
typedef long long ll;

ll n;
vector <pair <ll,int> > arr;
vector <ll> ps;
vector <int> res;

vector<int> find_subset(int l, int u, vector<int> w) {
    n = w.size();

    // pasamos los valores al arreglo global
    for (int i=0; i<n; i++) arr.pb({(ll)(w[i]), (i)});
    // ordenamos el arreglo
    sort(arr.begin(), arr.end());
    // hacemos el prefix sum
    ps.resize(n+1);
    ps[0] = 0LL;
    for (int i=0; i<n; i++) ps[i+1] = ps[i] + arr[i].ff;

    // fuerza bruta
    int i,j, bajo, alto;
    bool flag = false;

    for (i=0; i<n && !flag; i++) {
        for (j=i; j<n && !flag; j++) {
            if (l <= ps[j+1]-ps[i] && ps[j+1]-ps[i] <= u) flag = true, bajo = i, alto = j;
        }
    }

    if (flag) {
        for (int idx=bajo; idx<=alto; idx++) res.pb(arr[idx].ss);
    }

    return res;
}

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