Submission #1083949

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083949		pravcoder	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	348 KiB

molecules

#include "molecules.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> v2i;
typedef pair<int, int> pi;
typedef vector<pi> vpi;

#define pb push_back
#define mp make_pair
#define rept(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vpi ms;
    int n = w.size();
    rep(i, n) ms.pb({ w[i], i });
    sort(ms.begin(), ms.end());
    ll s = 0;
    queue<pi> q;
    bool found = true;
    for (int i = 0; i < n && (s < l || s > u);) {
        if (s < l) {
            q.push(ms[i]);
            s += ms[i].first;
            i++;
        }
        else {
            s -= q.front().first;
            q.pop();
        }
        if (i >= n) found = false;
    }

    vi res;
    res.reserve(n);
    if (!found && (s < l || s > u)) return res;
    while (!q.empty()) {
        res.pb(q.front().second);
        q.pop();
    }
    return res;
}

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