Submission #432489

#	Time	Username	Problem	Language	Result	Execution time	Memory
432489		MarcoMeijer	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	300 KiB

molecules

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

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

vi find_subset(int l, int u, vi w) {
    sort(all(w));
    ll total = 0;
    vi ans;
    while(!w.empty()) {
        total += w.back();
        if(total > u) {
            total -= w.back();
            w.pop_back();
        } else {
            w.pop_back();
            ans.pb(w.size());
        }
    }
    if(total < l) return {};
    sort(all(ans));
    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