Submission #686685

#	Time	Username	Problem	Language	Result	Execution time	Memory
686685		Bliznetc	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	212 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define F first
#define S second
//#define int long long

typedef pair < int, int > pii;
typedef vector < int >  vi;
typedef vector < vi >  vvi;

std::vector<int> find_subset(int l, int r, std::vector<int> w)
{
    int n = w.size();
    pair<int,int> a[n + 7];
    int sum = 0;
    for (int i = 0; i < n; i++) {
        a[i] = {w[i - 1], i};
        sum += a[i].F;
    }

    sort (a, a + n);

    int cur = 0;
    vector<int> result;

    int j = 0;
    int i = 0;
    set <int> d;
    while (j < n) {
        if (cur < l) {
            cur += a[j].F;
            d.insert(a[j].S);
            j++;
        }
        if (cur > r) {
            cur -= a[i].F;
            d.erase(a[i].S);
            i++;
        }
        if (cur >= l && cur <= r) {
            break;
        }
    }

    if (cur >= l && cur <= r) {
        return vector<int> (all(d));
    }
    return vector<int> (0);
}

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