Submission #493418

#	Time	Username	Problem	Language	Result	Execution time	Memory
493418		Spade1	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	204 KiB

molecules

#include<bits/stdc++.h>
#include "molecules.h"
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
using namespace std;

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

    vector<pair<ll, int>> v;
    for (int i = 0; i < n; ++i) {
        v.pb({w[i], i + 1});
    }

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

    ll sum = 0;
    queue<int> q;
    for (int i = 0; i < n; ++i) {
        sum += v[i].st;
        q.push(i);
        while (sum > u) {
            sum -= v[q.front()].st;
            q.pop();
        }
        if (sum <= u && sum >= l) {
            vector<int> tmp;
            while (!q.empty()) tmp.pb(v[q.front()].nd), q.pop();
            return tmp;
        }
    }

    return vector<int>();
}

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