Submission #1223238

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223238		12baater	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	328 KiB

molecules

#include "molecules.h"
#include <valarray>
#include <vector>

using namespace std;



struct number {
    int n;
    int index;
    bool operator<(const number& other) const {
        return n < other.n;
    }
};


vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<int> ans;
    vector<number> numbers;
    int total = 0;

    for (int i = 0; i < w.size(); i++) {
        number num;
        num.n = w[i];
        num.index = i;
        numbers.push_back(num);
    }

    sort(numbers.begin(),numbers.end());
    int bigCount = 0, smallCount = 0;
    int big = numbers[n-1].n, small = numbers[0].n;
    int notBig = 0;
    for (auto [num, ind] : numbers) {
        if (num == big) bigCount++;
        else notBig++;
        if (num == small) smallCount++;
    }

    vector<int> firstAns;
    vector<int> secondAns;
    int buffer = 0;
    for(int i = 0; i < n; i++) {
        total += numbers[i].n;
        firstAns.push_back(numbers[i].index);
        if(total >= l && total <= u) {
            return firstAns;
        }
    }

    total = 0;

    for(int i = notBig; i < n; i++) {
        total += numbers[i].n;
        secondAns.push_back(numbers[i].index);
        if(total >= l && total <= u) {
            return secondAns;
        }
    }
    total = 0;
    firstAns.clear();
    secondAns.clear();
    int secondBuffer = 0;
    vector<int> thirdAns;
    for (int i = smallCount; i < n-bigCount; i++) {
        firstAns.push_back(numbers[i].index);
        total += numbers[i].n;
        buffer = total;
        thirdAns.clear();
        for (int k = 0; k < smallCount; k++) {
            thirdAns.push_back(numbers[k].index);
            secondAns.clear();
            total += numbers[k].n;
            secondBuffer = total;
            for (int j = n-bigCount; j < n; j++) {
                secondAns.push_back(numbers[j].index);
                total += numbers[j].n;
                if(total >= l) {
                    firstAns.insert(firstAns.end(),secondAns.begin(),secondAns.end());
                    firstAns.insert(firstAns.end(),thirdAns.begin(),thirdAns.end());
                    return firstAns;
                }
            }
            total = secondBuffer;
        }
        total = buffer;
    }

    total = 0;
    secondAns.clear();
    thirdAns.clear();
    for (int k = 0; k < notBig; k++) {
        thirdAns.push_back(numbers[k].index);
        secondAns.clear();
        total += numbers[k].n;
        for (int j = notBig; j < n; j++) {
            secondAns.push_back(numbers[j].index);
            total += numbers[j].n;
            if(total >= l) {
                secondAns.insert(firstAns.end(),thirdAns.begin(),thirdAns.end());
                return secondAns;
            }
        }
    }

    return vector<int>(0);
}

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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