Submission #946230

#	Time	Username	Problem	Language	Result	Execution time	Memory
946230		attky	Detecting Molecules (IOI16_molecules)	C++17	19 / 100	1 ms	440 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

struct Molec {
    long long int poids;
    int pos;
    bool operator< (Molec other) {
        return poids < other.poids;
    }
};

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<Molec> molecules(n);
    for(int loop = 0; loop < n; ++loop) {
        molecules[loop] = {w[loop], loop};
    }
    sort(molecules.begin(), molecules.end());
    long long int somme = 0;
    int fin = 0;
    while(somme <= u && fin < n) {
        if(somme + molecules[fin].poids <= u) {
            somme += molecules[fin].poids;
            fin++;
        }
        else {
            break;
        }
    }
    vector<int> indice;
    if(l <= somme && somme <= u) {
        for(int loop = 0; loop < fin; ++loop) {
            indice.push_back(molecules[loop].pos);
        }
        return indice;
    }
    for(int loop = fin; loop < u; ++loop) {
        somme -= molecules[loop-fin].poids;
        somme += molecules[loop].poids;
        if(l <= somme && somme <= u) {
            for(int looping = loop-fin+1; looping <= loop; ++looping) {
                indice.push_back(molecules[looping].pos);
            }
            return indice;
        }
    }
    return indice;
}

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