Submission #1084288

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084288		Tymond	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	155 ms	25920 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

vi find_subset(int l, int u, vi w){
    int n = sz(w);
    ll sum = 0;
    set<int> s;
    map<int, vi> pocz;
    for(int i = 0; i < n; i++){
        pocz[w[i]].pb(i);
    }
    sort(all(w));
    for(int i = n - 1; i >= 0; i--){
        sum += w[i];
        s.insert(i);
        if(sum >= l && sum <= u){
            vi ans;
            for(auto ele : s){
                ans.pb(pocz[w[ele]].back());
                pocz[w[ele]].pop_back();
            }
            return ans;
        }

        if(sum < l){
            continue;
        }

        auto it = --s.end();
        sum -= w[(*it)];
        s.erase(it);
        if(sum >= l && sum <= u){
            vi ans;
            for(auto ele : s){
                ans.pb(pocz[w[ele]].back());
                pocz[w[ele]].pop_back();
            }
            return ans;
        }
    }
    return {};
}

/*int main(){
    vi akt = find_subset(20, 21, {5, 5, 6, 6, 5});
    for(auto ele : akt){
        cout << ele << '\n';
    }
}*/

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