Submission #348748

#	Time	Username	Problem	Language	Result	Execution time	Memory
348748		NachoLibre	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	34 ms	384 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> dr;
    int n = w.size();
    multiset<int> s;
    long long sm = 0;
    int fl = -1, fr;
    for(int i = n - 1; i >= 0; --i) {
        sm += w[i];
        if(sm >= l) {
            if(sm <= u) {
                fl = 0;
                fr = sm;
            }
            break;
        }
        s.insert(sm);
    }
    sm = 0;
    for(int i = 0; i < n; ++i) {
        if(i + (int)s.size() == n) s.erase(--s.end());
        sm += w[i];
        if(sm >= l) {
            if(sm <= u) {
                fl = sm;
                fr = 0;
            }
            break;
        }
        auto it = s.lower_bound(l - sm);
        if(it != s.end() && sm + *it <= u) {
            fl = sm;
            fr = *it;
            break;
        }
    }
    if(fl != -1) {
        sm = 0;
        for(int i = 0; i < n; ++i) {
            sm += w[i];
            if(sm > fl) break;
            dr.push_back(i);
        }
        sm = 0;
        for(int i = n - 1; i >= 0; --i) {
            sm += w[i];
            if(sm > fr) break;
            dr.push_back(i);
        }
    }
    assert((int)dr.size() <= n && (dr.size() || fl == -1));
    return dr;
}

#ifdef wambule
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}
#endif

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