Submission #959418

#	Time	Username	Problem	Language	Result	Execution time	Memory
959418		Mystic03	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	856 KiB

molecules

#include "molecules.h"
#include <algorithm>

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int p1 = 0;
    int r = 0;
    int n = w.size();
    std::vector<pair<int, int>> ele;
    for (int i = 0; i < n; i++) {
        ele.push_back({ w[i], i });
    }

    sort(ele.begin(), ele.end());
    int currSum = 0;

    while (currSum < l) {
        if (r == w.size())    return std::vector<int>(0);

        currSum += ele[r].first;
        r++;
    }

    vector<int> res;
    if (currSum <= u) {
        for (int i = 0; i < r; i++) {
            res.push_back(ele[i].second);
        }
        return res;
    }
    r--;
    currSum -= ele[r].first;

    for (int i = r; i < w.size(); i++) {
        currSum += ele[i].first;
        currSum -= ele[p1++].first;
        if (currSum >= l && currSum <= u) {
            for (int i = p1; i <= i; i++) {
                res.push_back(ele[i].second);
            }
            return res;
        }
    }
    return std::vector<int>(0);
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         if (r == w.size())    return std::vector<int>(0);
      |             ~~^~~~~~~~~~~
molecules.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i = r; i < w.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:39:32: warning: self-comparison always evaluates to true [-Wtautological-compare]
   39 |             for (int i = p1; i <= i; i++) {
      |                              ~ ^~ ~

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